The Anarchy of Scheduling Without Money

DOI10.1007/978-3-662-53354-3_24zbMath1403.91055arXiv1607.03688OpenAlexW2471888476MaRDI QIDQ2819467

Maria Kyropoulou, Yiannis Giannakopoulos, Elias Koutsoupias

Publication date: 29 September 2016

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.03688

zbMATH Keywords

scheduling problemprice of anarchyno payment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Other game-theoretic models (91A40)

Related Items (2)

The anarchy of scheduling without money ⋮ The Anarchy of Scheduling Without Money

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• On truthfulness and approximation for scheduling selfish tasks
• Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
• Scheduling without payments
• A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
• Optimal collusion-resistant mechanisms with verification
• The Anarchy of Scheduling Without Money
• Approximately optimal mechanism design via differential privacy
• Optimal Lower Bounds for Anonymous Scheduling Mechanisms
• Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
• Manipulation of Voting Schemes: A General Result
• Algorithmic Game Theory
• Automata, Languages and Programming
• Algorithmic mechanism design

This page was built for publication: The Anarchy of Scheduling Without Money