Dynamic mechanism design
From MaRDI portal
Publication:1014626
DOI10.1016/j.tcs.2008.12.029zbMath1159.90025MaRDI QIDQ1014626
Guido Proietti, Davide Bilò, Luciano Gualà
Publication date: 29 April 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.029
dynamic algorithms; algorithmic mechanism design; on-line problems; truthful mechanisms; approximate mechanisms
90C35: Programming involving graphs or networks
91A43: Games involving graphs
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Online algorithms. The state of the art
- A data structure for dynamic trees
- Maintaining information in fully dynamic trees with top trees
- Approximation techniques for utilitarian mechanism design
- On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Truthful and Near-Optimal Mechanism Design via Linear Programming
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Computing and Combinatorics
- Decentralization and Mechanism Design for Online Machine Scheduling
- Algorithmic mechanism design