Game theory Lecture 19. Dynamic games. Game theory

Size: px
Start display at page:

Download "Game theory Lecture 19. Dynamic games. Game theory"

Transcription

1 Lecture 9. Dynamic games

2 . Introduction Definition. A dynamic game is a game Γ =< N, x, {U i } n i=, {H i } n i= >, where N = {, 2,..., n} denotes the set of players, x (t) = f (x, u,..., u n, t), x(0) = x 0, x = (x,..., x m ), 0 t T, indicates a controlled system in the space R m, U,..., U n are the strategy sets of players,..., n, respectively, and a function H i (u,..., u n ) specifies the payoff of player i N.

3 . Introduction A controlled system is considered on a time interval [0, T ] (finite or infinite). Player strategies represent some functions u i = u i (t), i =,..., n. Depending on selected strategies, each player receives the payoff H i (u,..., u n ) = T 0 g i (x(t), u (t),..., u n (t), t)dt+g i (x(t ), T ), i =,..., n Actually, it consists of the integral component and the terminal component; g i and G i, i =,..., n are given functions. There exist cooperative and noncooperative dynamic games. Solutions of noncooperative games are comprehended in the sense of Nash equilibria.

4 . Introduction Definition 2. A Nash equilibrium in the game Γ is a set of strategies (u,..., u n) such that H i (u i, u i ) H i (u ) for arbitrary strategies u i, i =,..., n.

5 2. Discrete-time Dynamic Games (Fish Wars) Imagine a certain dynamic system governed by the system of difference equations x t+ = (x t ) α, t = 0,,..., where 0 < α. For instance, this is the evolution of some fish population. The initial state x 0 of the system is given. The system admits the stationary state x =. If x 0 >, the population diminishes approaching infinitely the limit state x =. In the case of x 0 <, the population spreads out with the same asymptotic line.

6 2. Discrete-time Dynamic Games (Fish Wars) Suppose that two countries (players) perform fishing; they aim at maximizing the income (the amount of fish) on some time interval. The utility function of each player depends on the amount of fish u caught by this player and takes the form log(u). The discounting coefficients δ (player ) and δ 2 (player 2) are given, 0 < δ i <, i =, 2. Find a Nash equilibrium in this game.

7 First, we study this problem on a finite interval. Take the one-shot model. Assume that players decide to catch the amounts u and u 2 at the initial instant (here u + u 2 x 0 ). At the next instant t =, the population of fish has the size x = (x 0 u u 2 ) α. The game finishes and, by the agreement, players divide the remaining amount of fish equally. The payoff of player makes up H (u, u 2 ) = log u + δ log ( 2 (x u u 2 ) α) = = log u + αδ log(x u u 2 ) δ log 2, x = x 0. Similarly, player 2 obtains the payoff H 2 (u, u 2 ) = log u 2 + αδ 2 log(x u u 2 ) δ 2 log 2, x = x 0.

8 The functions H (u, u 2 ) and H 2 (u, u 2 ) are convex, and a Nash equilibrium exists. For its evaluation, solve the system of equations H / u = 0, H 2 / u 2 = 0, or αδ = 0, u x u u 2 And so, the equilibrium is defined by u = u 2 αδ 2 ( + αδ )( + αδ 2 ) x, u 2 = αδ 2 x u u 2 = 0. The size of the population after fishing constitutes x u u 2 = αδ ( + αδ )( + αδ 2 ) x. α 2 δ δ 2 ( + αδ )( + αδ 2 ) x. The players payoffs in the equilibrium become H (u, u 2) = (+αδ ) log x +a, H 2 (u, u 2) = (+αδ 2 ) log x +a 2,

9 where the constants a, a 2 follow from the expressions ( αδ j (α 2 δ δ 2 ) αδ ) i a i = log [( + αδ )( + αδ 2 ) ] +αδ δ i i log 2, i, j =, 2, i j. Now, suppose that the game includes two shots, i.e., players can perform fishing twice. We have determined the optimal behavior and payoffs of both players at the last shot. Hence, the equilibrium in the two-shot model results from maximization of the new payoff functions H 2 (u, u 2 ) = log u + αδ ( + αδ ) log(x u u 2 ) + δ a, x = x 0, H 2 2 (u, u 2 ) = log u + αδ 2 ( + αδ 2 ) log(x u u 2 ) + δ 2 a 2, x = x 0. The Nash equilibrium appears from the system of equations αδ ( + αδ ) = 0, u x u u 2 αδ 2( + αδ 2 ) = 0. u 2 x u u 2

