Economics and Computation (TEAC)


Search Issue
enter search term and/or author name


ACM Transactions on Economics and Computation (TEAC) - Special Issue on EC'14, Volume 4 Issue 4, August 2016

Section: Special Issue on EC'14

Introduction to the Special Issue on EC'14
Vincent Conitzer, David Easley
Article No.: 19
DOI: 10.1145/2953046

The Complexity of Fairness Through Equilibrium
Abraham Othman, Christos Papadimitriou, Aviad Rubinstein
Article No.: 20
DOI: 10.1145/2956583

Competitive equilibrium from equal incomes (CEEI) is a well-known fair allocation mechanism with desirable fairness and efficiency properties; however, with indivisible resources, a CEEI may not exist [Foley 1967; Varian 1974; Thomson and Varian...

Local Computation Mechanism Design
Avinatan Hassidim, Yishay Mansour, Shai Vardi
Article No.: 21
DOI: 10.1145/2956584

We introduce the notion of local computation mechanism design—designing game-theoretic mechanisms that run in polylogarithmic time and space. Local computation mechanisms reply to each query in polylogarithmic time and space, and the...

Optimal Contest Design for Simple Agents
Arpita Ghosh, Robert Kleinberg
Article No.: 22
DOI: 10.1145/2930955

Incentives are more likely to elicit desired outcomes when they are designed based on accurate models of agents’ strategic behavior. A growing literature, however, suggests that people do not quite behave like standard economic agents in a...

Recency, Records, and Recaps: Learning and Nonequilibrium Behavior in a Simple Decision Problem
Drew Fudenberg, Alexander Peysakhovich
Article No.: 23
DOI: 10.1145/2956581

Nash equilibrium takes optimization as a primitive, but suboptimal behavior can persist in simple stochastic decision problems. This has motivated the development of other equilibrium concepts such as cursed equilibrium and behavioral equilibrium....

Bounds for the Query Complexity of Approximate Equilibria
Paul W. Goldberg, Aaron Roth
Article No.: 24
DOI: 10.1145/2956582

We analyze the number of payoff queries needed to compute approximate equilibria of multi-player games. We find that query complexity is an effective tool for distinguishing the computational difficulty of alternative solution concepts, and we...

Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries
John Fearnley, Rahul Savani
Article No.: 25
DOI: 10.1145/2956579

We study the deterministic and randomized query complexity of finding approximate equilibria in a k × k bimatrix game. We show that the deterministic query complexity of finding an ε-Nash equilibrium when &epsilon <...