Scheduling without payments
From MaRDI portal
Publication:1678760
DOI10.1007/S00224-013-9473-0zbMath1380.90120OpenAlexW2172987439MaRDI QIDQ1678760
Publication date: 7 November 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9473-0
Related Items (11)
Heterogeneous facility location without money ⋮ Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location ⋮ Multi-unit assignment under dichotomous preferences ⋮ Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design ⋮ The anarchy of scheduling without money ⋮ Combinatorial auctions without money ⋮ Average-case approximation ratio of scheduling without payments ⋮ A new lower bound for deterministic truthful scheduling ⋮ Unnamed Item ⋮ The Anarchy of Scheduling Without Money ⋮ The Pareto frontier of inefficiency in mechanism design
Cites Work
- 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
- Algorithmic mechanism design (extended abstract)
- Approximately optimal mechanism design via differential privacy
- Strategyproof Approximation of the Minimax on Networks
- A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms
- Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
- Manipulation of Voting Schemes: A General Result
- Mechanism Design for Fractional Scheduling on Unrelated Machines
- Algorithmic Game Theory
- Automata, Languages and Programming
- Automata, Languages and Programming
- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
This page was built for publication: Scheduling without payments