10 Again, it possesses the linear form: u 2 = αδ 2 ( + αδ 2 ) ( + αδ )( + αδ 2 ) x, u2 2 = αδ ( + αδ ( + αδ )( + αδ 2 ) x. We continue such construction procedure to arrive at the following conclusion. In the n-shot fish war game, the optimal strategies of players are defined by u n = αδ 2 n n (αδ ) j (αδ 2 ) j x, u n (αδ 2 ) j 2 n = j= αδ n n (αδ ) j (αδ ) j x. n (αδ 2 ) j j= ()

11 After shot n, the population of fish has the size x u n u n 2 = α 2 n δ δ 2 (αδ ) j n (αδ 2 ) j n (αδ ) j n (αδ 2 ) j j= As n, the expressions (), (2) admit the limits u = lim n un = Therefore, αδ 2 ( αδ )x ( αδ )( αδ 2 ), u 2 = x. (2) αδ ( αδ 2 )x ( αδ )( αδ 2 ). where x u u 2 = lim n x un u n 2 = kx, k = α 2 δ δ 2 x ( αδ )( αδ 2 ).

12 Suppose that at each shot players adhere to the strategies u, u 2. Starting from the initial state x 0, the system evolves according to the law x t+ = (x t u (x t ) u 2(x t )) α = k α x α t = k α (kx α t ) α = k α+α2 x α2 t =... = k t j= α j x αt 0, t = 0,, 2,... Under large t, the system approaches the stationary state x = ( ) α α αδ +. (3) αδ 2 In the case of δ = δ 2 = δ, the stationary state has the form ( ) α x = αδ α 2 αδ.

13 We focus on the special linear case. Here the population of fish demonstrates the following dynamics: x t+ = r(x t u u 2 ), r >. Apply the same line of reasoning as before to get the optimal strategies: u n = (δ 2 ) j δ 2 n x, u n n (δ ) j (δ 2 ) j 2 n = j= (δ ) j δ n x. n n (δ ) j (δ 2 ) j j= As n, we obtain the limit strategies u = δ 2 ( δ )x ( δ )( δ 2 ), u 2 = δ ( δ 2 )x ( δ )( δ 2 ).

14 As far as x u u2 x = δ + δ 2, the optimal strategies of the players lead to the population dynamics ( ) t r x t = δ + δ 2 x r t = δ + x 0, t = 0,,... δ 2 Obviously, the population dynamics in the equilibrium essentially depends on the coefficient r/( δ + δ 2 ). The latter being smaller than, the population degenerates; if this coefficient exceeds, the population grows infinitely. And finally, under strict equality to, the population possesses the stable size. In the case of identical discounting coefficients (δ = δ 2 = δ), further development or extinction of the population depends on the sign of δ(r + ) 2.

MS&E 246: Lecture 4 Mixed strategies. Ramesh Johari January 18, 2007

MS&E 246: Lecture 4 Mixed strategies. Ramesh Johari January 18, 2007 MS&E 246: Lecture 4 Mixed strategies Ramesh Johari January 18, 2007 Outline Mixed strategies Mixed strategy Nash equilibrium Existence of Nash equilibrium Examples Discussion of Nash equilibrium Mixed

More information

Long-Run versus Short-Run Player

Long-Run versus Short-Run Player Repeated Games 1 Long-Run versus Short-Run Player a fixed simultaneous move stage game Player 1 is long-run with discount factor δ actions a A a finite set 1 1 1 1 2 utility u ( a, a ) Player 2 is short-run

More information

6.254 : Game Theory with Engineering Applications Lecture 8: Supermodular and Potential Games

6.254 : Game Theory with Engineering Applications Lecture 8: Supermodular and Potential Games 6.254 : Game Theory with Engineering Applications Lecture 8: Supermodular and Asu Ozdaglar MIT March 2, 2010 1 Introduction Outline Review of Supermodular Games Reading: Fudenberg and Tirole, Section 12.3.

More information

Mixed Nash Equilibria

Mixed Nash Equilibria lgorithmic Game Theory, Summer 2017 Mixed Nash Equilibria Lecture 2 (5 pages) Instructor: Thomas Kesselheim In this lecture, we introduce the general framework of games. Congestion games, as introduced

More information

An Introduction to Noncooperative Games

An Introduction to Noncooperative Games An Introduction to Noncooperative Games Alberto Bressan Department of Mathematics, Penn State University Alberto Bressan (Penn State) Noncooperative Games 1 / 29 introduction to non-cooperative games:

More information

Noncooperative continuous-time Markov games

Noncooperative continuous-time Markov games Morfismos, Vol. 9, No. 1, 2005, pp. 39 54 Noncooperative continuous-time Markov games Héctor Jasso-Fuentes Abstract This work concerns noncooperative continuous-time Markov games with Polish state and

More information

Extensive Form Games I

Extensive Form Games I Extensive Form Games I Definition of Extensive Form Game a finite game tree X with nodes x X nodes are partially ordered and have a single root (minimal element) terminal nodes are z Z (maximal elements)

More information

Game Theory. Greg Plaxton Theory in Programming Practice, Spring 2004 Department of Computer Science University of Texas at Austin

Game Theory. Greg Plaxton Theory in Programming Practice, Spring 2004 Department of Computer Science University of Texas at Austin Game Theory Greg Plaxton Theory in Programming Practice, Spring 2004 Department of Computer Science University of Texas at Austin Bimatrix Games We are given two real m n matrices A = (a ij ), B = (b ij

More information

Economics 209A Theory and Application of Non-Cooperative Games (Fall 2013) Extensive games with perfect information OR6and7,FT3,4and11

Economics 209A Theory and Application of Non-Cooperative Games (Fall 2013) Extensive games with perfect information OR6and7,FT3,4and11 Economics 209A Theory and Application of Non-Cooperative Games (Fall 2013) Extensive games with perfect information OR6and7,FT3,4and11 Perfect information A finite extensive game with perfect information

More information

Political Economy of Institutions and Development: Problem Set 1. Due Date: Thursday, February 23, in class.

Political Economy of Institutions and Development: Problem Set 1. Due Date: Thursday, February 23, in class. Political Economy of Institutions and Development: 14.773 Problem Set 1 Due Date: Thursday, February 23, in class. Answer Questions 1-3. handed in. The other two questions are for practice and are not

More information

Mean-field equilibrium: An approximation approach for large dynamic games

Mean-field equilibrium: An approximation approach for large dynamic games Mean-field equilibrium: An approximation approach for large dynamic games Ramesh Johari Stanford University Sachin Adlakha, Gabriel Y. Weintraub, Andrea Goldsmith Single agent dynamic control Two agents:

More information

Distributed Learning based on Entropy-Driven Game Dynamics

Distributed Learning based on Entropy-Driven Game Dynamics Distributed Learning based on Entropy-Driven Game Dynamics Bruno Gaujal joint work with Pierre Coucheney and Panayotis Mertikopoulos Inria Aug., 2014 Model Shared resource systems (network, processors)

More information

Economics 201B Economic Theory (Spring 2017) Bargaining. Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7).

Economics 201B Economic Theory (Spring 2017) Bargaining. Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7). Economics 201B Economic Theory (Spring 2017) Bargaining Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7). The axiomatic approach (OR 15) Nash s (1950) work is the starting point

