ECON6036 1st semester Format of final exam Same as the mid term

Slides:



Advertisements
Similar presentations
Infinitely Repeated Games
Advertisements

Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
Crime, Punishment, and Forgiveness
BASICS OF GAME THEORY. Recap Decision Theory vs. Game Theory Rationality Completeness Transitivity What’s in a game? Players Actions Outcomes Preferences.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
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.
Stackelberg -leader/follower game 2 firms choose quantities sequentially (1) chooses its output; then (2) chooses it output; then the market clears This.
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Infinitely Repeated Games. In an infinitely repeated game, the application of subgame perfection is different - after any possible history, the continuation.
Non-Cooperative Game Theory To define a game, you need to know three things: –The set of players –The strategy sets of the players (i.e., the actions they.
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.
1 Game Theory. 2 Agenda Game Theory Matrix Form of a Game Dominant Strategy and Dominated Strategy Nash Equilibrium Game Trees Subgame Perfection.
Infinitely Repeated Games Econ 171. Finitely Repeated Game Take any game play it, then play it again, for a specified number of times. The game that is.
EC941 - Game Theory Lecture 7 Prof. Francesco Squintani
Game Theory: Inside Oligopoly
Game Theory Lecture 9.
Game Theory Lecture 8.
A Introduction to Game Theory Xiuting Tao. Outline  1 st a brief introduction of Game theory  2 nd Strategic games  3 rd Extensive games.
Repeated Prisoner’s Dilemma If the Prisoner’s Dilemma is repeated, cooperation can come from strategies including: “Grim Trigger” Strategy – one.
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.
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Todd and Steven Divide the Estate Problem Bargaining over 100 pounds of gold Round 1: Todd makes offer of Division. Steven accepts or rejects. Round.
1 Game Theory Lecture 2 Game Theory Lecture 2. Spieltheorie- Übungen P. Kircher: Dienstag – 09: HS M S. Ludwig: Donnerstag Uhr.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Harsanyi transformation Players have private information Each possibility is called a type. Nature chooses a type for each player. Probability distribution.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
APEC 8205: Applied Game Theory Fall 2007
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Extensive Game with Imperfect Information III. Topic One: Costly Signaling Game.
Extensive Game with Imperfect Information Part I: Strategy and Nash equilibrium.
Game Applications Chapter 29. Nash Equilibrium In any Nash equilibrium (NE) each player chooses a “best” response to the choices made by all of the other.
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
© 2009 Institute of Information Management National Chiao Tung University Lecture Notes II-2 Dynamic Games of Complete Information Extensive Form Representation.
1. problem set 6 from Osborne’s Introd. To G.T. p.210 Ex p.234 Ex p.337 Ex. 26,27 from Binmore’s Fun and Games.
Reading Osborne, Chapters 5, 6, 7.1., 7.2, 7.7 Learning outcomes
Social Choice Session 7 Carmen Pasca and John Hey.
1 Game Theory Sequential bargaining and Repeated Games Univ. Prof.dr. M.C.W. Janssen University of Vienna Winter semester Week 46 (November 14-15)
Punishment and Forgiveness in Repeated Games. A review of present values.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Dynamic Games & The Extensive Form
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
Bargaining Theory MIT Game Theory. Bargaining Theory Cooperative (Axiomatic) –Edgeworth –Nash Bargaining –Variations of Nash –Shapley Value Non-cooperative.
Extensive Games with Imperfect Information
Topic 3 Games in Extensive Form 1. A. Perfect Information Games in Extensive Form. 1 RaiseFold Raise (0,0) (-1,1) Raise (1,-1) (-1,1)(2,-2) 2.
Lecture 5 Leadership and Reputation Reputations arise in situations where there is an element of repetition, and also where coordination between players.
Punishment, Detection, and Forgiveness in Repeated Games.
Incomplete information: Perfect Bayesian equilibrium
Chapter 6 Extensive Form Games With Perfect Information (Illustrations)
Extensive Form Games With Perfect Information (Illustrations)
EC941 - Game Theory Prof. Francesco Squintani Lecture 6 1.
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
Bargaining games Econ 414. General bargaining games A common application of repeated games is to examine situations of two or more parties bargaining.
Lec 23 Chapter 28 Game Theory.
Midterm Scores Total of 200 points, 40 per question. A B— C— D—50-79 F
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 1 A Quick Review of Game Theory and, in particular, Bayesian Games.
Somebody’s got to do it. Somebody’s got to do it.
Game Theory: The Competitive Dynamics of Strategy
Chapter 30 Game Applications.
Multiagent Systems Repeated Games © Manfred Huber 2018.
Chapter 14 & 15 Repeated Games.
Chapter 14 & 15 Repeated Games.
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Lecture Game Theory.
Presentation transcript:

ECON6036 1st semester 05-06 Format of final exam Same as the mid term Material not covered in final exam fixed point theorem—both proof and application purification of mixed strategy rationalizability, dominance solvability repeated game – overtaking criteria, limit of means criteria, Maskin-Tirole theorem Cho-Kreps Intuitive criteria

Material covered in final exam strategic game --Nash equilibrium Bayesian game --Bayesian equilibrium extensive game with perfect information --subgame perfect equilibrium bargaining game repeated game—subgame perfect equilibrium, trigger strategy, minmax value extensive game with imperfect information --perfect Bayesian equilibrium --sequential equilibrium

Exercise 211.1 (Timing claims on an investment) An amount of money accumulates; in period t (= 1, 2, ..., T) its size is $2t. In each period t two people simultaneously decide whether to claim the money. If only one person does so, she gets all the money; if both people do so, they split the money equally; either case, the game ends. If neither person does so, both people have the opportunity to do so in the next period; if neither person claims the money in period T, each person obtains $T. Each person cares only about the amount of money she obtains. Formulate this situation as an extensive game with perfect information and simultaneous moves, and find its SPE.

Equilibrium: immediate claiming Claim: in the SPE, each player always claims money whenever she is asked to move Proof: When t=T, it is the strictly dominant action for each to claim (by claiming, she gets T rather than 0 if the other also claims; she gets 2T rather than T if the other doesn’t) => each always claims money at t=T Assume each always claims money at t=k+1,…,T Then at t=k, each claiming is also best response (by claiming, she gets k rather than 0 if the other also claims; she gets 2k rather than (k+1) if the other doesn’t). (There exists another SPE in which in the first period neither claims money but in any subsequent period both claim money.)

EXERCISE 227.3 (Sequential duel) In a sequential duel, two people alternately have the opportunity to shoot each other; each has an infinite supply of bullets. On each of her turns, a person may shoot or refrain from doing so. Each of person i’s shots hits (and kills) its intended target with probability p, (independently of whether any other shots hit their targets). Each person cares only about her probability of survival (not about the other person's survival). Model this situation as an extensive game with perfect information and chance moves. Show that the strategy pairs in which neither person ever shoots and in which each person always shoots are both subgame perfect equilibria.

No shooting SPE Claim: each never shoots (whether or not somebody has ever shot) Proof: According to the prescripts, each’s survival probability is already one, and cannot be further increased. Hence, no beneficial unilateral deviation.

Shooting SPE Claim: each always shoot Proof: We argue that deviating one is not beneficial. Suppose now it is player 1’s turn to to move in period t. Let Q<1 be 1’s payoff (survival probability) conditional on both players exist in period t+1 and they act according to the prescripts thereafter. If 1 shoots in period t and both act according to the prescripts thereafter, 1’s payoff is p1+(1-p1)Q=p1(1-Q)+Q. If he does not shoot in period t and both act according to the prescripts, his payoff is Q. Clearly, the deviation is NOT beneficial.

Example 473.1 (One-sided offers) Consider the variant of the bargaining game of alternating offers in which only player 1 makes proposals. In every period, player 1 makes a proposal, which player 2 either accepts, ending the game, or rejects, leading to the next period, in which player 1 makes another proposal. Consider the strategy pair in which player 1 always proposes (x1,1-x1) and player 2 always accepts a proposal (y1,y2) if and only if y2 ≥ 1-x1. Find the value(s) of x1 for which this strategy pair is a subgame perfect equilibrium.

Equilibrium SPE: 1 always proposes (x1,1-x1); 2 always accepts a proposal giving her at least 1-x1 and rejects any inferior proposal. Claim: 1-x1=0. Proof: (use one stage deviation) Suppose not (so that 1-x1>0). Consider the history in which a proposal (z1,1-z1) is proposed so that δ(1-x1)<1-z1<(1-x1). By accepting this offer, 2 gets 1-z1 now. By rejecting this offer, 2 will get δ(1-x1)< 1-z1. Hence, 2 should accept the proposal which is strictly inferior than (x1,1-x1). But according to her prescript, she should not accept such an inferior proposal. A contradiction.

EXERCISE 445.1 (Tit-for-tat as a subgame perfect equilibrium) Consider the infinitely repeated Prisoner's Dilemma in which the payoffs of the component game are those given in the Figure. Show that (tit-for-tat, tit-for-tat) is a subgame perfect equilibrium of this infinitely repeated game with discount factor δ if and only if y-x=1 and δ= 1/x. C D x,x 0,y y,0 1,1 Note: 1 < x < y

Tit for Tat Tit-for-tat: do whatever the other did to you in the previous period Four types of histories to check: those ending with (C,C), (C,D), (D,C), (D,D). Need to show player 1 does not gain by one deviation

(C,C) C D x,x 0,y y,0 1,1

C,D C D x,x 0,y y,0 1,1

(D,C) C D x,x 0,y y,0 1,1

(D,D) C D x,x 0,y y,0 1,1

To summarize Conditions for no deviations: CC: y(1+δ)x CD: y≥(1+δ)x DC: δy≥1+δ DD: δy1+δ Hence, y=(1+ δ)x and δy=1+δ. Finally, δ=1/x and y-x=1. Both using tit-for-tat is SPE if and only if these two conditions hold. Very stringent conditions indeed!

EXERCISE 331.1 (Selten's horse) Find the perfect Bayesian equilibria of the game in Figure 331.2 in which each player's strategy is pure. Hint: Find the pure strategy Nash equilibria, then determine which is part of a weak sequential equilibrium

c d C 1,1,1 4,4,0 D 3,3,2 c d C 1,1,1 0,0,1 D 0,0,0 L R Two pure strat Nash equil: (D,c,L) and (C,c,R) The 1st one is NOT part of a PBE. Foreseeing 3 will choose L, 2 should choose d to earn 4 rather than c to earn 1. Not sequential rationality. Hence not PBE. The 2nd one is part of a PBE.