Game Theory is Evolving MIT 14.126, Fall 2001. Our Topics in the Course  Classical Topics Choice under uncertainty Cooperative games  Values  2-player.

Slides:



Advertisements
Similar presentations
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Advertisements

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.
A Short Tutorial on Game Theory EE228a, Fall 2002 Dept. of EECS, U.C. Berkeley.
Static Games and Cournot Competition
Infinitely Repeated Games. In an infinitely repeated game, the application of subgame perfection is different - after any possible history, the continuation.
Chapter 14 Infinite Horizon 1.Markov Games 2.Markov Solutions 3.Infinite Horizon Repeated Games 4.Trigger Strategy Solutions 5.Investing in Strategic Capital.
The basics of Game Theory Understanding strategic behaviour.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Thursday. 2.No new reading for Thursday, should be done with Ch 8, up to page.
An Introduction to Game Theory Part I: Strategic Games
Dynamic Games of Complete Information.. Repeated games Best understood class of dynamic games Past play cannot influence feasible actions or payoff functions.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
Adverse Selection Asymmetric information is feature of many markets
David Bryce © Adapted from Baye © 2002 Game Theory: The Competitive Dynamics of Strategy MANEC 387 Economics of Strategy MANEC 387 Economics.
Basics on Game Theory For Industrial Economics (According to Shy’s Plan)
Static Games and Cournot Competition
Job Market Signaling (Spence model)
APEC 8205: Applied Game Theory Fall 2007
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
Game Theory April 9, Prisoner’s Dilemma  One-shot, simultaneous game  Nash Equilibrium (individually rational strategies) is not Pareto Optimal.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/23 3/9.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
UNIT III: COMPETITIVE STRATEGY
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:
The Agencies Method for Coalition Formation in Experimental Games John Nash (University of Princeton) Rosemarie Nagel (Universitat Pompeu Fabra, ICREA,
The Core MIT , Fall Lecture Outline  Coalitional Games and the Core The non-transferable utility ( “ NTU ” ) formulation The transferable.
Social Choice Session 7 Carmen Pasca and John Hey.
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
Learning in Multiagent systems
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
EC941 - Game Theory Prof. Francesco Squintani Lecture 5 1.
Microeconomics 2 John Hey. Game theory (and a bit of bargaining theory) A homage to John Nash. Born Still alive (as far as Google knows). Spent.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Chapter 9: Static Games and Cournot Competition 1 Static Games and Cournot Competition.
Dynamic Games & The Extensive Form
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Chapters 29 and 30 Game Theory and Applications. Game Theory 0 Game theory applied to economics by John Von Neuman and Oskar Morgenstern 0 Game theory.
Chapters 29, 30 Game Theory A good time to talk about game theory since we have actually seen some types of equilibria last time. Game theory is concerned.
Extensive Games with Imperfect Information
제 10 장 게임이론 Game Theory: Inside Oligopoly
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.
Oligopolies & Game Theory
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Chapters 29 and 30 Game Theory and Applications. Game Theory 0 Game theory applied to economics by John Von Neuman and Oskar Morgenstern 0 Game theory.
Chapter 6 Extensive Form Games With Perfect Information (Illustrations)
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
Game Theory (Microeconomic Theory (IV)) Instructor: Yongqin Wang School of Economics, Fudan University December, 2004.
5.1.Static Games of Incomplete Information
Topics to be Discussed Gaming and Strategic Decisions
ECO290E: Game Theory Lecture 3 Why and How is Nash Equilibrium Reached?
Ch. 16 Oligopoly. Oligopoly Only a few sellers offer similar or identical products Actions of any seller can have large impact on profits of other sellers.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 1 A Quick Review of Game Theory and, in particular, Bayesian Games.
Nash Bargaining Solution and Alternating Offer Games MIT Game Theory.
Second lecture: The theory of monopoly, monopsony and bilateral monopoly: the standard microeconomic theory and its limits. Third lecture: The theory of.
NMA course Marko Lindroos
Markets with Only a Few Sellers
Intermediate Microeconomics
Oligopolies & Game Theory
Ch. 16 Oligopoly.
Game Theory: The Competitive Dynamics of Strategy
Dynamic Games of Complete Information
Econ 805 Advanced Micro Theory 1
Oligopolies & Game Theory
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 2 Bayesian Games Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Chapter 29 Game Theory Key Concept: Nash equilibrium and Subgame Perfect Nash equilibrium (SPNE)
UNIT II: The Basic Theory
Presentation transcript:

Game Theory is Evolving MIT , Fall 2001

Our Topics in the Course  Classical Topics Choice under uncertainty Cooperative games  Values  2-player bargaining  Core and related  Cores of market games Non-cooperative games  Fixed points/equilibrium  Refinements  (Repeated games)  Newer Topics “ Nash program ” (noncoop foundations for coop games) Cheap talk Experiments Foundations of Noncoop Games  Epistemic  Learning  Evolutionary Mechanism design Other economic applications  Commitment, signaling  Comparative statics

Two Game Formulations  The cooperative concept Perfect communication Perfect contract enforcement  Formulation (N,v) N is a set of players TU case: v:2 N → R NTU case: v(S):2 N → R S  Solution(s): (set of) value allocations π ∈ R N  The non-cooperative concept No communication No contract enforcement  Formulation (N,S,π) N is a set of players x ∈ S=S 1 × … ×S N is a strategy profile π n (x)=n ’ s payoff  Solution(s): (set of) strategy profiles x ∈ S

Example: Linear Duopoly  Non-cooperative  Players: 1 and 2  Strategies: Output levels x 1 and x 2  Payoffs: xi[1-(x 1 +x 2 )-c i ]  Nash Equilibrium: x 1 =(1+c 2 -2c 1 )/3 x 2 =(1+c 1 -2c 2 )/3  Cooperative TU  Cooperative NTU  Solution?

Cooperative Solutions

Solutions: Points & Sets  Cooperative “ one point ” solutions usually attempt to extend a symmetric solution to asymmetric games. “ Nash bargaining solution ” “ Shapley value ” In the TU Cournot game, the solution might be π j =v(i)+ ½ [v(1,2)-v(i)] with v(i)=0 or Cournot profit.  Others generalize the indeterminacy of the bargaining outcome and identify only what is “ blocked. ” In the NTU Cournot game, the “ core ” consists of all the efficient, individually rational outcomes.

The Shapley Value ϕ n (N,v)  Four axioms for TU games Efficiency: Σ ϕ n (N,v)=v(N) Null player: If v(S ∪ {n}) ≡ v(S) then ϕ n (N,v)=0. Symmetry: Permutations don ’ t matter Additivity: ϕ (N,v+w)= ϕ (N,v)+ ϕ (N,w)  Analysis: The games (N,v) (with N fixed) form a linear space. Let χ S (T)=1 if S ⊂ T and χ S (T)=0 otherwise. Axiom 1-3: ϕ n (αχ S )=α/|S| if n ∈ S and ϕ n (αχ S )=0 if n ∉ S. Add Axiom 4: ϕ is a linear operator

Shapley ’ s Theorem  Notation: Π = set of permutations of N, typical element π, mapping elements of N onto {1, …,|N|}. S iπ ={j:π j ≤π j }  Theorem.  Proof. The given ϕ satisfies the axioms by inspection. Since the χ S games form a basis, there is a unique linear operator that does so. QED

Shapley Intepretations  Power, for example in voting games.  Fairness, for example in cost allocations.  Extension: Aumann-Shapley pricing Cornell long-distance phone cost allocation Game has K types of players with mass a k of type k. “ Diagonal formula ” : ϕ k (N, v ) =∫v k (sa 1,..., sa k )ds

Crossover Ideas Connecting Cooperative and Non- cooperative game ideas

Crossover Ideas, 1  Cheap Talk What happens to non-cooperative games when we add a stage of message exchange? In the following game, suppose  Payoff unit is $10,000s  Row player can send a message …

Crossover Ideas, 2  The “ Nash Program ” Non-cooperative foundations for cooperative solutions 2-player bargaining problem  Nash ’ s bargaining solution  Nash demand game  Stahl-Rubinstein “ alternating offers ” model Exchange economies  Competitive equilibrium (core)  Shapley-Shubik game  Auction and bidding games

Nash Demand Bargaining  Let v(1)=v(2)=0, v(12)=1. The “ core ” is the set of payoff vectors π that are:  “ Efficient ” : Σ n ∈ N π n =v(N)  “ Unblocked ” : ( ∀ S ⊂ N) Σn ∈ S πn≥v(S) In this case, Core(N,v)={(π 1,π 2 ): π 1,π 2 ≥0, π 1 +π 2 =1}.  Nash demand game. S 1 =S 2 =[0,1]. “ Perfect ” equilibria coincide with the core.

Alternating Offer Bargaining  Players 1 and 2 take turn making offers.  If agreement (x 1,x 2 ) is reach at time t, payoffs are δ t (x 1,x 2 ).  Unique subgame perfect equilibrium has payoffs of “ almost ” the (.5,.5) Nash solution: if n moves first otherwise

Noncooperative Theory Rethinking equilibrium

What are we trying to model?  Animal behavior: evolutionary stable strategies  Learned behavior: Reinforcement learning models Self-confirming equilibrium  Self-enforcing agreements: Nash equilibrium & refinements  Reflection among rational players “ Interactive epistemology “

Animal Behavior  Hawk-Dove game: what behavior will evolve?

Human Experiments  The “ Ultimatum Game ” Players: {1,2} Strategies  Player 1 makes an offer x,1-x; x ∈ [0,1]  Player 2 sees it and says “ yes ” or “ no ” Payoffs  If 2 says “ yes, ” payoffs are (x,1-x).  If 2 says “ no, ” payoffs are (0,0). Analysis Unique subgame perfect equilibrium outcome: (x=1,yes).  It never happens that way!

Learning Models  Behavior is established by some kind of adaptive learning Kind #1: Players repeat strategies that were “ successful ” in “ similar ” past situations Kind #2: Players forecast based on others ’ past play and, eventually, optimize accordingly.  Stationary points: “ fulfilled expectations ” equilibrium

Epistemic Analyses  “ What I do depends on what I expect. ”  The “ centipede game ” Is it rational below for A to grab $5? What should B believe if its probability one forecast of A ’ s behavior is contradicted?

Forward Induction  Are both subgame perfect equilibria reasonable as rational play?