PPT-1 Approximation in Algorithmic Game Theory

Robust Approximation Bounds for Equilibria and Auctions Tim Roughgarden Stanford University 2 Motivation Clearly many modern applications in CS involve autonomous selfinterested agents. Vazirani editors March 18 2009 Errata in 2nd Printing 2008 Chapter 14 Page 377 in the paragraph labeled Provide transit services only to customers change the sentence Therefore ASes should announce only customer routes to their providers and peers Lecture . 2. : . Myerson’s Lemma. Yang. . Cai. Sep 8,. . 2014. An overview of the class. Broad View: Mechanism. . Design. . and. . Auctions. First. . Price. . Auction. Second Price. /. Vickrey. Fall 2011. Constantinos Daskalakis. Lecture 11. Last. . Lecture. .... 0. n. Generic PPAD. Embed PPAD graph in [0,1]. 3. 3D-SPERNER. canonical . p. .w. . linear . BROUWER. multi-player. NASH. 4-player. Lecture 10. Constantinos Daskalakis. Last . Lecture. .... 0. n. Generic PPAD. Embed PPAD graph in [0,1]. 3. 3D-SPERNER. canonical . p. .w. . linear . BROUWER. multi-player. NASH. 4-player. NASH. 3-player. Lecture 11. Constantinos Daskalakis. Algorithms for Nash . Equilibria. Simplicial. Approximation Algorithms. Support Enumeration Algorithms. Lipton-. Markakis. -Mehta. Algorithms for Symmetric Games. Princeton University. Game Theory Meets. Compressed Sensing. Based on joint work with:. Volkan. Cevher. Robert. Calderbank. Rob. Schapire. Compressed Sensing. Main tasks:. Design a . sensing . matrix. Lecture 5: Myerson’s Optimal Auction. Yang. . Cai. Sep 17,. . 2014. An overview of . today’s class. Expected Revenue = Expected Virtual Welfare. 2 Uniform [0,1] Bidders Example. Optimal Auction. Lecture 12. Constantinos Daskalakis. The Lemke-. Howson. Algorithm. The Lemke-. Howson. Algorithm (1964). Problem:. Find an exact equilibrium of a 2-player game.. Since there exists a rational equilibrium this task is feasible.. According to the folks at Wikipedia, a game may be considered as an applied game or serious game if it has for its purpose objectives that are distinguished from those purely of entertainment. The adjective “serious” is used to refer to industries related to education, defense, health care, science, planning of cities, emergency management, politics or even engineering.. Lecture 13. Constantinos Daskalakis. multiplayer zero-sum games. Multiplayer Zero-Sum, . wha. ?. Take an arbitrary two-player game, between Alice and Bob.. Add a third player, Eve, who does not affect Alice or Bob’s payoffs, but receives payoff. Fall 2016. Yang Cai. Lecture . 05. Overview so far. Recap:. Games, . rationality, . solution concepts. Existence Theorems for Nash equilibrium: . Nash’s theorem for general games (via . Brouwer. What is Game Theory?. It is . a tool used to analyze strategic behavior . and trying . to maximize . his/her payoff . of the game by anticipating the actions of the other players and responding to them . Nima. . Namvar. PhD Student. Outline. Introduction. Matching . Games. Stackelberg. Games. Coalition Games. Future works. . Part1: . Introduction. Multi-agent Systems. Agent . capabilities:. Sensing the environment. Author: . Neil . Bendle. Marketing Metrics Reference: Chapter 7. © 2014 Neil . Bendle. and Management by the Numbers, Inc.. Game Theory studies competitive and cooperative interactions.. Despite often using terms such as “players” and “games”, the ideas apply to markets and managers..