KNOWPIA
WELCOME TO KNOWPIA
Kalai Prize 
Summary
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 edit
| 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 |
The Unreasonable Fairness of Maximum Nash Welfare[6] |
See also edit
References edit
- ^ "Game Theory Society: Named Lectures and Prizes". www.gametheorysociety.org. Retrieved 2016-12-07.
- ^ 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.
- ^ 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.
- ^ Hal R. Varian: "Position Auctions". International Journal of Industrial Organization, 2006, doi:10.1016/j.ijindorg.2006.10.002 .
- ^ 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.
- ^ 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.