This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages) The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.Find sources: "Kalai Prize" – news · newspapers · books · scholar · JSTOR (August 2019) (Learn how and when to remove this template message) This article may rely excessively on sources too closely associated with the subject, potentially preventing the article from being verifiable and neutral. Please help improve it by replacing them with more appropriate citations to reliable, independent, third-party sources. (August 2019) (Learn how and when to remove this template message) (Learn how and when to remove this template message)

The Prize in Game Theory and Computer Science in Honour of Ehud Kalai is an award given by the Game Theory Society. The prize is awarded for outstanding articles at the interface of game theory and computer science. Following the eligibility rules of the Gödel Prize, preference is given to authors who are 45 years old or younger at the time of the award. It was established in 2008 by a donation from Yoav Shoham in honor of the Ehud Kalai's contributions in bridging these two fields.[1]

Recipients

Year Recipients Article
2008 Constantinos Daskalakis
Paul W. Goldberg
Christos Papadimitriou 		The Complexity of Computing a Nash Equilibrium[2]
2012 Benjamin Edelman
Michael Ostrovsky
Michael Schwarz
Hal Varian 		Internet Advertising and the Generalized-Second Price Auction: Selling Billions of Dollars worth of Keywords[3] and Position Auctions[4]
2016 Tim Roughgarden Intrinsic Robustness of the Price of Anarchy[5]
2021 Yakov Babichenko

Aviad Rubinstein

Communication Complexity of Approximate Nash Equilibria
2024 Ioannis Caragiannis

David Kurokawa
Hervé Moulin
Ariel D. Procaccia
Nisarg Shah
Junxing Wang

The Unreasonable Fairness of Maximum Nash Welfare[6]

See also

References

  1. ^ "Game Theory Society: Named Lectures and Prizes". www.gametheorysociety.org. Retrieved 2016-12-07.
  2. ^ C. Daskalakis, P.W. Goldberg and C.H. Papadimitriou (2009). "The Complexity of Computing a Nash Equilibrium". SIAM Journal on Computing. 39 (3): 195–259. CiteSeerX 10.1.1.68.6111. doi:10.1137/070699652.
  3. ^ Edelman, Ben; Ostrovsky, Michael; Schwarz, Michael (2007). "Internet Advertising and the Generalized-Second Price Auction: Selling Billions of Dollars worth of Keywords". American Economic Review. 97 (1): 242–259. CiteSeerX 10.1.1.333.8132. doi:10.1257/aer.97.1.242.
  4. ^ Hal R. Varian: "Position Auctions". International Journal of Industrial Organization, 2006, doi:10.1016/j.ijindorg.2006.10.002 .
  5. ^ Roughgarden, Tim (2015). "Intrinsic Robustness of the Price of Anarchy". Journal of the ACM. 62 (5): 1–42. CiteSeerX 10.1.1.703.8557. doi:10.1145/2806883. S2CID 207228912.
  6. ^ Caragiannis, Ioannis; Kurokawa, David; Moulin, Hervé; Procaccia, Ariel D.; Shah, Nisarg; Wang, Junxing. "The Unreasonable Fairness of Maximum Nash Welfare". ACM Transactions on Economics and Computation. 7 (3–12): 1–32.
Categories