Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round
ACM SIGecom Exchanges, , 201614(2),22-25.
We show that algorithms that follow the relax-and-round paradigm translate approximation guarantees into Price of Anarchy guarantees, provided that the rounding is oblivious and the relaxation is smooth. We use this meta result to obtain simple, near-optimal mechanisms for a broad range of optimization problems such as combinatorial aucti...More
PPT (Upload PPT)