Game Theory, Internet and the Web A new Science? Paul G. Spirakis (google: Paul Spirakis) University of Liverpool (with help from C. H. Papadimitriou,

Slides:



Advertisements
Similar presentations
Inefficiency of equilibria, and potential games Computational game theory Spring 2008 Michal Feldman TexPoint fonts used in EMF. Read the TexPoint manual.
Advertisements

Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses Ruta Mehta Indian Institute of Technology, Bombay Joint work with Jugal Garg and Albert.
Mixed Strategies CMPT 882 Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte.
3. Basic Topics in Game Theory. Strategic Behavior in Business and Econ Outline 3.1 What is a Game ? The elements of a Game The Rules of the.
COMP 553: Algorithmic Game Theory Fall 2014 Yang Cai Lecture 21.
An Introduction to... Evolutionary Game Theory
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Introduction to Network Mathematics (3) - Simple Games and applications Yuedong Xu 16/05/2012.
Algorithms and Economics of Networks Abraham Flaxman and Vahab Mirrokni, Microsoft Research.
Xujin Chen, Xiaodong Hu Institute of Applied Mathematics Chinese Academy of Sciences Network Routing Games on Ring Infrastructure G CN-GER Conf on Math.
1 Algorithmic Game Theoretic Perspectives in Networking Dr. Liane Lewin-Eytan.
GAME THEORY By Ben Cutting & Rohit Venkat. Game Theory: General Definition  Mathematical decision making tool  Used to analyze a competitive situation.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
G A M E T H E O R Y A N D I N C E N T I V E S S ystems Analysis Laboratory Osborne’s quota rule makes the joint optimum an equilibrium OPEC oil cartel.
Algoritmi per Sistemi Distribuiti Strategici
Game-Theoretic Approaches to Multi-Agent Systems Bernhard Nebel.
CRESCCO Project IST Work Package 2 Algorithms for Selfish Agents V. Auletta, P. Penna and G. Persiano Università di Salerno
Beyond selfish routing: Network Formation Games. Network Formation Games NFGs model the various ways in which selfish agents might create/use networks.
1 On the price of anarchy and stability of correlated equilibria of linear congestion games By George Christodoulou Elias Koutsoupias Presented by Efrat.
The Price Of Stability for Network Design with Fair Cost Allocation Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Eva Tardos, Tom Wexler, Tim Roughgarden.
Selfish Caching in Distributed Systems: A Game-Theoretic Analysis By Byung-Gon Chun et al. UC Berkeley PODC’04.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Algorithmic Issues in Non- cooperative (i.e., strategic) Distributed Systems.
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Algorithmic Issues in Non- cooperative (i.e., strategic) Distributed Systems.
Algorithms, Games and the Internet Christos H. Papadimitriou UC Berkeley
Networks and Games Christos H. Papadimitriou UC Berkeley christos.
Algorithms and Economics of Networks Abraham Flaxman and Vahab Mirrokni, Microsoft Research.
1 Algorithms for Computing Approximate Nash Equilibria Vangelis Markakis Athens University of Economics and Business.
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
How Bad is Selfish Routing A survey on existing models for selfish routing Professor John Lui, David Yau and Dah-Ming Qiu presented by Joe W.J. Jiang
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
Inefficiency of equilibria, and potential games Computational game theory Spring 2008 Michal Feldman.
Algorithmic Problems in the Internet Christos H. Papadimitriou
1 Issues on the border of economics and computation נושאים בגבול כלכלה וחישוב Congestion Games, Potential Games and Price of Anarchy Liad Blumrosen ©
6.896: Topics in Algorithmic Game Theory Spring 2010 Constantinos Daskalakis vol. 1:
Game Theory, Internet and the Web A new Science? Paul G. Spirakis (google: Paul Spirakis) Research Academic Computer Technology Institute & University.
Foundations of Economics and Web Science Paul G. Spirakis CTI Patras Joint work with Spyros Kontogiannis (Univ. Ioannina) inspired also by a talk of Christos.
Algoritmi Distribuiti e Reti Complesse (modulo II) Luciano Gualà
1 COMMUNICATION NETWORKS AND COMPLEXITY COOPERATION AND ANTAGONISM IN SELFISH NETWORKS (ALGORITHMIC ISSUES) Paul G. Spirakis RACTI (Greece) August 2006.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Game theory & Linear Programming Steve Gu Mar 28, 2008.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Introduction Giovanni Neglia.
Connections between Learning Theory, Game Theory, and Optimization Maria Florina (Nina) Balcan Lecture 14, October 7 th 2010.
Networks and Games Christos H. Papadimitriou UC Berkeley christos.
Ásbjörn H Kristbjörnsson1 The complexity of Finding Nash Equilibria Ásbjörn H Kristbjörnsson Algorithms, Logic and Complexity.
Price of Anarchy Georgios Piliouras. Games (i.e. Multi-Body Interactions) Interacting entities Pursuing their own goals Lack of centralized control Prediction?
2008/01/30Lecture 11 Game Theory. 2008/01/30Lecture 12 What is Game Theory? Game theory is a field of Mathematics, analyzing strategically inter-dependent.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish agents strategically interact in using a network They.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish users (i.e., players) strategically interact in using.
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
1 Algorithms for Computing Approximate Nash Equilibria Vangelis Markakis Athens University of Economics and Business.
Lec 23 Chapter 28 Game Theory.
The Price of Routing Unsplittable Flow Yossi Azar Joint work with B. Awerbuch and A. Epstein.
Network Formation Games. NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models: Global Connection Game.
Network Formation Games. NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models: Global Connection Game.
Game Theory By Ben Cutting & Rohit Venkat.
Game Theory M.Pajhouh Niya M.Ghotbi
Game Theory and Cooperation
Instructor: Ruta Mehta TA: Omkar Thakoor
Introduction to Game Theory
Instructor: Ruta Mehta TA: TBA
Christos H. Papadimitriou UC Berkeley
Game Theory, Internet and the Web A new Science?
Christos H. Papadimitriou UC Berkeley christos
Presented By Aaron Roth
The Price of Routing Unsplittable Flow
Presentation transcript:

Game Theory, Internet and the Web A new Science? Paul G. Spirakis (google: Paul Spirakis) University of Liverpool (with help from C. H. Papadimitriou, Berkeley)

Main Goal of Computer Science ( ): To investigate the capabilities and limits of the Computing Model of von Neumann – Turing (and its software) ( Math Tools: Logic, Combinatorics, Automata ) What is the goal of Computer Science for the 21 st century? 2

3

The Internet and the Web Built, operated and used by a variety of entities with diverse interests. Not yet understood deeply “The Web is a huge arena of competition and cooperation between many logical entities with selfish interests” (C.H. Papadimitriou) New Tool: Math Foundations of Economics, Game Theory 4

Game Theory Game = Any interaction among rational and logical entities each of which may have different motives and goals. Game Γ = (Ν, {S i }, {u i }) N = Set of “players” S i = Set of pure strategics of player i u i : XS i  R = The utility function of player i (Expected Utility Theorem of Von Neumann & Morgenstern) 5

A game is a system of rational and logical entities in interaction Selfish entities: Each of them has a possibly different utility function (and wants to maximize it) “People are expected utility maximizers” Such systems are very different from the “usual” 6

7 Game Theory strategies 3,-2 payoffs Similarly for many players

8 1,-1-1,1 1,-1 3,33,30,40,4 4,04,01,11,1 This for that Prisoner’s dilemma e.g.

Rational Behaviour Dominant Strategies (but they do not always exist) Nash Equilibria (mutual best response) Each player will not benefit if she deviates unilaterally Mixed Strategies allowed (i.e. prob. distributions on the pure strategies of each player). 9

John Forbes Nash, Jr. (A beautiful mind) Theorem [Nash, 1952] Every finite game has at least one Nash Equilibrium 10

The beauty of Mathematics Discrete Math (Graphs) Sperner Lemma (Combinatorics) Fixpoint Theorem of Brower (Analyis) Kakutani’s Theorem  Market Equilibria Nash’s Theorem zero sum games duality, linear programming 11 ?  P

Discrete Mathematics «Any directed graph with indegrees and outdegrees at most 1, if it has a source then it has a sink» 12 source s sink t

13 Sperner’s Lemma: Any legal coloring of a triangulated polytope contains a trichromatic triangle. Proof: !

Sperner  Brower Brower’s Thm:: Any continuous function from a polytope to itself has a fix point. Proof Triangulate the polytope. Color the vertices according to the direction indicated by the function. Sperner  There exist a triangle with “no exit” Now make the triangulation dense The subsequence of the centers of the Sperner triangles converges QED 14

Brower  Nash For each pair of mixed strategies x, y let:  (x,y) = (x’, y’), where x΄ maximizes off 1 (x’,y) - |x – x’| 2, (off 1 = expected payoff of player 1) Similarly for y’. Now any Brower fixpoint is a Nash Equilibrium QED 15

Nash  von Neumann If the game is zero – sum (constant sum) them the mutual best responses are the same as a max-min pair (and due to duality, the solution of a Linear Program). 16

The notion of Equilibrium is basic in many Sciences 17

Some Questions 18 How logical is the probabilistic play? (poker bluffs, tax evasion) Can we “learn” (or compute) an equilibrium; What is the best (worst) Equilibrium;

19 Approximate Equilibria ε-Nash: Each player stays at equilibrium decision, even if she may gain at most “epsilon” by unilaterally deviating “We don’t change our mate for a slightly better” Can we compute ε-Nash equilibria efficiently? BEST Poly-time result: ε = 0.34 [Tsaknakis, Spirakis, 07] Sub exponential methods (Lipton, Markakis, Mehta, 03) (Tsaknakis, Spirakis, 10) Still open to go below “1/3”

20 The battlefield The “system” The Web The terrain Society SOCIAL COST (Function of Social happiness) SC : XC i  R The function measures the social cost, given the choices (strategies) y i of each player i.

21 Examples of Social Cost Energy spent Max delay in streets Political cost for the country / EU given the decisions of the leaders. Altrouist: A player whose utility function “agrees” with the social cost function

22 If God would order everybody how to decide then we would get an Optimal Social Cost, OPT But, actually, the “system” reaches an equilibrium P How far is SC(p) from OPT? (Usually OPT is not even an equilibrium!)

23 The Price of Anarchy (PoA) (max over all NE p). [Koutsoupias, Papadimitriou, 1999] Coordination Ratio [Mavronicolas, Spirakis, 2001] [Roughgarden, Tardos, 2001]

24 But also The Price of Stability (PoS) (min over all NE p) [Schulz, Stier Moses, 2003] [Anshelevich et al, 2004] Lots of results for PoA, PoS for congestion games, network creation games etc.

25 How to Control Anarchy Mechanisms design A set of rules and options put by game’s designers. Does not affect the free will of players. But appeals to their selfishess (e.g. payments, punishments, ads). Aims in “moving the game” to “good equilibria” (desirable by the designer) New challenges in algorithms! Auctions Lies and truthfullness Stackelberg’s games (Leader plays first)

26 Dynamics How can a Selfish System (e.g. the markets, Society, the Web) approach an Equilibrium? Dynamics Players interact, learn and do selfish choices, and the “state” of the System changes with time Many, repeated, concurrent games all the time.

27 The world is not perfect Players may be illogical and not so rational Players may have limited information about the game (s), or limited knowledge. Errors are human / also for Computers (“Trembling Hand”) Other factors (enemies of the System, “free- riders”, strange behaviour, …)

28 But, fortunately: Players can learn, adapt, evolve Biology and “Self-regulation” [Self-stabilization) [Dijkstra] [S. Dolev, E. Schiller] Equilibria in animal, plants (microbes) communities in antagonism or cooperation John Maynard Smith (1974) (Evolutionary Games).

29 Yet another Science Mathematical Ecology (Alfred Lotka, Vito Volterra, 1920) (dynamics of moskitos, also of hunter-prey fish in Adriatic Sea ). Ancestor of Evolutionary Game Theory Evolutionary Methods in Economics [Robert Axelrod, 1984]

30 Relevant Math. Nonlinear dynamical systems Differential Equations Attractors, oscillations, Equilibria Chaotic Behaviour! (and, again, fixpoints!)

31 Dynamics of Selfish Systems Norms (Contracts, Social Rules) “Internal” causes for change: - players’ selfish behaviour - learning, adaptation Externalities “Final” result (equilibrium, stability, but also complex behaviour, chaos)

32 A New Science Deep and elegant Different Strong interaction with Foundations of CS Emerges everywhere (Research, Education, funds) (also new Industry: e-commerce, ads, Social Nets …) A new light in Complexity Isaac Asimov’s “psychohistory”?

33 MANY THANKS FOR LISTENING TO ME.