More information

Basics of Game Theory

Basics of Game Theory Basics of Game Theory Giacomo Bacci and Luca Sanguinetti Department of Information Engineering University of Pisa, Pisa, Italy {giacomo.bacci,luca.sanguinetti}@iet.unipi.it April - May, 2010 G. Bacci and

More information

EC319 Economic Theory and Its Applications, Part II: Lecture 2

EC319 Economic Theory and Its Applications, Part II: Lecture 2 EC319 Economic Theory and Its Applications, Part II: Lecture 2 Leonardo Felli NAB.2.14 23 January 2014 Static Bayesian Game Consider the following game of incomplete information: Γ = {N, Ω, A i, T i, µ

More information

Near-Potential Games: Geometry and Dynamics

Near-Potential Games: Geometry and Dynamics Near-Potential Games: Geometry and Dynamics Ozan Candogan, Asuman Ozdaglar and Pablo A. Parrilo January 29, 2012 Abstract Potential games are a special class of games for which many adaptive user dynamics

More information

Non-zero-sum Game and Nash Equilibarium

Non-zero-sum Game and Nash Equilibarium Non-zero-sum Game and Nash Equilibarium Team nogg December 21, 2016 Overview Prisoner s Dilemma Prisoner s Dilemma: Alice Deny Alice Confess Bob Deny (-1,-1) (-9,0) Bob Confess (0,-9) (-6,-6) Prisoner

More information

Quitting games - An Example

Quitting games - An Example Quitting games - An Example E. Solan 1 and N. Vieille 2 January 22, 2001 Abstract Quitting games are n-player sequential games in which, at any stage, each player has the choice between continuing and

More information

Near-Potential Games: Geometry and Dynamics

Near-Potential Games: Geometry and Dynamics Near-Potential Games: Geometry and Dynamics Ozan Candogan, Asuman Ozdaglar and Pablo A. Parrilo September 6, 2011 Abstract Potential games are a special class of games for which many adaptive user dynamics

More information

Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games

Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,

More information

Computing Minmax; Dominance

Computing Minmax; Dominance Computing Minmax; Dominance CPSC 532A Lecture 5 Computing Minmax; Dominance CPSC 532A Lecture 5, Slide 1 Lecture Overview 1 Recap 2 Linear Programming 3 Computational Problems Involving Maxmin 4 Domination

More information

Copyright (C) 2013 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of the Creative

Copyright (C) 2013 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of the Creative Copyright (C) 2013 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of the Creative Commons attribution license http://creativecommons.org/licenses/by/2.0/

More information

Computing Equilibria of Repeated And Dynamic Games

Computing Equilibria of Repeated And Dynamic Games Computing Equilibria of Repeated And Dynamic Games Şevin Yeltekin Carnegie Mellon University ICE 2012 July 2012 1 / 44 Introduction Repeated and dynamic games have been used to model dynamic interactions

More information

EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium

EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium Reading EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium Osborne Chapter 4.1 to 4.10 By the end of this week you should be able to: find a mixed strategy Nash Equilibrium of a game explain why mixed

More information

3.3.3 Illustration: Infinitely repeated Cournot duopoly.

3.3.3 Illustration: Infinitely repeated Cournot duopoly. will begin next period less effective in deterring a deviation this period. Nonetheless, players can do better than just repeat the Nash equilibrium of the constituent game. 3.3.3 Illustration: Infinitely

More information

Repeated Downsian Electoral Competition

Repeated Downsian Electoral Competition Repeated Downsian Electoral Competition John Duggan Department of Political Science and Department of Economics University of Rochester Mark Fey Department of Political Science University of Rochester

More information

Microeconomics. 2. Game Theory

Microeconomics. 2. Game Theory Microeconomics 2. Game Theory Alex Gershkov http://www.econ2.uni-bonn.de/gershkov/gershkov.htm 18. November 2008 1 / 36 Dynamic games Time permitting we will cover 2.a Describing a game in extensive form

More information

Exercise 11. Solution. EVOLUTION AND THE THEORY OF GAMES (Spring 2009) EXERCISES Show that every 2 2 matrix game with payoff matrix

Exercise 11. Solution. EVOLUTION AND THE THEORY OF GAMES (Spring 2009) EXERCISES Show that every 2 2 matrix game with payoff matrix EOLUTION AND THE THEORY OF GAMES (Spring 009) EXERCISES 11-15 Exercise 11 Show that every matrix game with payoff matrix a,a c,b b,c d,d with a c or b d has at least one ESS. One should distinguish the

More information

Backwards Induction. Extensive-Form Representation. Backwards Induction (cont ) The player 2 s optimization problem in the second stage

Backwards Induction. Extensive-Form Representation. Backwards Induction (cont ) The player 2 s optimization problem in the second stage Lecture Notes II- Dynamic Games of Complete Information Extensive Form Representation (Game tree Subgame Perfect Nash Equilibrium Repeated Games Trigger Strategy Dynamic Games of Complete Information Dynamic

More information

6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games

6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games 6.254 : Game Theory with Engineering Applications Lecture 7: Asu Ozdaglar MIT February 25, 2010 1 Introduction Outline Uniqueness of a Pure Nash Equilibrium for Continuous Games Reading: Rosen J.B., Existence

More information

Computing Solution Concepts of Normal-Form Games. Song Chong EE, KAIST

Computing Solution Concepts of Normal-Form Games. Song Chong EE, KAIST Computing Solution Concepts of Normal-Form Games Song Chong EE, KAIST songchong@kaist.edu Computing Nash Equilibria of Two-Player, Zero-Sum Games Can be expressed as a linear program (LP), which means

More information

Theory Field Examination Game Theory (209A) Jan Question 1 (duopoly games with imperfect information)

Theory Field Examination Game Theory (209A) Jan Question 1 (duopoly games with imperfect information) Theory Field Examination Game Theory (209A) Jan 200 Good luck!!! Question (duopoly games with imperfect information) Consider a duopoly game in which the inverse demand function is linear where it is positive

More information

Evolution & Learning in Games

Evolution & Learning in Games 1 / 27 Evolution & Learning in Games Econ 243B Jean-Paul Carvalho Lecture 2. Foundations of Evolution & Learning in Games II 2 / 27 Outline In this lecture, we shall: Take a first look at local stability.

More information

Dynamic Games, II: Bargaining

Dynamic Games, II: Bargaining Dynamic Games, II: Bargaining Econ 400 University of Notre Dame Econ 400 (ND) Dynamic Games, II: Bargaining 1 / 16 Bargaining In bargaining games, we are generally trying to model agents haggling back-and-forth

More information

6.891 Games, Decision, and Computation February 5, Lecture 2

6.891 Games, Decision, and Computation February 5, Lecture 2 6.891 Games, Decision, and Computation February 5, 2015 Lecture 2 Lecturer: Constantinos Daskalakis Scribe: Constantinos Daskalakis We formally define games and the solution concepts overviewed in Lecture

More information

Advanced Microeconomics

Advanced Microeconomics Advanced Microeconomics Leonardo Felli EC441: Room D.106, Z.332, D.109 Lecture 8 bis: 24 November 2004 Monopoly Consider now the pricing behavior of a profit maximizing monopolist: a firm that is the only

More information

Game Theory. 4. Algorithms. Bernhard Nebel and Robert Mattmüller. May 2nd, Albert-Ludwigs-Universität Freiburg

Game Theory. 4. Algorithms. Bernhard Nebel and Robert Mattmüller. May 2nd, Albert-Ludwigs-Universität Freiburg Game Theory 4. Algorithms Albert-Ludwigs-Universität Freiburg Bernhard Nebel and Robert Mattmüller May 2nd, 2018 May 2nd, 2018 B. Nebel, R. Mattmüller Game Theory 2 / 36 We know: In finite strategic games,

More information

Computing Minmax; Dominance

Computing Minmax; Dominance Computing Minmax; Dominance CPSC 532A Lecture 5 Computing Minmax; Dominance CPSC 532A Lecture 5, Slide 1 Lecture Overview 1 Recap 2 Linear Programming 3 Computational Problems Involving Maxmin 4 Domination

More information

FPTAS for Computing a Symmetric Leontief Competitive Economy Equilibrium

FPTAS for Computing a Symmetric Leontief Competitive Economy Equilibrium FPTAS for Computing a Symmetric Leontief Competitive Economy Equilibrium Department of Management Science and Engineering, and Institute of Computational and Mathematical Engineering Stanford University

More information

Game Theory. Professor Peter Cramton Economics 300

Game Theory. Professor Peter Cramton Economics 300 Game Theory Professor Peter Cramton Economics 300 Definition Game theory is the study of mathematical models of conflict and cooperation between intelligent and rational decision makers. Rational: each

More information

1 Motivation. Game Theory. 2 Linear Programming. Motivation. 4. Algorithms. Bernhard Nebel and Robert Mattmüller May 15th, 2017

1 Motivation. Game Theory. 2 Linear Programming. Motivation. 4. Algorithms. Bernhard Nebel and Robert Mattmüller May 15th, 2017 1 Game Theory 4. Algorithms Albert-Ludwigs-Universität Freiburg Bernhard Nebel and Robert Mattmüller May 15th, 2017 May 15th, 2017 B. Nebel, R. Mattmüller Game Theory 3 / 36 2 We know: In finite strategic

More information

For general queries, contact

For general queries, contact PART I INTRODUCTION LECTURE Noncooperative Games This lecture uses several examples to introduce the key principles of noncooperative game theory Elements of a Game Cooperative vs Noncooperative Games:

More information

Game Theory DR. ÖZGÜR GÜRERK UNIVERSITY OF ERFURT WINTER TERM 2012/13. Strict and nonstrict equilibria

Game Theory DR. ÖZGÜR GÜRERK UNIVERSITY OF ERFURT WINTER TERM 2012/13. Strict and nonstrict equilibria Game Theory 2. Strategic Games contd. DR. ÖZGÜR GÜRERK UNIVERSITY OF ERFURT WINTER TERM 2012/13 Strict and nonstrict equilibria In the examples we have seen so far: A unilaterally deviation from Nash equilibrium

More information

Coalitional solutions in differential games

Coalitional solutions in differential games 2012c12 $ Ê Æ Æ 116ò 14Ï Dec., 2012 Operations Research Transactions Vol.16 No.4 Coalitional solutions in differential games Leon A. Petrosyan 1 Abstract The two-stage level coalitional solution for n-person

More information

Outline for today. Stat155 Game Theory Lecture 17: Correlated equilibria and the price of anarchy. Correlated equilibrium. A driving example.

Outline for today. Stat155 Game Theory Lecture 17: Correlated equilibria and the price of anarchy. Correlated equilibrium. A driving example. Outline for today Stat55 Game Theory Lecture 7: Correlated equilibria and the price of anarchy Peter Bartlett s Example: October 5, 06 A driving example / 7 / 7 Payoff Go (-00,-00) (,-) (-,) (-,-) Nash

More information

A Price-Based Approach for Controlling Networked Distributed Energy Resources

A Price-Based Approach for Controlling Networked Distributed Energy Resources A Price-Based Approach for Controlling Networked Distributed Energy Resources Alejandro D. Domínguez-García (joint work with Bahman Gharesifard and Tamer Başar) Coordinated Science Laboratory Department

More information

Computational Game Theory Spring Semester, 2005/6. Lecturer: Yishay Mansour Scribe: Ilan Cohen, Natan Rubin, Ophir Bleiberg*

Computational Game Theory Spring Semester, 2005/6. Lecturer: Yishay Mansour Scribe: Ilan Cohen, Natan Rubin, Ophir Bleiberg* Computational Game Theory Spring Semester, 2005/6 Lecture 5: 2-Player Zero Sum Games Lecturer: Yishay Mansour Scribe: Ilan Cohen, Natan Rubin, Ophir Bleiberg* 1 5.1 2-Player Zero Sum Games In this lecture

More information

Games of Elimination

Games of Elimination Dmitry Ilinsky, Sergei Izmalkov, Alexei Savvateev September 2010 HSE Overview Competition The driving force in economies and economics. Overview Competition The driving force in economies and economics.

More information

Selecting Efficient Correlated Equilibria Through Distributed Learning. Jason R. Marden

Selecting Efficient Correlated Equilibria Through Distributed Learning. Jason R. Marden 1 Selecting Efficient Correlated Equilibria Through Distributed Learning Jason R. Marden Abstract A learning rule is completely uncoupled if each player s behavior is conditioned only on his own realized

More information

Game Theory Fall 2003

Game Theory Fall 2003 Game Theory Fall 2003 Problem Set 1 [1] In this problem (see FT Ex. 1.1) you are asked to play with arbitrary 2 2 games just to get used to the idea of equilibrium computation. Specifically, consider the

More information

Bayesian-Nash Equilibrium

Bayesian-Nash Equilibrium Bayesian-Nash Equilibrium A Bayesian game models uncertainty over types of opponents a player faces The game was defined in terms of players, their types, their available actions A player s beliefs about

More information

Title: The Castle on the Hill. Author: David K. Levine. Department of Economics UCLA. Los Angeles, CA phone/fax

Title: The Castle on the Hill. Author: David K. Levine. Department of Economics UCLA. Los Angeles, CA phone/fax Title: The Castle on the Hill Author: David K. Levine Department of Economics UCLA Los Angeles, CA 90095 phone/fax 310-825-3810 email dlevine@ucla.edu Proposed Running Head: Castle on the Hill Forthcoming:

More information

Lecture 1. Evolution of Market Concentration

Lecture 1. Evolution of Market Concentration Lecture 1 Evolution of Market Concentration Take a look at : Doraszelski and Pakes, A Framework for Applied Dynamic Analysis in IO, Handbook of I.O. Chapter. (see link at syllabus). Matt Shum s notes are

More information

6.254 : Game Theory with Engineering Applications Lecture 13: Extensive Form Games

6.254 : Game Theory with Engineering Applications Lecture 13: Extensive Form Games 6.254 : Game Theory with Engineering Lecture 13: Extensive Form Games Asu Ozdaglar MIT March 18, 2010 1 Introduction Outline Extensive Form Games with Perfect Information One-stage Deviation Principle

More information

REPEATED GAMES. Jörgen Weibull. April 13, 2010

REPEATED GAMES. Jörgen Weibull. April 13, 2010 REPEATED GAMES Jörgen Weibull April 13, 2010 Q1: Can repetition induce cooperation? Peace and war Oligopolistic collusion Cooperation in the tragedy of the commons Q2: Can a game be repeated? Game protocols

More information

EC3224 Autumn Lecture #03 Applications of Nash Equilibrium

EC3224 Autumn Lecture #03 Applications of Nash Equilibrium Reading EC3224 Autumn Lecture #03 Applications of Nash Equilibrium Osborne Chapter 3 By the end of this week you should be able to: apply Nash equilibrium to oligopoly games, voting games and other examples.

More information

Computation of Efficient Nash Equilibria for experimental economic games

Computation of Efficient Nash Equilibria for experimental economic games International Journal of Mathematics and Soft Computing Vol.5, No.2 (2015), 197-212. ISSN Print : 2249-3328 ISSN Online: 2319-5215 Computation of Efficient Nash Equilibria for experimental economic games

More information

Evolutionary Stochastic Games

Evolutionary Stochastic Games Noname manuscript No. (will be inserted by the editor) Evolutionary Stochastic Games János Flesch Thiruvenkatachari Parthasarathy Frank Thuijsman Philippe Uyttendaele Received: date / Accepted: date Abstract

More information

MS&E 246: Lecture 17 Network routing. Ramesh Johari

MS&E 246: Lecture 17 Network routing. Ramesh Johari MS&E 246: Lecture 17 Network routing Ramesh Johari Network routing Basic definitions Wardrop equilibrium Braess paradox Implications Network routing N users travel across a network Transportation Internet

More information

Weak Dominance and Never Best Responses

Weak Dominance and Never Best Responses Chapter 4 Weak Dominance and Never Best Responses Let us return now to our analysis of an arbitrary strategic game G := (S 1,...,S n, p 1,...,p n ). Let s i, s i be strategies of player i. We say that

More information

האוניברסיטה העברית בירושלים

האוניברסיטה העברית בירושלים האוניברסיטה העברית בירושלים THE HEBREW UNIVERSITY OF JERUSALEM TOWARDS A CHARACTERIZATION OF RATIONAL EXPECTATIONS by ITAI ARIELI Discussion Paper # 475 February 2008 מרכז לחקר הרציונליות CENTER FOR THE

More information

Notes on Blackwell s Comparison of Experiments Tilman Börgers, June 29, 2009

Notes on Blackwell s Comparison of Experiments Tilman Börgers, June 29, 2009 Notes on Blackwell s Comparison of Experiments Tilman Börgers, June 29, 2009 These notes are based on Chapter 12 of David Blackwell and M. A.Girshick, Theory of Games and Statistical Decisions, John Wiley

More information

BELIEFS & EVOLUTIONARY GAME THEORY

BELIEFS & EVOLUTIONARY GAME THEORY 1 / 32 BELIEFS & EVOLUTIONARY GAME THEORY Heinrich H. Nax hnax@ethz.ch & Bary S. R. Pradelski bpradelski@ethz.ch May 15, 217: Lecture 1 2 / 32 Plan Normal form games Equilibrium invariance Equilibrium

More information

Spring 2016 Network Science. Solution of Quiz I

Spring 2016 Network Science. Solution of Quiz I Spring 2016 Network Science Department of Electrical and Computer Engineering National Chiao Tung University Solution of Quiz I Problem Points Your Score 1 5 2 20 25 20 Total 100 Read all of the following

More information

EC319 Economic Theory and Its Applications, Part II: Lecture 7

EC319 Economic Theory and Its Applications, Part II: Lecture 7 EC319 Economic Theory and Its Applications, Part II: Lecture 7 Leonardo Felli NAB.2.14 27 February 2014 Signalling Games Consider the following Bayesian game: Set of players: N = {N, S, }, Nature N strategy

More information

Bounded Rationality, Strategy Simplification, and Equilibrium

Bounded Rationality, Strategy Simplification, and Equilibrium Bounded Rationality, Strategy Simplification, and Equilibrium UPV/EHU & Ikerbasque Donostia, Spain BCAM Workshop on Interactions, September 2014 Bounded Rationality Frequently raised criticism of game

More information

Belief-based Learning

Belief-based Learning Belief-based Learning Algorithmic Game Theory Marcello Restelli Lecture Outline Introdutcion to multi-agent learning Belief-based learning Cournot adjustment Fictitious play Bayesian learning Equilibrium

More information

Negotiation: Strategic Approach

Negotiation: Strategic Approach Negotiation: Strategic pproach (September 3, 007) How to divide a pie / find a compromise among several possible allocations? Wage negotiations Price negotiation between a seller and a buyer Bargaining

More information

Optimal Control Feedback Nash in The Scalar Infinite Non-cooperative Dynamic Game with Discount Factor

Optimal Control Feedback Nash in The Scalar Infinite Non-cooperative Dynamic Game with Discount Factor Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 4 (2016), pp. 3463-3468 Research India Publications http://www.ripublication.com/gjpam.htm Optimal Control Feedback Nash

More information

Lecture 6: April 25, 2006

Lecture 6: April 25, 2006 Computational Game Theory Spring Semester, 2005/06 Lecture 6: April 25, 2006 Lecturer: Yishay Mansour Scribe: Lior Gavish, Andrey Stolyarenko, Asaph Arnon Partially based on scribe by Nataly Sharkov and

More information

Game Theory, Evolutionary Dynamics, and Multi-Agent Learning. Prof. Nicola Gatti

Game Theory, Evolutionary Dynamics, and Multi-Agent Learning. Prof. Nicola Gatti Game Theory, Evolutionary Dynamics, and Multi-Agent Learning Prof. Nicola Gatti (nicola.gatti@polimi.it) Game theory Game theory: basics Normal form Players Actions Outcomes Utilities Strategies Solutions

More information

Finding Optimal Strategies for Influencing Social Networks in Two Player Games. MAJ Nick Howard, USMA Dr. Steve Kolitz, Draper Labs Itai Ashlagi, MIT

Finding Optimal Strategies for Influencing Social Networks in Two Player Games. MAJ Nick Howard, USMA Dr. Steve Kolitz, Draper Labs Itai Ashlagi, MIT Finding Optimal Strategies for Influencing Social Networks in Two Player Games MAJ Nick Howard, USMA Dr. Steve Kolitz, Draper Labs Itai Ashlagi, MIT Problem Statement Given constrained resources for influencing

More information

What kind of bonus point system makes the rugby teams more offensive?

What kind of bonus point system makes the rugby teams more offensive? What kind of bonus point system makes the rugby teams more offensive? XIV Congreso Dr. Antonio Monteiro - 2017 Motivation Rugby Union is a game in constant evolution Experimental law variations every year

More information

Global Dynamics in Repeated Games with Additively Separable Payoffs

Global Dynamics in Repeated Games with Additively Separable Payoffs Global Dynamics in Repeated Games with Additively Separable Payoffs Takashi Kamihigashi and Taiji Furusawa June 8, 200 Abstract This paper studies the global dynamics of a class of infinitely repeated

More information

Ü B U N G S A U F G A B E N. S p i e l t h e o r i e

Ü B U N G S A U F G A B E N. S p i e l t h e o r i e T E C H N I S C H E U N I V E R S I T Ä T D R E S D E N F A K U L T Ä T E L E K T R O T E C H N I K U N D I N F O R M A T I O N S T E C H N I K Ü B U N G S A U F G A B E N S p i e l t h e o r i e by Alessio

More information

Game Theory and its Applications to Networks - Part I: Strict Competition

Game Theory and its Applications to Networks - Part I: Strict Competition Game Theory and its Applications to Networks - Part I: Strict Competition Corinne Touati Master ENS Lyon, Fall 200 What is Game Theory and what is it for? Definition (Roger Myerson, Game Theory, Analysis

More information

Game Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems

Game Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems Game Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems March 17, 2011 Summary: The ultimate goal of this lecture is to finally prove Nash s theorem. First, we introduce and prove Sperner s

More information

Game Theory Review Questions

Game Theory Review Questions Game Theory Review Questions Sérgio O. Parreiras All Rights Reserved 2014 0.1 Repeated Games What is the difference between a sequence of actions and a strategy in a twicerepeated game? Express a strategy

More information

Game interactions and dynamics on networked populations

Game interactions and dynamics on networked populations Game interactions and dynamics on networked populations Chiara Mocenni & Dario Madeo Department of Information Engineering and Mathematics University of Siena (Italy) ({mocenni, madeo}@dii.unisi.it) Siena,

More information

On Equilibria of Distributed Message-Passing Games

On Equilibria of Distributed Message-Passing Games On Equilibria of Distributed Message-Passing Games Concetta Pilotto and K. Mani Chandy California Institute of Technology, Computer Science Department 1200 E. California Blvd. MC 256-80 Pasadena, US {pilotto,mani}@cs.caltech.edu

More information

Random Extensive Form Games and its Application to Bargaining

Random Extensive Form Games and its Application to Bargaining Random Extensive Form Games and its Application to Bargaining arxiv:1509.02337v1 [cs.gt] 8 Sep 2015 Itai Arieli, Yakov Babichenko October 9, 2018 Abstract We consider two-player random extensive form games

More information

Game Theory and Control

Game Theory and Control Game Theory and Control Lecture 4: Potential games Saverio Bolognani, Ashish Hota, Maryam Kamgarpour Automatic Control Laboratory ETH Zürich 1 / 40 Course Outline 1 Introduction 22.02 Lecture 1: Introduction

More information

Monotonic ɛ-equilibria in strongly symmetric games

Monotonic ɛ-equilibria in strongly symmetric games Monotonic ɛ-equilibria in strongly symmetric games Shiran Rachmilevitch April 22, 2016 Abstract ɛ-equilibrium allows for worse actions to be played with higher probability than better actions. I introduce

More information

Equilibria in Games with Weak Payoff Externalities

Equilibria in Games with Weak Payoff Externalities NUPRI Working Paper 2016-03 Equilibria in Games with Weak Payoff Externalities Takuya Iimura, Toshimasa Maruta, and Takahiro Watanabe October, 2016 Nihon University Population Research Institute http://www.nihon-u.ac.jp/research/institute/population/nupri/en/publications.html

More information

SF2972 Game Theory Exam with Solutions March 15, 2013

SF2972 Game Theory Exam with Solutions March 15, 2013 SF2972 Game Theory Exam with s March 5, 203 Part A Classical Game Theory Jörgen Weibull and Mark Voorneveld. (a) What are N, S and u in the definition of a finite normal-form (or, equivalently, strategic-form)

More information

Game Theory and Algorithms Lecture 2: Nash Equilibria and Examples

Game Theory and Algorithms Lecture 2: Nash Equilibria and Examples Game Theory and Algorithms Lecture 2: Nash Equilibria and Examples February 24, 2011 Summary: We introduce the Nash Equilibrium: an outcome (action profile) which is stable in the sense that no player

More information

Convex Sets Strict Separation. in the Minimax Theorem

Convex Sets Strict Separation. in the Minimax Theorem Applied Mathematical Sciences, Vol. 8, 2014, no. 36, 1781-1787 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.4271 Convex Sets Strict Separation in the Minimax Theorem M. A. M. Ferreira

More information

Introduction to Game Theory

Introduction to Game Theory COMP323 Introduction to Computational Game Theory Introduction to Game Theory Paul G. Spirakis Department of Computer Science University of Liverpool Paul G. Spirakis (U. Liverpool) Introduction to Game

More information

A Few Games and Geometric Insights

A Few Games and Geometric Insights A Few Games and Geometric Insights Brian Powers Arizona State University brpowers@asu.edu January 20, 2017 1 / 56 Outline 1 Nash/Correlated Equilibria A Motivating Example The Nash Equilibrium Correlated

More information

Advertising and Promotion in a Marketing Channel

Advertising and Promotion in a Marketing Channel Applied Mathematical Sciences, Vol. 13, 2019, no. 9, 405-413 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2019.9240 Advertising and Promotion in a Marketing Channel Alessandra Buratto Dipartimento

More information

arxiv: v1 [math.oc] 7 Dec 2018

arxiv: v1 [math.oc] 7 Dec 2018 arxiv:1812.02878v1 [math.oc] 7 Dec 2018 Solving Non-Convex Non-Concave Min-Max Games Under Polyak- Lojasiewicz Condition Maziar Sanjabi, Meisam Razaviyayn, Jason D. Lee University of Southern California

More information

CS 573: Algorithmic Game Theory Lecture date: January 23rd, 2008

CS 573: Algorithmic Game Theory Lecture date: January 23rd, 2008 CS 573: Algorithmic Game Theory Lecture date: January 23rd, 2008 Instructor: Chandra Chekuri Scribe: Bolin Ding Contents 1 2-Player Zero-Sum Game 1 1.1 Min-Max Theorem for 2-Player Zero-Sum Game....................

More information

Brown s Original Fictitious Play

Brown s Original Fictitious Play manuscript No. Brown s Original Fictitious Play Ulrich Berger Vienna University of Economics, Department VW5 Augasse 2-6, A-1090 Vienna, Austria e-mail: ulrich.berger@wu-wien.ac.at March 2005 Abstract

More information

Extinction in common property resource models: an analytically tractable example

Extinction in common property resource models: an analytically tractable example Extinction in common property resource models: an analytically tractable example Tapan MITRA Department of Economics, 448 Uris Hall, Cornell University Ithaca NY 14853, USA tm19@cornell.edu Gerhard SORGER

More information

Evolutionary Game Theory

Evolutionary Game Theory Evolutionary Game Theory ISI 330 Lecture 18 1 ISI 330 Lecture 18 Outline A bit about historical origins of Evolutionary Game Theory Main (competing) theories about how cooperation evolves P and other social

More information

Econ 618: Correlated Equilibrium

Econ 618: Correlated Equilibrium Econ 618: Correlated Equilibrium Sunanda Roy 1 Basic Concept of a Correlated Equilibrium MSNE assumes players use a random device privately and independently, that tells them which strategy to choose for

More information

CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria

CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria Tim Roughgarden November 4, 2013 Last lecture we proved that every pure Nash equilibrium of an atomic selfish routing

More information

Games with Perfect Information

Games with Perfect Information Games with Perfect Information Yiling Chen September 7, 2011 Non-Cooperative Game Theory What is it? Mathematical study of interactions between rational and self-interested agents. Non-Cooperative Focus

More information

MS&E 246: Lecture 12 Static games of incomplete information. Ramesh Johari

MS&E 246: Lecture 12 Static games of incomplete information. Ramesh Johari MS&E 246: Lecture 12 Static games of incomplete information Ramesh Johari Incomplete information Complete information means the entire structure of the game is common knowledge Incomplete information means

More information

Introduction to game theory LECTURE 1

Introduction to game theory LECTURE 1 Introduction to game theory LECTURE 1 Jörgen Weibull January 27, 2010 1 What is game theory? A mathematically formalized theory of strategic interaction between countries at war and peace, in federations

More information