Milan Bradonjic ; Gunes Ercal ; Adam Meyerson ; Alan Roytman - The Price of Mediation

dmtcs:1255 - Discrete Mathematics & Theoretical Computer Science, February 11, 2014, Vol. 16 no. 1 -
The Price of MediationArticle

Authors: Milan Bradonjic 1; Gunes Ercal 2; Adam Meyerson 3; Alan Roytman 3

  • 1 Alcatel Lucent Bell Labs
  • 2 Department. of Computer Science [Illinois]
  • 3 Computer Science Department [UCLA]

We study the relationship between correlated equilibria and Nash equilibria. In contrast to previous work focusing on the possible benefits of a benevolent mediator, we define and bound the Price of Mediation (PoM): the ratio of the social cost (or utility) of the worst correlated equilibrium to the social cost (or utility) of the worst Nash. We observe that in practice, the heuristics used for mediation are frequently non-optimal, and from an economic perspective mediators may be inept or self-interested. Recent results on computation of equilibria also motivate our work. We consider the Price of Mediation for general games with small numbers of players and pure strategies. For two player, two strategy games we give tight bounds in the non-negative cost model and the non-negative utility model. For larger games (either more players, or more pure strategies per player, or both) we show that the PoM can be arbitrary. We also have many results on symmetric congestion games (also known as load balancing games). We show that for general convex cost functions, the PoM can grow exponentially in the number of players. We prove that the PoM is one for linear costs and at most a small constant (but can be larger than one) for concave costs. For polynomial cost functions, we prove bounds on the PoM which are exponential in the degree.

Volume: Vol. 16 no. 1
Section: Discrete Algorithms
Published on: February 11, 2014
Accepted on: July 23, 2015
Submitted on: June 12, 2012
Keywords: Discrete Algorithms,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Consultation statistics

This page has been seen 729 times.
This article's PDF has been downloaded 297 times.