Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14383
For citation please use:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrenner, Janina
dc.contributor.authorSchäfer, Guido
dc.date.accessioned2021-12-17T10:07:20Z-
dc.date.available2021-12-17T10:07:20Z-
dc.date.issued2007
dc.identifier.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15610-
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14383-
dc.description.abstractMehta, 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.en
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.othercooperative game theoryen
dc.subject.othermechanism designen
dc.subject.othercost sharing mechanismsen
dc.subject.othercombinatorial optimizationen
dc.subject.otherscheduling problemsen
dc.titleSingleton Acyclic Mechanisms and their Applications to Scheduling Problemsen
dc.typeResearch Paperen
tub.accessrights.dnbfreeen
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2007, 42en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
dc.type.versionsubmittedVersionen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften » Inst. Mathematikde
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-042-2007.pdf
Format: Adobe PDF | Size: 206.7 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.