Congestion game (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Congestion game" in English language version.

refsWebsite

Global rank English rank

44doi.org

2^nd place

31worldcat.org

5^th place

17semanticscholar.org

11^th place

8^th place

12sciencedirect.com

149^th place

178^th place

6springer.com

274^th place

309^th place

3jstor.org

26^th place

20^th place

3ieee.org

652^nd place

515^th place

3handle.net

102^nd place

76^th place

3informs.org

low place

9,066^th place

1ams.org

451^st place

277^th place

1nih.gov

4^th place

1arxiv.org

69^th place

59^th place

1wiley.com

222^nd place

297^th place

ams.org

mathscinet.ams.org

Rosenthal, Robert W. (1973), "A class of games possessing pure-strategy Nash equilibria", International Journal of Game Theory, 2: 65–67, doi:10.1007/BF01737559, MR 0319584, S2CID 121904640.

arxiv.org

Caragiannis, Ioannis; Fanelli, Angelo; Gravin, Nick; Skopalik, Alexander (2011-10-01). "Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games". 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. pp. 532–541. arXiv:1104.2690. doi:10.1109/FOCS.2011.50. ISBN 978-0-7695-4571-4. S2CID 14879292.

doi.org

Rosenthal, Robert W. (1973), "A class of games possessing pure-strategy Nash equilibria", International Journal of Game Theory, 2: 65–67, doi:10.1007/BF01737559, MR 0319584, S2CID 121904640.
Monderer, Dov; Shapley, Lloyd S. (1996-05-01). "Potential Games". Games and Economic Behavior. 14 (1): 124–143. doi:10.1006/game.1996.0044. ISSN 0899-8256.
Milchtaich, Igal (1996). "Congestion Models of Competition". The American Naturalist. 147 (5): 760–783. doi:10.1086/285878. ISSN 0003-0147. JSTOR 2463089. S2CID 55004212.
Friedman, Eric J. (1996-09-01). "Dynamics and Rationality in Ordered Externality Games". Games and Economic Behavior. 16 (1): 65–76. doi:10.1006/game.1996.0074. ISSN 0899-8256.
Blonski, Matthias (1999-08-01). "Anonymous Games with Binary Actions". Games and Economic Behavior. 28 (2): 171–180. doi:10.1006/game.1998.0699. ISSN 0899-8256.
Roughgarden, Tim; Tardos, Éva (2004-05-01). "Bounding the inefficiency of equilibria in nonatomic congestion games". Games and Economic Behavior. 47 (2): 389–403. doi:10.1016/j.geb.2003.06.004. ISSN 0899-8256. S2CID 10778635.
Orda, A.; Rom, R.; Shimkin, N. (1993-10-01). "Competitive routing in multiuser communication networks". IEEE/ACM Transactions on Networking. 1 (5): 510–521. doi:10.1109/90.251910. ISSN 1558-2566. S2CID 1184436.
Roughgarden, Tim; Schoppmann, Florian (2015-03-01). "Local smoothness and the price of anarchy in splittable congestion games". Journal of Economic Theory. Computer Science and Economic Theory. 156: 317–342. doi:10.1016/j.jet.2014.04.005. ISSN 0022-0531.
Milchtaich, Igal (1996-03-01). "Congestion Games with Player-Specific Payoff Functions". Games and Economic Behavior. 13 (1): 111–124. doi:10.1006/game.1996.0027. ISSN 0899-8256.
Milchtaich, Igal (2013-11-01). "Representation of finite games as network congestion games". International Journal of Game Theory. 42 (4): 1085–1096. doi:10.1007/s00182-012-0363-5. ISSN 1432-1270. S2CID 253713700.
Libman, Lavy; Orda, Ariel (2001-08-01). "Atomic Resource Sharing in Noncooperative Networks". Telecommunication Systems. 17 (4): 385–409. doi:10.1023/A:1016770831869. ISSN 1572-9451.
Goemans, M.; Mirrokni, Vahab; Vetta, A. (2005-10-01). "Sink Equilibria and Convergence". 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). pp. 142–151. doi:10.1109/SFCS.2005.68. ISBN 0-7695-2468-0. S2CID 17850062.
Milchtaich, Igal (2006). "The Equilibrium Existence Problem in Finite Network Congestion Games". In Spirakis, Paul; Mavronicolas, Marios; Kontogiannis, Spyros (eds.). Internet and Network Economics. Lecture Notes in Computer Science. Vol. 4286. Berlin, Heidelberg: Springer. pp. 87–98. doi:10.1007/11944874_9. ISBN 978-3-540-68141-0.
Milchtaich, Igal (2015-08-01). "Network topology and equilibrium existence in weighted network congestion games". International Journal of Game Theory. 44 (3): 515–541. doi:10.1007/s00182-014-0443-9. hdl:10419/95995. ISSN 1432-1270. S2CID 253723798.
Milchtaich, Igal (2006-11-01). "Network topology and the efficiency of equilibrium". Games and Economic Behavior. 57 (2): 321–346. doi:10.1016/j.geb.2005.09.005. hdl:10419/259308. ISSN 0899-8256.
Milchtaich, Igal (2005-02-01). "Topological Conditions for Uniqueness of Equilibrium in Networks". Mathematics of Operations Research. 30 (1): 225–244. doi:10.1287/moor.1040.0122. ISSN 0364-765X.
Holzman, Ron; Law-Yone, Nissan (1997-10-01). "Strong Equilibrium in Congestion Games". Games and Economic Behavior. 21 (1): 85–101. doi:10.1006/game.1997.0592. ISSN 0899-8256.
Richman, Oran; Shimkin, Nahum (2007-02-01). "Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users". Mathematics of Operations Research. 32 (1): 215–232. doi:10.1287/moor.1060.0229. ISSN 0364-765X.
Fotakis, Dimitris; Kontogiannis, Spyros; Spirakis, Paul (2005-12-08). "Selfish unsplittable flows". Theoretical Computer Science. Automata, Languages and Programming: Algorithms and Complexity (ICALP-A 2004). 348 (2): 226–239. doi:10.1016/j.tcs.2005.09.024. ISSN 0304-3975.
Panagopoulou, Panagiota N.; Spirakis, Paul G. (2007-02-09). "Algorithms for pure Nash equilibria in weighted congestion games". ACM Journal of Experimental Algorithmics. 11: 2.7–es. doi:10.1145/1187436.1216584. ISSN 1084-6654. S2CID 17903962.
Harks, Tobias; Klimm, Max; Möhring, Rolf H. (2011-07-01). "Characterizing the Existence of Potential Functions in Weighted Congestion Games". Theory of Computing Systems. 49 (1): 46–70. doi:10.1007/s00224-011-9315-x. ISSN 1433-0490. S2CID 912932.
Harks, Tobias; Klimm, Max (2012-08-01). "On the Existence of Pure Nash Equilibria in Weighted Congestion Games". Mathematics of Operations Research. 37 (3): 419–436. doi:10.1287/moor.1120.0543. ISSN 0364-765X.
Kollias, Konstantinos; Roughgarden, Tim (2011). "Restoring Pure Equilibria to Weighted Congestion Games". In Aceto, Luca; Henzinger, Monika; Sgall, Jiří (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 6756. Berlin, Heidelberg: Springer. pp. 539–551. doi:10.1007/978-3-642-22012-8_43. ISBN 978-3-642-22012-8.
Ackermann, Heiner; Röglin, Heiko; Vöcking, Berthold (2009-04-06). "Pure Nash equilibria in player-specific and weighted congestion games". Theoretical Computer Science. Internet and Network Economics. 410 (17): 1552–1563. doi:10.1016/j.tcs.2008.12.035. ISSN 0304-3975.
Panagopoulou, Panagiota N.; Spirakis, Paul G. (2007-02-09). "Algorithms for pure Nash equilibria in weighted congestion games". ACM Journal of Experimental Algorithmics. 11: 2.7–es. doi:10.1145/1187436.1216584. ISSN 1084-6654. S2CID 17903962.
Milchtaich, Igal (1998-12-01). "Crowding games are sequentially solvable". International Journal of Game Theory. 27 (4): 501–509. doi:10.1007/s001820050086. ISSN 1432-1270. S2CID 125221.
Milchtaich, Igal (2000). "Generic Uniqueness of Equilibrium in Large Crowding Games". Mathematics of Operations Research. 25 (3): 349–364. doi:10.1287/moor.25.3.349.12220. ISSN 0364-765X. JSTOR 3690472.
Konishi, Hideo; Le Breton, Michel; Weber, Shlomo (1997-01-01). "Equilibria in a Model with Partial Rivalry". Journal of Economic Theory. 72 (1): 225–237. doi:10.1006/jeth.1996.2203. ISSN 0022-0531.
Konishi, Hideo; Le Breton, Michel; Weber, Shlomo (1997-10-01). "Pure Strategy Nash Equilibrium in a Group Formation Game with Positive Externalities". Games and Economic Behavior. 21 (1): 161–182. doi:10.1006/game.1997.0542. ISSN 0899-8256.
Even-Dar, Eyal; Kesselman, Alex; Mansour, Yishay (2003). "Convergence Time to Nash Equilibria". In Baeten, Jos C. M.; Lenstra, Jan Karel; Parrow, Joachim; Woeginger, Gerhard J. (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 2719. Berlin, Heidelberg: Springer. pp. 502–513. doi:10.1007/3-540-45061-0_41. ISBN 978-3-540-45061-0.
Libman, Lavy; Orda, Ariel (2001-08-01). "Atomic Resource Sharing in Noncooperative Networks". Telecommunication Systems. 17 (4): 385–409. doi:10.1023/A:1016770831869. ISSN 1572-9451.
Brown, Joel S. (1990). "Habitat Selection as an Evolutionary Game". Evolution. 44 (3): 732–746. doi:10.2307/2409448. ISSN 0014-3820. JSTOR 2409448. PMID 28567976.
Milchtaich, Igal (2009-11-01). "Weighted congestion games with separable preferences". Games and Economic Behavior. 67 (2): 750–757. doi:10.1016/j.geb.2009.03.009. hdl:10419/96071. ISSN 0899-8256.
Fabrikant, Alex; Papadimitriou, Christos; Talwar, Kunal (2004-06-13). "The complexity of pure Nash equilibria". Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. STOC '04. New York, NY, USA: Association for Computing Machinery. pp. 604–612. doi:10.1145/1007352.1007445. ISBN 978-1-58113-852-8. S2CID 1037326.
Facchini, Giovanni; van Megen, Freek; Borm, Peter; Tijs, Stef (1997-03-01). "CONGESTION MODELS AND WEIGHTED BAYESIAN POTENTIAL GAMES". Theory and Decision. 42 (2): 193–206. doi:10.1023/A:1004991825894. ISSN 1573-7187. S2CID 123623707.
Mavronicolas, Marios; Milchtaich, Igal; Monien, Burkhard; Tiemann, Karsten (2007). "Congestion Games with Player-Specific Constants". In Kučera, Luděk; Kučera, Antonín (eds.). Mathematical Foundations of Computer Science 2007. Lecture Notes in Computer Science. Vol. 4708. Berlin, Heidelberg: Springer. pp. 633–644. doi:10.1007/978-3-540-74456-6_56. ISBN 978-3-540-74456-6.
Gairing, Martin; Monien, Burkhard; Tiemann, Karsten (2006). "Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions". In Bugliesi, Michele; Preneel, Bart; Sassone, Vladimiro; Wegener, Ingo (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 4051. Berlin, Heidelberg: Springer. pp. 501–512. doi:10.1007/11786986_44. ISBN 978-3-540-35905-0.
Fabrikant, Alex; Papadimitriou, Christos; Talwar, Kunal (2004-06-13). "The complexity of pure Nash equilibria". Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. STOC '04. New York, NY, USA: Association for Computing Machinery. pp. 604–612. doi:10.1145/1007352.1007445. ISBN 978-1-58113-852-8. S2CID 1037326.
Caragiannis, Ioannis; Fanelli, Angelo; Gravin, Nick; Skopalik, Alexander (2011-10-01). "Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games". 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. pp. 532–541. arXiv:1104.2690. doi:10.1109/FOCS.2011.50. ISBN 978-0-7695-4571-4. S2CID 14879292.
Fortune, Steven; Hopcroft, John; Wyllie, James (1980-02-01). "The directed subgraph homeomorphism problem". Theoretical Computer Science. 10 (2): 111–121. doi:10.1016/0304-3975(80)90009-2. ISSN 0304-3975.
Caragiannis, Ioannis; Fanelli, Angelo; Gravin, Nick; Skopalik, Alexander (2015-03-27). "Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure". ACM Transactions on Economics and Computation. 3 (1): 2:1–2:32. doi:10.1145/2614687. ISSN 2167-8375. S2CID 5581666.
Kukushkin, N. S.; Men'Shikov, I. S.; Men'Shikova, O. R.; Morozov, V. V. (1990). "Resource allocation games". Computational Mathematics and Modeling. 1 (4): 433. doi:10.1007/BF01128293. S2CID 120639586.
Fotakis, Dimitris; Kontogiannis, Spyros; Spirakis, Paul (2006). "Atomic Congestion Games Among Coalitions". In Bugliesi, Michele; Preneel, Bart; Sassone, Vladimiro; Wegener, Ingo (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 4051. Berlin, Heidelberg: Springer. pp. 572–583. doi:10.1007/11786986_50. ISBN 978-3-540-35905-0.
Milinski, Manfred (2010-04-26). "An Evolutionarily Stable Feeding Strategy in Sticklebacks". Zeitschrift für Tierpsychologie. 51 (1): 36–40. doi:10.1111/j.1439-0310.1979.tb00669.x.

handle.net

hdl.handle.net

Milchtaich, Igal (2015-08-01). "Network topology and equilibrium existence in weighted network congestion games". International Journal of Game Theory. 44 (3): 515–541. doi:10.1007/s00182-014-0443-9. hdl:10419/95995. ISSN 1432-1270. S2CID 253723798.
Milchtaich, Igal (2006-11-01). "Network topology and the efficiency of equilibrium". Games and Economic Behavior. 57 (2): 321–346. doi:10.1016/j.geb.2005.09.005. hdl:10419/259308. ISSN 0899-8256.
Milchtaich, Igal (2009-11-01). "Weighted congestion games with separable preferences". Games and Economic Behavior. 67 (2): 750–757. doi:10.1016/j.geb.2009.03.009. hdl:10419/96071. ISSN 0899-8256.

ieee.org

ieeexplore.ieee.org

Orda, A.; Rom, R.; Shimkin, N. (1993-10-01). "Competitive routing in multiuser communication networks". IEEE/ACM Transactions on Networking. 1 (5): 510–521. doi:10.1109/90.251910. ISSN 1558-2566. S2CID 1184436.
Goemans, M.; Mirrokni, Vahab; Vetta, A. (2005-10-01). "Sink Equilibria and Convergence". 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). pp. 142–151. doi:10.1109/SFCS.2005.68. ISBN 0-7695-2468-0. S2CID 17850062.
Caragiannis, Ioannis; Fanelli, Angelo; Gravin, Nick; Skopalik, Alexander (2011-10-01). "Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games". 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. pp. 532–541. arXiv:1104.2690. doi:10.1109/FOCS.2011.50. ISBN 978-0-7695-4571-4. S2CID 14879292.

informs.org

pubsonline.informs.org

Milchtaich, Igal (2005-02-01). "Topological Conditions for Uniqueness of Equilibrium in Networks". Mathematics of Operations Research. 30 (1): 225–244. doi:10.1287/moor.1040.0122. ISSN 0364-765X.
Richman, Oran; Shimkin, Nahum (2007-02-01). "Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users". Mathematics of Operations Research. 32 (1): 215–232. doi:10.1287/moor.1060.0229. ISSN 0364-765X.
Harks, Tobias; Klimm, Max (2012-08-01). "On the Existence of Pure Nash Equilibria in Weighted Congestion Games". Mathematics of Operations Research. 37 (3): 419–436. doi:10.1287/moor.1120.0543. ISSN 0364-765X.

jstor.org

Milchtaich, Igal (1996). "Congestion Models of Competition". The American Naturalist. 147 (5): 760–783. doi:10.1086/285878. ISSN 0003-0147. JSTOR 2463089. S2CID 55004212.
Milchtaich, Igal (2000). "Generic Uniqueness of Equilibrium in Large Crowding Games". Mathematics of Operations Research. 25 (3): 349–364. doi:10.1287/moor.25.3.349.12220. ISSN 0364-765X. JSTOR 3690472.
Brown, Joel S. (1990). "Habitat Selection as an Evolutionary Game". Evolution. 44 (3): 732–746. doi:10.2307/2409448. ISSN 0014-3820. JSTOR 2409448. PMID 28567976.

nih.gov

pubmed.ncbi.nlm.nih.gov

Brown, Joel S. (1990). "Habitat Selection as an Evolutionary Game". Evolution. 44 (3): 732–746. doi:10.2307/2409448. ISSN 0014-3820. JSTOR 2409448. PMID 28567976.

sciencedirect.com

Monderer, Dov; Shapley, Lloyd S. (1996-05-01). "Potential Games". Games and Economic Behavior. 14 (1): 124–143. doi:10.1006/game.1996.0044. ISSN 0899-8256.
Friedman, Eric J. (1996-09-01). "Dynamics and Rationality in Ordered Externality Games". Games and Economic Behavior. 16 (1): 65–76. doi:10.1006/game.1996.0074. ISSN 0899-8256.
Blonski, Matthias (1999-08-01). "Anonymous Games with Binary Actions". Games and Economic Behavior. 28 (2): 171–180. doi:10.1006/game.1998.0699. ISSN 0899-8256.
Roughgarden, Tim; Tardos, Éva (2004-05-01). "Bounding the inefficiency of equilibria in nonatomic congestion games". Games and Economic Behavior. 47 (2): 389–403. doi:10.1016/j.geb.2003.06.004. ISSN 0899-8256. S2CID 10778635.
Roughgarden, Tim; Schoppmann, Florian (2015-03-01). "Local smoothness and the price of anarchy in splittable congestion games". Journal of Economic Theory. Computer Science and Economic Theory. 156: 317–342. doi:10.1016/j.jet.2014.04.005. ISSN 0022-0531.
Milchtaich, Igal (1996-03-01). "Congestion Games with Player-Specific Payoff Functions". Games and Economic Behavior. 13 (1): 111–124. doi:10.1006/game.1996.0027. ISSN 0899-8256.
Milchtaich, Igal (2006-11-01). "Network topology and the efficiency of equilibrium". Games and Economic Behavior. 57 (2): 321–346. doi:10.1016/j.geb.2005.09.005. hdl:10419/259308. ISSN 0899-8256.
Holzman, Ron; Law-Yone, Nissan (1997-10-01). "Strong Equilibrium in Congestion Games". Games and Economic Behavior. 21 (1): 85–101. doi:10.1006/game.1997.0592. ISSN 0899-8256.
Fotakis, Dimitris; Kontogiannis, Spyros; Spirakis, Paul (2005-12-08). "Selfish unsplittable flows". Theoretical Computer Science. Automata, Languages and Programming: Algorithms and Complexity (ICALP-A 2004). 348 (2): 226–239. doi:10.1016/j.tcs.2005.09.024. ISSN 0304-3975.
Konishi, Hideo; Le Breton, Michel; Weber, Shlomo (1997-01-01). "Equilibria in a Model with Partial Rivalry". Journal of Economic Theory. 72 (1): 225–237. doi:10.1006/jeth.1996.2203. ISSN 0022-0531.
Konishi, Hideo; Le Breton, Michel; Weber, Shlomo (1997-10-01). "Pure Strategy Nash Equilibrium in a Group Formation Game with Positive Externalities". Games and Economic Behavior. 21 (1): 161–182. doi:10.1006/game.1997.0542. ISSN 0899-8256.
Milchtaich, Igal (2009-11-01). "Weighted congestion games with separable preferences". Games and Economic Behavior. 67 (2): 750–757. doi:10.1016/j.geb.2009.03.009. hdl:10419/96071. ISSN 0899-8256.

semanticscholar.org

api.semanticscholar.org

Rosenthal, Robert W. (1973), "A class of games possessing pure-strategy Nash equilibria", International Journal of Game Theory, 2: 65–67, doi:10.1007/BF01737559, MR 0319584, S2CID 121904640.
Milchtaich, Igal (1996). "Congestion Models of Competition". The American Naturalist. 147 (5): 760–783. doi:10.1086/285878. ISSN 0003-0147. JSTOR 2463089. S2CID 55004212.
Roughgarden, Tim; Tardos, Éva (2004-05-01). "Bounding the inefficiency of equilibria in nonatomic congestion games". Games and Economic Behavior. 47 (2): 389–403. doi:10.1016/j.geb.2003.06.004. ISSN 0899-8256. S2CID 10778635.
Orda, A.; Rom, R.; Shimkin, N. (1993-10-01). "Competitive routing in multiuser communication networks". IEEE/ACM Transactions on Networking. 1 (5): 510–521. doi:10.1109/90.251910. ISSN 1558-2566. S2CID 1184436.
Milchtaich, Igal (2013-11-01). "Representation of finite games as network congestion games". International Journal of Game Theory. 42 (4): 1085–1096. doi:10.1007/s00182-012-0363-5. ISSN 1432-1270. S2CID 253713700.
Goemans, M.; Mirrokni, Vahab; Vetta, A. (2005-10-01). "Sink Equilibria and Convergence". 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). pp. 142–151. doi:10.1109/SFCS.2005.68. ISBN 0-7695-2468-0. S2CID 17850062.
Milchtaich, Igal (2015-08-01). "Network topology and equilibrium existence in weighted network congestion games". International Journal of Game Theory. 44 (3): 515–541. doi:10.1007/s00182-014-0443-9. hdl:10419/95995. ISSN 1432-1270. S2CID 253723798.
Panagopoulou, Panagiota N.; Spirakis, Paul G. (2007-02-09). "Algorithms for pure Nash equilibria in weighted congestion games". ACM Journal of Experimental Algorithmics. 11: 2.7–es. doi:10.1145/1187436.1216584. ISSN 1084-6654. S2CID 17903962.
Harks, Tobias; Klimm, Max; Möhring, Rolf H. (2011-07-01). "Characterizing the Existence of Potential Functions in Weighted Congestion Games". Theory of Computing Systems. 49 (1): 46–70. doi:10.1007/s00224-011-9315-x. ISSN 1433-0490. S2CID 912932.
Panagopoulou, Panagiota N.; Spirakis, Paul G. (2007-02-09). "Algorithms for pure Nash equilibria in weighted congestion games". ACM Journal of Experimental Algorithmics. 11: 2.7–es. doi:10.1145/1187436.1216584. ISSN 1084-6654. S2CID 17903962.
Milchtaich, Igal (1998-12-01). "Crowding games are sequentially solvable". International Journal of Game Theory. 27 (4): 501–509. doi:10.1007/s001820050086. ISSN 1432-1270. S2CID 125221.
Fabrikant, Alex; Papadimitriou, Christos; Talwar, Kunal (2004-06-13). "The complexity of pure Nash equilibria". Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. STOC '04. New York, NY, USA: Association for Computing Machinery. pp. 604–612. doi:10.1145/1007352.1007445. ISBN 978-1-58113-852-8. S2CID 1037326.
Facchini, Giovanni; van Megen, Freek; Borm, Peter; Tijs, Stef (1997-03-01). "CONGESTION MODELS AND WEIGHTED BAYESIAN POTENTIAL GAMES". Theory and Decision. 42 (2): 193–206. doi:10.1023/A:1004991825894. ISSN 1573-7187. S2CID 123623707.
Fabrikant, Alex; Papadimitriou, Christos; Talwar, Kunal (2004-06-13). "The complexity of pure Nash equilibria". Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. STOC '04. New York, NY, USA: Association for Computing Machinery. pp. 604–612. doi:10.1145/1007352.1007445. ISBN 978-1-58113-852-8. S2CID 1037326.
Caragiannis, Ioannis; Fanelli, Angelo; Gravin, Nick; Skopalik, Alexander (2011-10-01). "Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games". 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. pp. 532–541. arXiv:1104.2690. doi:10.1109/FOCS.2011.50. ISBN 978-0-7695-4571-4. S2CID 14879292.
Caragiannis, Ioannis; Fanelli, Angelo; Gravin, Nick; Skopalik, Alexander (2015-03-27). "Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure". ACM Transactions on Economics and Computation. 3 (1): 2:1–2:32. doi:10.1145/2614687. ISSN 2167-8375. S2CID 5581666.
Kukushkin, N. S.; Men'Shikov, I. S.; Men'Shikova, O. R.; Morozov, V. V. (1990). "Resource allocation games". Computational Mathematics and Modeling. 1 (4): 433. doi:10.1007/BF01128293. S2CID 120639586.

springer.com

link.springer.com

Milchtaich, Igal (2006). "The Equilibrium Existence Problem in Finite Network Congestion Games". In Spirakis, Paul; Mavronicolas, Marios; Kontogiannis, Spyros (eds.). Internet and Network Economics. Lecture Notes in Computer Science. Vol. 4286. Berlin, Heidelberg: Springer. pp. 87–98. doi:10.1007/11944874_9. ISBN 978-3-540-68141-0.
Kollias, Konstantinos; Roughgarden, Tim (2011). "Restoring Pure Equilibria to Weighted Congestion Games". In Aceto, Luca; Henzinger, Monika; Sgall, Jiří (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 6756. Berlin, Heidelberg: Springer. pp. 539–551. doi:10.1007/978-3-642-22012-8_43. ISBN 978-3-642-22012-8.
Even-Dar, Eyal; Kesselman, Alex; Mansour, Yishay (2003). "Convergence Time to Nash Equilibria". In Baeten, Jos C. M.; Lenstra, Jan Karel; Parrow, Joachim; Woeginger, Gerhard J. (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 2719. Berlin, Heidelberg: Springer. pp. 502–513. doi:10.1007/3-540-45061-0_41. ISBN 978-3-540-45061-0.
Mavronicolas, Marios; Milchtaich, Igal; Monien, Burkhard; Tiemann, Karsten (2007). "Congestion Games with Player-Specific Constants". In Kučera, Luděk; Kučera, Antonín (eds.). Mathematical Foundations of Computer Science 2007. Lecture Notes in Computer Science. Vol. 4708. Berlin, Heidelberg: Springer. pp. 633–644. doi:10.1007/978-3-540-74456-6_56. ISBN 978-3-540-74456-6.
Gairing, Martin; Monien, Burkhard; Tiemann, Karsten (2006). "Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions". In Bugliesi, Michele; Preneel, Bart; Sassone, Vladimiro; Wegener, Ingo (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 4051. Berlin, Heidelberg: Springer. pp. 501–512. doi:10.1007/11786986_44. ISBN 978-3-540-35905-0.
Fotakis, Dimitris; Kontogiannis, Spyros; Spirakis, Paul (2006). "Atomic Congestion Games Among Coalitions". In Bugliesi, Michele; Preneel, Bart; Sassone, Vladimiro; Wegener, Ingo (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 4051. Berlin, Heidelberg: Springer. pp. 572–583. doi:10.1007/11786986_50. ISBN 978-3-540-35905-0.

wiley.com

onlinelibrary.wiley.com

Milinski, Manfred (2010-04-26). "An Evolutionarily Stable Feeding Strategy in Sticklebacks". Zeitschrift für Tierpsychologie. 51 (1): 36–40. doi:10.1111/j.1439-0310.1979.tb00669.x.

worldcat.org

search.worldcat.org

Monderer, Dov; Shapley, Lloyd S. (1996-05-01). "Potential Games". Games and Economic Behavior. 14 (1): 124–143. doi:10.1006/game.1996.0044. ISSN 0899-8256.
Milchtaich, Igal (1996). "Congestion Models of Competition". The American Naturalist. 147 (5): 760–783. doi:10.1086/285878. ISSN 0003-0147. JSTOR 2463089. S2CID 55004212.
Friedman, Eric J. (1996-09-01). "Dynamics and Rationality in Ordered Externality Games". Games and Economic Behavior. 16 (1): 65–76. doi:10.1006/game.1996.0074. ISSN 0899-8256.
Blonski, Matthias (1999-08-01). "Anonymous Games with Binary Actions". Games and Economic Behavior. 28 (2): 171–180. doi:10.1006/game.1998.0699. ISSN 0899-8256.
Roughgarden, Tim; Tardos, Éva (2004-05-01). "Bounding the inefficiency of equilibria in nonatomic congestion games". Games and Economic Behavior. 47 (2): 389–403. doi:10.1016/j.geb.2003.06.004. ISSN 0899-8256. S2CID 10778635.
Orda, A.; Rom, R.; Shimkin, N. (1993-10-01). "Competitive routing in multiuser communication networks". IEEE/ACM Transactions on Networking. 1 (5): 510–521. doi:10.1109/90.251910. ISSN 1558-2566. S2CID 1184436.
Roughgarden, Tim; Schoppmann, Florian (2015-03-01). "Local smoothness and the price of anarchy in splittable congestion games". Journal of Economic Theory. Computer Science and Economic Theory. 156: 317–342. doi:10.1016/j.jet.2014.04.005. ISSN 0022-0531.
Milchtaich, Igal (1996-03-01). "Congestion Games with Player-Specific Payoff Functions". Games and Economic Behavior. 13 (1): 111–124. doi:10.1006/game.1996.0027. ISSN 0899-8256.
Milchtaich, Igal (2013-11-01). "Representation of finite games as network congestion games". International Journal of Game Theory. 42 (4): 1085–1096. doi:10.1007/s00182-012-0363-5. ISSN 1432-1270. S2CID 253713700.
Libman, Lavy; Orda, Ariel (2001-08-01). "Atomic Resource Sharing in Noncooperative Networks". Telecommunication Systems. 17 (4): 385–409. doi:10.1023/A:1016770831869. ISSN 1572-9451.
Milchtaich, Igal (2015-08-01). "Network topology and equilibrium existence in weighted network congestion games". International Journal of Game Theory. 44 (3): 515–541. doi:10.1007/s00182-014-0443-9. hdl:10419/95995. ISSN 1432-1270. S2CID 253723798.
Milchtaich, Igal (2006-11-01). "Network topology and the efficiency of equilibrium". Games and Economic Behavior. 57 (2): 321–346. doi:10.1016/j.geb.2005.09.005. hdl:10419/259308. ISSN 0899-8256.
Milchtaich, Igal (2005-02-01). "Topological Conditions for Uniqueness of Equilibrium in Networks". Mathematics of Operations Research. 30 (1): 225–244. doi:10.1287/moor.1040.0122. ISSN 0364-765X.
Holzman, Ron; Law-Yone, Nissan (1997-10-01). "Strong Equilibrium in Congestion Games". Games and Economic Behavior. 21 (1): 85–101. doi:10.1006/game.1997.0592. ISSN 0899-8256.
Richman, Oran; Shimkin, Nahum (2007-02-01). "Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users". Mathematics of Operations Research. 32 (1): 215–232. doi:10.1287/moor.1060.0229. ISSN 0364-765X.
Fotakis, Dimitris; Kontogiannis, Spyros; Spirakis, Paul (2005-12-08). "Selfish unsplittable flows". Theoretical Computer Science. Automata, Languages and Programming: Algorithms and Complexity (ICALP-A 2004). 348 (2): 226–239. doi:10.1016/j.tcs.2005.09.024. ISSN 0304-3975.
Panagopoulou, Panagiota N.; Spirakis, Paul G. (2007-02-09). "Algorithms for pure Nash equilibria in weighted congestion games". ACM Journal of Experimental Algorithmics. 11: 2.7–es. doi:10.1145/1187436.1216584. ISSN 1084-6654. S2CID 17903962.
Harks, Tobias; Klimm, Max; Möhring, Rolf H. (2011-07-01). "Characterizing the Existence of Potential Functions in Weighted Congestion Games". Theory of Computing Systems. 49 (1): 46–70. doi:10.1007/s00224-011-9315-x. ISSN 1433-0490. S2CID 912932.
Harks, Tobias; Klimm, Max (2012-08-01). "On the Existence of Pure Nash Equilibria in Weighted Congestion Games". Mathematics of Operations Research. 37 (3): 419–436. doi:10.1287/moor.1120.0543. ISSN 0364-765X.
Ackermann, Heiner; Röglin, Heiko; Vöcking, Berthold (2009-04-06). "Pure Nash equilibria in player-specific and weighted congestion games". Theoretical Computer Science. Internet and Network Economics. 410 (17): 1552–1563. doi:10.1016/j.tcs.2008.12.035. ISSN 0304-3975.
Panagopoulou, Panagiota N.; Spirakis, Paul G. (2007-02-09). "Algorithms for pure Nash equilibria in weighted congestion games". ACM Journal of Experimental Algorithmics. 11: 2.7–es. doi:10.1145/1187436.1216584. ISSN 1084-6654. S2CID 17903962.
Milchtaich, Igal (1998-12-01). "Crowding games are sequentially solvable". International Journal of Game Theory. 27 (4): 501–509. doi:10.1007/s001820050086. ISSN 1432-1270. S2CID 125221.
Milchtaich, Igal (2000). "Generic Uniqueness of Equilibrium in Large Crowding Games". Mathematics of Operations Research. 25 (3): 349–364. doi:10.1287/moor.25.3.349.12220. ISSN 0364-765X. JSTOR 3690472.
Konishi, Hideo; Le Breton, Michel; Weber, Shlomo (1997-01-01). "Equilibria in a Model with Partial Rivalry". Journal of Economic Theory. 72 (1): 225–237. doi:10.1006/jeth.1996.2203. ISSN 0022-0531.
Konishi, Hideo; Le Breton, Michel; Weber, Shlomo (1997-10-01). "Pure Strategy Nash Equilibrium in a Group Formation Game with Positive Externalities". Games and Economic Behavior. 21 (1): 161–182. doi:10.1006/game.1997.0542. ISSN 0899-8256.
Libman, Lavy; Orda, Ariel (2001-08-01). "Atomic Resource Sharing in Noncooperative Networks". Telecommunication Systems. 17 (4): 385–409. doi:10.1023/A:1016770831869. ISSN 1572-9451.
Brown, Joel S. (1990). "Habitat Selection as an Evolutionary Game". Evolution. 44 (3): 732–746. doi:10.2307/2409448. ISSN 0014-3820. JSTOR 2409448. PMID 28567976.
Milchtaich, Igal (2009-11-01). "Weighted congestion games with separable preferences". Games and Economic Behavior. 67 (2): 750–757. doi:10.1016/j.geb.2009.03.009. hdl:10419/96071. ISSN 0899-8256.
Facchini, Giovanni; van Megen, Freek; Borm, Peter; Tijs, Stef (1997-03-01). "CONGESTION MODELS AND WEIGHTED BAYESIAN POTENTIAL GAMES". Theory and Decision. 42 (2): 193–206. doi:10.1023/A:1004991825894. ISSN 1573-7187. S2CID 123623707.
Fortune, Steven; Hopcroft, John; Wyllie, James (1980-02-01). "The directed subgraph homeomorphism problem". Theoretical Computer Science. 10 (2): 111–121. doi:10.1016/0304-3975(80)90009-2. ISSN 0304-3975.
Caragiannis, Ioannis; Fanelli, Angelo; Gravin, Nick; Skopalik, Alexander (2015-03-27). "Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure". ACM Transactions on Economics and Computation. 3 (1): 2:1–2:32. doi:10.1145/2614687. ISSN 2167-8375. S2CID 5581666.