Local computation mechanism design

Avinatan Hassidim, Yishay Mansour, Shai Vardi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 replies to different queries are consistent with the same global feasible solution. When the mechanism employs payments, the computation of the payments is also done in polylogarithmic time and space. Furthermore, the mechanism needs to maintain incentive compatibility with respect to the allocation and payments. We present local computation mechanisms for a variety of classical game-theoretical problems: (1) stable matching, (2) job scheduling, (3) combinatorial auctions for unit-demand and k-minded bidders, and (4) the housing allocation problem. For stable matching, some of our techniques may have implications to the global (non-LCA) setting. Specifically, we show that when the men's preference lists are bounded, we can achieve an arbitrarily good approximation to the stable matching within a fixed number of iterations of the Gale-Shapley algorithm.

Original languageEnglish
Title of host publicationEC 2014 - Proceedings of the 15th ACM Conference on Economics and Computation
PublisherAssociation for Computing Machinery
Pages601-615
Number of pages15
ISBN (Print)9781450325653
DOIs
StatePublished - 2014
Event15th ACM Conference on Economics and Computation, EC 2014 - Palo Alto, CA, United States
Duration: 8 Jun 201412 Jun 2014

Publication series

NameEC 2014 - Proceedings of the 15th ACM Conference on Economics and Computation

Conference

Conference15th ACM Conference on Economics and Computation, EC 2014
Country/TerritoryUnited States
CityPalo Alto, CA
Period8/06/1412/06/14

Keywords

  • local computation algorithms
  • mechanism design
  • stable matching

Fingerprint

Dive into the research topics of 'Local computation mechanism design'. Together they form a unique fingerprint.

Cite this