Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems

DOI10.1007/978-3-540-79309-0_28zbMath1136.91495OpenAlexW1542926844MaRDI QIDQ5459996

Guido Schäfer, Janina A. Brenner

Publication date: 2 May 2008

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

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15610

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (7)

Beyond Moulin mechanisms ⋮ Is Shapley cost sharing optimal? ⋮ Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games ⋮ Cost-sharing mechanisms for scheduling under general demand settings ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Beyond Moulin mechanisms
• Minimizing mean flow time with release time constraint
• Minimizing average completion time in the presence of release dates
• Incremental cost sharing: Characterization by coalition strategy-proofness
• New trade-offs in cost-sharing mechanisms
• Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
• Cost Sharing Methods for Makespan and Completion Time Scheduling
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Techniques for scheduling with rejection
• Optimal Efficiency Guarantees for Network Design Mechanisms
• Bounds on Multiprocessing Timing Anomalies
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Automata, Languages and Programming

This page was built for publication: Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems