In *Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms*, pages 189--198, New Orleans, Louisiana, 2007. Society for Industrial and Applied Mathematics.

Paper abstract bibtex

Paper abstract bibtex

A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst case strong equilibrium to the social optimum. In contrast to the traditional price of anarchy, which quantifies the loss incurred due to both selfishness and lack of coordination, the strong price of anarchy isolates the loss originated from selfishness from that obtained due to lack of coordination. We study the strong price of anarchy in two settings, one of job scheduling and the other of network creation. In the job scheduling game we show that for unrelated machines the strong price of anarchy can be bounded as a function of the number of machines and the size of the coalition. For the network creation game we show that the strong price of anarchy is at most 2. In both cases we show that a strong equilibrium always exists, except for a well defined subset of network creation games.

@inproceedings{andelman_strong_2007, address = {New Orleans, Louisiana}, title = {Strong price of anarchy}, isbn = {978-0-898716-24-5}, url = {http://portal.acm.org/citation.cfm?id=1283404}, abstract = {A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst case strong equilibrium to the social optimum. In contrast to the traditional price of anarchy, which quantifies the loss incurred due to both selfishness and lack of coordination, the strong price of anarchy isolates the loss originated from selfishness from that obtained due to lack of coordination. We study the strong price of anarchy in two settings, one of job scheduling and the other of network creation. In the job scheduling game we show that for unrelated machines the strong price of anarchy can be bounded as a function of the number of machines and the size of the coalition. For the network creation game we show that the strong price of anarchy is at most 2. In both cases we show that a strong equilibrium always exists, except for a well defined subset of network creation games.}, urldate = {2009-03-13TZ}, booktitle = {Proceedings of the eighteenth annual {ACM}-{SIAM} symposium on {Discrete} algorithms}, publisher = {Society for Industrial and Applied Mathematics}, author = {Andelman, Nir and Feldman, Michal and Mansour, Yishay}, year = {2007}, pages = {189--198} }

Downloads: 0