English
Related papers

Related papers: Computational Efficiency Requires Simple Taxation

200 papers

We consider crowdsourcing problems where the users are asked to provide evaluations for items; the user evaluations are then used directly, or aggregated into a consensus value. Lacking an incentive scheme, users have no motive in making…

Computer Science and Game Theory · Computer Science 2017-05-09 Luca de Alfaro , Marco Faella , Vassilis Polychronopoulos , Michael Shavlovsky

A competitive market is modeled as a game of incomplete information. One player observes some payoff-relevant state and can sell (possibly noisy) messages thereof to the other, whose willingness to pay is contingent on their own beliefs. We…

Computer Science and Game Theory · Computer Science 2025-05-02 Thomas Falconer , Anubhav Ratha , Jalal Kazempour , Pierre Pinson , Maryam Kamgarpour

We consider a variant of the standard Bayesian mechanism, where players evaluate their outcomes and constraints in an ex-ante manner. Such a model captures a major form of modern online advertising where an advertiser is concerned with…

Computer Science and Game Theory · Computer Science 2022-03-01 Bonan Ni , Pingzhong Tang

Competition complexity formalizes a compelling intuition: rather than refining the mechanism, how much additional competition is sufficient for a simple mechanism to compete with an optimal one? We begin the study of this question in…

Computer Science and Game Theory · Computer Science 2026-02-25 Eugenio Cruz-Ossa , Sebastian Perez-Salazar , Victor Verdugo

Quantifying the complexity of systems consisting of many interacting parts has been an important challenge in the field of complex systems in both abstract and applied contexts. One approach, the complexity profile, is a measure of the…

Pattern Formation and Solitons · Physics 2013-06-03 Yavni Bar-Yam , Dion Harmon , Yaneer Bar-Yam

While optimal taxation theory provides clear prescriptions for tax design, translating these insights into actual tax codes remains difficult. Existing work largely offers theoretical characterizations of optimal systems, while practical…

General Finance · Quantitative Finance 2026-01-23 Mark Verhagen , Menno Schellekens , Michael Garstka

Coding theory revolves around the incorporation of redundancy into transmitted symbols, computation tasks, and stored data to guard against adversarial manipulation. However, error correction in coding theory is contingent upon a strict…

Information Theory · Computer Science 2025-12-24 Hanzaleh Akbari Nodehi , Viveck R. Cadambe , Mohammad Ali Maddah-Ali

Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…

Computational Complexity · Computer Science 2026-04-08 Joseph M. Hellerstein

We study fair resource allocation under a connectedness constraint wherein a set of indivisible items are arranged on a path and only connected subsets of items may be allocated to the agents. An allocation is deemed fair if it satisfies…

Computer Science and Game Theory · Computer Science 2021-01-27 Neeldhara Misra , Chinmay Sonar , P. R. Vaidyanathan , Rohit Vaish

Judgment aggregation is a framework to aggregate individual opinions on multiple, logically connected issues into a collective outcome. These opinions are cast by judges, which can be for example referees, experts, advisors or jurors,…

Computer Science and Game Theory · Computer Science 2024-04-01 Robert Bredereck , Junjie Luo

Mechanism design is addressed in the context of fair allocations of indivisible goods with monetary compensation. Motivated by a real-world social choice problem, mechanisms with verification are considered in a setting where (i) agents'…

Computer Science and Game Theory · Computer Science 2012-09-18 Gianluigi Greco , Francesco Scarcello

Complexity remains one of the central challenges in science and technology. Although several approaches at defining and/or quantifying complexity have been proposed, at some point each of them seems to run into intrinsic limitations or…

Other Computer Science · Computer Science 2021-10-05 Luciano da F. Costa , Guilherme S. Domingues

We present a general framework for designing approximately revenue-optimal mechanisms for multi-item additive auctions, which applies to both truthful and non-truthful auctions. Given a (not necessarily truthful) single-item auction format…

Computer Science and Game Theory · Computer Science 2022-09-23 Constantinos Daskalakis , Maxwell Fishelson , Brendan Lucier , Vasilis Syrgkanis , Santhoshini Velusamy

We study the design of truthful mechanisms for set systems, i.e., scenarios where a customer needs to hire a team of agents to perform a complex task. In this setting, frugality [Archer&Tardos'02] provides a measure to evaluate the "cost of…

Computer Science and Game Theory · Computer Science 2012-11-09 Ning Chen , Edith Elkind , Nick Gravin , Fedor Petrov

Atomic congestion games are a classic topic in network design, routing, and algorithmic game theory, and are capable of modeling congestion and flow optimization tasks in various application areas. While both the price of anarchy for such…

Computer Science and Game Theory · Computer Science 2024-10-23 Cornelius Brand , Robert Ganian , Subrahmanyam Kalyanasundaram , Fionn Mc Inerney

We provide the first separation in the approximation guarantee achievable by truthful and non-truthful combinatorial auctions with polynomial communication. Specifically, we prove that any truthful mechanism guaranteeing a…

Computer Science and Game Theory · Computer Science 2020-11-17 Sepehr Assadi , Hrishikesh Khandeparkar , Raghuvansh R. Saxena , S. Matthew Weinberg

Mobile crowdsensing leverages mobile devices (e.g., smart phones) and human mobility for pervasive information exploration and collection; it has been deemed as a promising paradigm that will revolutionize various research and application…

Networking and Internet Architecture · Computer Science 2013-08-22 Kai Han , Chi Zhang , Jun Luo

Many definitions of business processes refer to business goals, value creation, or profits/gains of sorts. Nevertheless, the focus of formal methods research on business processes, like the well-known soundness property, lies on correctness…

Computer Science and Game Theory · Computer Science 2020-06-12 Tobias Heindel , Ingo Weber

We consider the point-to-point message passing model of communication in which there are $k$ processors with individual private inputs, each $n$-bit long. Each processor is located at the node of an underlying undirected graph and has…

Computational Complexity · Computer Science 2016-02-22 Arkadev Chattopadhyay , Sagnik Mukhopadhyay

Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility, doing so might present serious computational problems.…

Computer Science and Game Theory · Computer Science 2011-06-15 Joseph Y. Halpern , Rafael Pass