Algorithmic game theory (English Wikipedia)

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

refsWebsite

Global rank English rank

7doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

2web.archive.org

1^st place

2psu.edu

207^th place

136^th place

2sigecom.org

low place

2acm.org

1,185^th place

840^th place

1berkeley.edu

580^th place

462^nd place

1weizmann.ac.il

4,983^rd place

8,002^nd place

1upenn.edu

702^nd place

520^th place

1procaccia.info

low place

1oclc.org

1,391^st place

1,017^th place

acm.org

"ACM SIGACT Presents Gödel Prize for Research that Illuminated Effects of Selfish Internet Use" (Press release). New York. Association for Computing Machinery. 2012-05-16. Archived from the original on 2013-07-18. Retrieved 2018-01-08.

teac.acm.org

TEAC

berkeley.edu

cs.berkeley.edu

Koutsoupias, Elias; Papadimitriou, Christos (May 2009). "Worst-case Equilibria". Computer Science Review. 3 (2): 65–69. doi:10.1016/j.cosrev.2009.04.003. Archived from the original on 2016-03-13. Retrieved 2018-01-08.

doi.org

Nisan, Noam; Ronen, Amir (1999), "Algorithmic mechanism design", Proceedings of the 31st ACM Symposium on Theory of Computing (STOC '99), pp. 129–140, doi:10.1145/301250.301287, ISBN 978-1581130676, S2CID 8316937
Koutsoupias, Elias; Papadimitriou, Christos (May 2009). "Worst-case Equilibria". Computer Science Review. 3 (2): 65–69. doi:10.1016/j.cosrev.2009.04.003. Archived from the original on 2016-03-13. Retrieved 2018-01-08.
Papadimitriou, Christos (2001), "Algorithms, games, and the Internet", Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC '01), pp. 749–753, CiteSeerX 10.1.1.70.8836, doi:10.1145/380752.380883, ISBN 978-1581133493, S2CID 207594967
*Anshelevich, Elliot; Dasgupta, Anirban; Kleinberg, Jon; Tardos, Éva; Wexler, Tom; Roughgarden, Tim (2008). "The Price of Stability for Network Design with Fair Cost Allocation". SIAM J. Comput. 38 (4): 1602–1623. doi:10.1137/070680096. S2CID 2839399.
*Chen, Xi; Deng, Xiaotie (2006). Settling the complexity of two-player Nash equilibrium. Proc. 47th Symp. Foundations of Computer Science. pp. 261–271. doi:10.1109/FOCS.2006.69. ECCC TR05-140..
Papadimitriou, Christos H.; Roughgarden, Tim (2008). "Computing correlated equilibria in multi-player games". J. ACM. 55 (3): 14:1–14:29. CiteSeerX 10.1.1.335.2634. doi:10.1145/1379759.1379762. S2CID 53224027.
Chawla, Shuchi; Fleischer, Lisa; Hartline, Jason; Tim Roughgarden (2015), "Introduction to the Special Issue – Algorithmic Game Theory – STOC/FOCS/SODA 2011", Games and Economic Behavior, 92: 228–231, doi:10.1016/j.geb.2015.02.011

oclc.org

www-siam-org.stanford.idm.oclc.org

SICOMP

procaccia.info

Felix Brandt; Vincent Conitzer; Ulle Endriss; Jérôme Lang; Ariel D. Procaccia, eds. (2016), Handbook of Computational Social Choice (PDF)

psu.edu

citeseerx.ist.psu.edu

Papadimitriou, Christos (2001), "Algorithms, games, and the Internet", Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC '01), pp. 749–753, CiteSeerX 10.1.1.70.8836, doi:10.1145/380752.380883, ISBN 978-1581133493, S2CID 207594967
Papadimitriou, Christos H.; Roughgarden, Tim (2008). "Computing correlated equilibria in multi-player games". J. ACM. 55 (3): 14:1–14:29. CiteSeerX 10.1.1.335.2634. doi:10.1145/1379759.1379762. S2CID 53224027.

semanticscholar.org

api.semanticscholar.org

Nisan, Noam; Ronen, Amir (1999), "Algorithmic mechanism design", Proceedings of the 31st ACM Symposium on Theory of Computing (STOC '99), pp. 129–140, doi:10.1145/301250.301287, ISBN 978-1581130676, S2CID 8316937
Papadimitriou, Christos (2001), "Algorithms, games, and the Internet", Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC '01), pp. 749–753, CiteSeerX 10.1.1.70.8836, doi:10.1145/380752.380883, ISBN 978-1581133493, S2CID 207594967
*Anshelevich, Elliot; Dasgupta, Anirban; Kleinberg, Jon; Tardos, Éva; Wexler, Tom; Roughgarden, Tim (2008). "The Price of Stability for Network Design with Fair Cost Allocation". SIAM J. Comput. 38 (4): 1602–1623. doi:10.1137/070680096. S2CID 2839399.
Papadimitriou, Christos H.; Roughgarden, Tim (2008). "Computing correlated equilibria in multi-player games". J. ACM. 55 (3): 14:1–14:29. CiteSeerX 10.1.1.335.2634. doi:10.1145/1379759.1379762. S2CID 53224027.

sigecom.org

upenn.edu

repository.upenn.edu

Foster, Dean P.; Vohra, Rakesh V. (1996). "Calibrated Learning and Correlated Equilibrium". Games and Economic Behavior.

web.archive.org

"ACM SIGACT Presents Gödel Prize for Research that Illuminated Effects of Selfish Internet Use" (Press release). New York. Association for Computing Machinery. 2012-05-16. Archived from the original on 2013-07-18. Retrieved 2018-01-08.
Koutsoupias, Elias; Papadimitriou, Christos (May 2009). "Worst-case Equilibria". Computer Science Review. 3 (2): 65–69. doi:10.1016/j.cosrev.2009.04.003. Archived from the original on 2016-03-13. Retrieved 2018-01-08.

weizmann.ac.il

eccc.weizmann.ac.il

*Chen, Xi; Deng, Xiaotie (2006). Settling the complexity of two-player Nash equilibrium. Proc. 47th Symp. Foundations of Computer Science. pp. 261–271. doi:10.1109/FOCS.2006.69. ECCC TR05-140..