An algorithm composition scheme preserving monotonicity

DOI10.1145/1281100.1281173MaRDI QIDQ5401463zbMATH OpenOpenAlexFDO

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

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281173

zbMATH Keywords

algorithmic mechanism designselfish agentstruthful mechanismsstep-integral monotonicity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43) Network design and communication in computer systems (68M10)

Recommendations

• Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems
• Exact and approximate truthful mechanisms for the shortest paths tree problem
• Dynamic mechanism design
• Truthful mechanisms for selfish routing and two-parameter agents
• Truthful mechanisms for selfish routing and two-parameter agents

Cited in

(2)

• Strategyproof auction mechanisms for network procurement
• A note on the monotonicity of the ES algorithm

This page was built for publication: An algorithm composition scheme preserving monotonicity

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