Dynamic mechanism design

DOI10.1016/J.TCS.2008.12.029MaRDI QIDQ1014626zbMATH OpenOpenAlexFDO

Authors D. Bilò, Luciano Gualà, Guido Proietti

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

zbMATH Keywords

algorithmic mechanism designon-line problemsdynamic algorithmstruthful mechanismsapproximate mechanisms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Games involving graphs (91A43)

Recommendations

• Strongly polynomial-time truthful mechanisms in one shot
• Exact and approximate truthful mechanisms for the shortest paths tree problem
• Truthful mechanisms for selfish routing and two-parameter agents
• Truthful mechanisms for selfish routing and two-parameter agents
• Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem

Cites work

• A data structure for dynamic trees
• Algorithmic mechanism design
• Approximation techniques for utilitarian mechanism design
• Computing and Combinatorics
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Decentralization and Mechanism Design for Online Machine Scheduling
• Maintaining information in fully dynamic trees with top trees
• On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem
• Online algorithms. The state of the art
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Truthful and Near-Optimal Mechanism Design via Linear Programming

Cited in

(8)

• On the Futility of Dynamics in Robust Mechanism Design
• scientific article; zbMATH DE number 5585838 (Why is no real title available?)
• Mechanism design and intentions
• Designing stable mechanisms for economic environments
• Strongly polynomial-time truthful mechanisms in one shot
• Truthful mechanisms for selfish routing and two-parameter agents
• An algorithm composition scheme preserving monotonicity
• Truthful mechanisms for selfish routing and two-parameter agents

This page was built for publication: Dynamic mechanism design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014626)