Abstract
Mechanism design is concerned with computing desired outcomes in situations where data is distributed among selfish agents. We discuss some of the most fundamental questions in the design of mechanisms, and derive simple answers by interpreting the problem in graph-theoretic terms. Specifically, much of mechanism design is thereby reformulated as shortest path problems.
Original language | English |
---|---|
Title of host publication | Gems of Combinatorial Optimization and Graph Algorithms |
Publisher | Springer International Publishing |
Pages | 83-94 |
Number of pages | 12 |
ISBN (Electronic) | 9783319249711 |
ISBN (Print) | 9783319249704 |
DOIs | |
Publication status | Published - 31 Jan 2016 |
Keywords
- allocation rule
- type space
- type graph
- true type
- Vickrey auction