Pareto efficiency and approximate pareto efficiency in routing and load balancing games

Yonatan Aumann; Yair Dombb

doi:10.1007/978-3-642-16170-4_7

Pareto efficiency and approximate pareto efficiency in routing and load balancing games

Yonatan Aumann
, Yair Dombb

Department of Computer Science and Artificial Intelligence

Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

16 Scopus citations

Abstract

We analyze the Pareto efficiency, or inefficiency, of solutions to routing games and load balancing games, focusing on Nash equilibria and greedy solutions to these games. For some settings, we show that the solutions are necessarily Pareto optimal. When this is not the case, we provide a measure to quantify the distance of the solution from Pareto efficiency. Using this measure, we provide upper and lower bounds on the "Pareto inefficiency" of the different solutions. The settings we consider include load balancing games on identical, uniformly-related, and unrelated machines, both using pure and mixed strategies, and nonatomic routing in general and some specific networks.

Original language	English
Title of host publication	Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings
Pages	66-77
Number of pages	12
Edition	M4D
DOIs	https://doi.org/10.1007/978-3-642-16170-4_7
State	Published - 2010
Event	3rd International Symposium on Algorithmic Game Theory, SAGT 2010 - Athens, Greece Duration: 18 Oct 2010 → 20 Oct 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	M4D
Volume	6386 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd International Symposium on Algorithmic Game Theory, SAGT 2010
Country/Territory	Greece
City	Athens
Period	18/10/10 → 20/10/10

Access to Document

10.1007/978-3-642-16170-4_7

Cite this

Aumann, Y., & Dombb, Y. (2010). Pareto efficiency and approximate pareto efficiency in routing and load balancing games. In Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings (M4D ed., pp. 66-77). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6386 LNCS, No. M4D). https://doi.org/10.1007/978-3-642-16170-4_7

@inproceedings{c9665be8fbee4ac9bbe1346c87b15087,

title = "Pareto efficiency and approximate pareto efficiency in routing and load balancing games",

abstract = "We analyze the Pareto efficiency, or inefficiency, of solutions to routing games and load balancing games, focusing on Nash equilibria and greedy solutions to these games. For some settings, we show that the solutions are necessarily Pareto optimal. When this is not the case, we provide a measure to quantify the distance of the solution from Pareto efficiency. Using this measure, we provide upper and lower bounds on the {"}Pareto inefficiency{"} of the different solutions. The settings we consider include load balancing games on identical, uniformly-related, and unrelated machines, both using pure and mixed strategies, and nonatomic routing in general and some specific networks.",

author = "Yonatan Aumann and Yair Dombb",

year = "2010",

doi = "10.1007/978-3-642-16170-4\_7",

language = "אנגלית",

isbn = "3642161693",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "M4D",

pages = "66--77",

booktitle = "Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings",

edition = "M4D",

note = "3rd International Symposium on Algorithmic Game Theory, SAGT 2010 ; Conference date: 18-10-2010 Through 20-10-2010",

}

Aumann, Y & Dombb, Y 2010, Pareto efficiency and approximate pareto efficiency in routing and load balancing games. in Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings. M4D edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. M4D, vol. 6386 LNCS, pp. 66-77, 3rd International Symposium on Algorithmic Game Theory, SAGT 2010, Athens, Greece, 18/10/10. https://doi.org/10.1007/978-3-642-16170-4_7

Pareto efficiency and approximate pareto efficiency in routing and load balancing games. / Aumann, Yonatan; Dombb, Yair.
Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings. M4D. ed. 2010. p. 66-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6386 LNCS, No. M4D).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Pareto efficiency and approximate pareto efficiency in routing and load balancing games

AU - Aumann, Yonatan

AU - Dombb, Yair

PY - 2010

Y1 - 2010

N2 - We analyze the Pareto efficiency, or inefficiency, of solutions to routing games and load balancing games, focusing on Nash equilibria and greedy solutions to these games. For some settings, we show that the solutions are necessarily Pareto optimal. When this is not the case, we provide a measure to quantify the distance of the solution from Pareto efficiency. Using this measure, we provide upper and lower bounds on the "Pareto inefficiency" of the different solutions. The settings we consider include load balancing games on identical, uniformly-related, and unrelated machines, both using pure and mixed strategies, and nonatomic routing in general and some specific networks.

AB - We analyze the Pareto efficiency, or inefficiency, of solutions to routing games and load balancing games, focusing on Nash equilibria and greedy solutions to these games. For some settings, we show that the solutions are necessarily Pareto optimal. When this is not the case, we provide a measure to quantify the distance of the solution from Pareto efficiency. Using this measure, we provide upper and lower bounds on the "Pareto inefficiency" of the different solutions. The settings we consider include load balancing games on identical, uniformly-related, and unrelated machines, both using pure and mixed strategies, and nonatomic routing in general and some specific networks.

UR - https://www.scopus.com/pages/publications/78649592918

U2 - 10.1007/978-3-642-16170-4_7

DO - 10.1007/978-3-642-16170-4_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:78649592918

SN - 3642161693

SN - 9783642161698

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 66

EP - 77

BT - Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings

T2 - 3rd International Symposium on Algorithmic Game Theory, SAGT 2010

Y2 - 18 October 2010 through 20 October 2010

ER -

Aumann Y, Dombb Y. Pareto efficiency and approximate pareto efficiency in routing and load balancing games. In Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings. M4D ed. 2010. p. 66-77. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); M4D). doi: 10.1007/978-3-642-16170-4_7

Pareto efficiency and approximate pareto efficiency in routing and load balancing games

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this