Congestion games with multisets of resources and applications in synthesis

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 45, Issue , 2015, Pages 365-379

  Avni, Guy ^a   Kupferman, Orna ^a   Tamir, Tami ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Congestion games; Equilibrium existence and computation; Equilibrium inefficiency; Multiset strategies

Indexed keywords

COMPONENT LIBRARIES; CONGESTION GAMES; LOWER BOUNDS; MULTISET; NETWORK FORMATION; NON-COOPERATIVE; PURE NASH EQUILIBRIUM; SYSTEM'S QUALITY;

SOFTWARE ENGINEERING;

EID: 84958742284     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2015.365     Document Type: Conference Paper

References (30)

1. H. Ackermann and A. Skopalik. Complexity of pure Nash equilibria in player-specific network congestion games. Internet Mathematics, 5(4):321-515, 2008.
2. S. Aland, D. Dumrauf, M. Gairing, B. Monien, and F. Schoppmann. Exact price of anarchy for polynomial congestion games. SIAM J. Comput., 40(5):1211-1233, 2011.
3. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. SIAM J. Comput., 38(4):1602-1623, 2008.
4. G. Avni and O. Kupferman. Synthesis from component libraries with costs. In Proc. 25th CONCUR, LNCS 8704, pages 156-172. Springer, 2014.
5. G. Avni, O. Kupferman, and T. Tamir. Network-formation games with regular objectives. In Proc. 17th FoSSaCS, LNCS 8412, pages 119-133. Springer, 2014.
6. B. Awerbuch, Y. Azar, and A. Epstein. The price of routing unsplittable flow. SIAM J. Comput., 42(1):160-177, 2013.
7. N. Basilico, N. Gatti, and F. Amigoni. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies. In Proc. 8th AAMAS, 2009.
8. K. Bhawalkar, M. Gairing, and T. Roughgarden. Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness. In ESA (2), pages 17-28, 2010.
9. V. Bilò. A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. In WAOA, pages 215-228, 2012.
10. I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. Algorithmica, 61(3):606-637, 2011.
11. G. Christodoulou and M. Gairing. Price of stability in polynomial congestion games. In Proc. 40th ICALP, pages 496-507, 2013.
12. G. Christodoulou and E. Koutsoupias. On the price of anarchy and stability of correlated equilibria of linear congestion games. In ESA, pages 59-70, 2005.
13. N. Daniele, F. Guinchiglia, and M.Y. Vardi. Improved automata generation for linear temporal logic. In Proc. 11th CAV, LNCS 1633, pages 249-260. Springer, 1999.
14. J. Dunkel and A.S. Schulz. On the complexity of pure-strategy nash equilibria in congestion and local-effect games. Mathematics of Operations Research, 33(4):851-868, 2008.
15. C. Dwork and M. Naor. Pricing via processing, or, combatting junk mail. In Proc. CRYPTO, pages 139-177, 2009.
16. T. Eiter and G. Gottlob Note on the complexity of some eigenvector problems. Technical Report CD-TR 95/89, Christian Doppler Laboratory for Expert Systems, TU Vienna, 1995.
17. D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish unsplittable flows. Theoretical Computer Science, 348(2-3):226-239, 2005.
18. D. Fotakis, S. Kontogiannis, and P. Spirakis. Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. In Proc. WAOA, pages 161-175, 2005.
19. A. Fabrikant, C. Papadimitriou, and K. Talwar. The complexity of pure Nash equilibria. In Proc. 36th STOC, pages 604-612, 2004.
20. M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. Freeman and Co., 1979.
21. T. Harks and M. Klimm. On the existence of pure Nash equilibria in weighted congestion games. Math. Oper. Res., 37(3):419-436, 2012.
22. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. Computer Science Review, 3(2):65-69, 2009.
23. Y. Lustig and M.Y. Vardi. Synthesis from component libraries. STTT, 15(5-6):603-618, 2013.
24. C. Meyers. Network flow problems and congestion games: complexity and approximation results. PhD thesis, MIT, 2006.
25. I. Milchtaich. Congestion games with player-specific payoff functions. Games and Economic Behavior, 13(1):111-124, 1996.
26. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL, pages 179-190, 1989.
27. M.G. Reed, P.F. Syverson, and D.M. Goldschlag. Anonymous connections and onion routing. IEEE J. on Selected Areas in Communication, 1998. Issue on Copyright and Privacy Protection.
28. R.W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
29. T. Roughgarden and E. Tardos. How bad is selfish routing? JACM, 49(2):236-259, 2002.
30. L. Tran-Thanh, M. Polukarov, A. C. Chapman, A. Rogers, and N. R. Jennings. On the existence of pure strategy nash equilibria in integer-splittable weighted congestion games. In SAGT, pages 236-253, 2011.