direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Logo der TU Berlin

Inhalt des Dokuments

Preprint 42-2007

Combinatorial Optimization & Graph Algorithms group (COGA-Preprints)

Singleton Acyclic Mechanisms and their Applications to Scheduling Problems
not available
cooperative game theory, mechanism design, cost sharing mechanisms, combinatorial optimization, scheduling problems
Mehta, Roughgarden, and Sundararajan recently introduced a new class of cost sharing mechanisms called acyclic mechanisms}. These mechanisms achieve a slightly weaker notion of truthfulness than the well-known Moulin mechanisms, but provide additional freedom to improve budget balance and social cost approximation guarantees. In this paper, we investigate the potential of acyclic mechanisms for cost sharing games arising from combinatorial optimization problems. In particular, we study a subclass of acyclic mechanisms which we term singleton acyclic mechanisms}. We show that every} ρ-approximate algorithm for the underlying optimization problem can be turned into a singleton acyclic mechanism that is weakly-groupstrategyproof and ρ-budget balanced. Based on this result, we develop singleton acyclic mechanisms for parallel machine scheduling problems with completion time, flow time and makespan objectives. As it turns out, singleton acyclic mechanisms perform extremely well for completion time objectives both with respect to budget balance and social cost.
Download as [PDF]
Title: Source

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe