A simple and fast algorithm for convex decomposition in relax-and-round mechanisms
Year of publication: |
2019
|
---|---|
Authors: | Bichler, Martin ; Fadaei, Salman ; Kraft, Dennis |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 103.2019, p. 277-287
|
Subject: | Algorithmic mechanism design | Approximation algorithms | Logistics | Linear programming | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Logistik | Mechanismus-Design-Theorie | Mechanism design |
-
Black-box reductions for cost-sharing mechanism design
Georgiou, Konstantinos, (2019)
-
Approximately optimal auctions for correlated bidders
Dobzinski, Shahar, (2015)
-
Computational complexity of convoy movement planning problems
Gopalan, Ram, (2015)
- More ...
-
Generalized assignment problem : truthful mechanism design without money
Fadaei, Salman, (2017)
-
Truthfulness with value-maximizing bidders : on the limits of approximation in combinatorial markets
Fadaei, Salman, (2017)
-
Fadaei, Salman, (2011)
- More ...