Nash Equilibrium - definition A mixed-strategy profile σ * is a Nash equilibrium (NE) if for every player i we have u i (σ * i, σ * -i ) ≥ u i (s i, σ.

Slides:



Advertisements
Similar presentations
Mixed Strategies.
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.
Basics on Game Theory Class 2 Microeconomics. Introduction Why, What, What for Why Any human activity has some competition Human activities involve actors,
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Mixed Strategies CMPT 882 Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Simultaneous- Move Games with Mixed Strategies Zero-sum Games.
Bayesian Games Yasuhiro Kirihata University of Illinois at Chicago.
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
For any player i, a strategy weakly dominates another strategy if (With at least one S -i that gives a strict inequality) strictly dominates if where.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Upper hemi-continuity Best-response correspondences have to be upper hemi-continuous for Kakutani’s fixed-point theorem to work Upper hemi-continuity.
Nash Equilibria In Graphical Games On Trees Edith Elkind Leslie Ann Goldberg Paul Goldberg.
Non-cooperative Games Elon Kohlberg February 2, 2015.
Repeated games with Costly Observations Eilon Solan, Tel Aviv University Ehud Lehrer Tel Aviv University with.
Algorithms and Economics of Networks Abraham Flaxman and Vahab Mirrokni, Microsoft Research.
Network Theory and Dynamic Systems Game Theory: Mixed Strategies
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Extensive-form games. Extensive-form games with perfect information Player 1 Player 2 Player 1 2, 45, 33, 2 1, 00, 5 Players do not move simultaneously.
Equilibrium Concepts in Two Player Games Kevin Byrnes Department of Applied Mathematics & Statistics.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
by Vincent Conitzer of Duke
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
Basics on Game Theory For Industrial Economics (According to Shy’s Plan)
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Static Games of Complete Information: Equilibrium Concepts
Game theory The study of multiperson decisions Four types of games
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/19 3/12.
Learning in Games. Fictitious Play Notation! For n Players we have: n Finite Player’s Strategies Spaces S 1, S 2, …, S n n Opponent’s Strategies Spaces.
Game Theory Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents. Been used to study –Market.
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.
Game Theoretic Analysis of Oligopoly lr L R 0000 L R 1 22 The Lane Selection Game Rational Play is indicated by the black arrows.
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 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.
Minimax strategies, Nash equilibria, correlated equilibria Vincent Conitzer
EC941 - Game Theory Prof. Francesco Squintani Lecture 2 1.
Presenter: Jen Hua Chi Adviser: Yeong Sung Lin Network Games with Many Attackers and Defenders.
Extensive-form games Vincent Conitzer
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 and Strategic Thinking: An Introduction 杨冠琼 北京师范大学公共部门绩效 测评研究中心 北京师范大学管理学院 博弈论与策略性思 维导论.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
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.
Dominance Since Player I is maximizing her security level, she prefers “large” payoffs. If one row is smaller (element- wise) than another,
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
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.
P2 P1 Confess No (-1,-1) Confess (-5,0)No (0,-5)(-3,-3) TABLE 1 Battle of Sexes and Prisoner’s Dilemma Prisoner’s Dilemma Husband Wife Basket- ball Opera.
Mixed Strategies and Repeated Games
Game theory 2 Lukáš Lehotský
Static Games of Complete Information.. Games and best responses Bob is a florist One bunch of flowers sells for $10, but to sell 100 bunches market price.
5.1.Static Games of Incomplete Information
1 The Volunteer’s Dilemma (Mixed Strategies). 2 The Volunteer Dilemma Game Simultaneously and independently, players have to decide if they wish to volunteer.
Extensive Form (Dynamic) Games With Perfect Information (Theory)
9.2 Mixed Strategy Games In this section, we look at non-strictly determined games. For these type of games the payoff matrix has no saddle points.
Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.
Chapter 28 Game Theory.
LECTURE 2 MIXED STRATEGY GAME
Chapter 30 Game Applications.
Multiagent Systems Repeated Games © Manfred Huber 2018.
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Lecture Game Theory.
Normal Form (Matrix) Games
Presentation transcript:

Nash Equilibrium - definition A mixed-strategy profile σ * is a Nash equilibrium (NE) if for every player i we have u i (σ * i, σ * -i ) ≥ u i (s i, σ * -i ) for all s i  S i NE is such set of strategies, that no player is willing to deviate to any other pure strategy. In other words, the strategies are multilateral best responses

Nash Equilibrium -examples In the Ad game, NE is a pair of pure strategies (A, A) Player 2 AN Player 1 A40, 4060, 30 N30, 6050, 50

Nash Equilibrium -examples In the game below, (M, R) is NE Player 2 LR U3, 10, 2 Player 1M0, 03, 1 D1, 21, 1

Nash Equilibrium -examples „Matching pennies” does not have a pure- strategy NE Let p denote the prob. of Heads for player 1, q – the prob. of Heads for player 2 Pl. 2 HeadsTails Pl. 1Heads1, -1-1, 1 Tails-1, 11, -1

NE in mixed strategies The BR i are the best-response correspondences p q ½ ½ BR 1 BR 2

An Easy Trick Drawing best response correspondences is fun, but time consuming. Instead, we can use the following fact: If player i mixes between two or more pure strategies in NE, then in equilibrium she must be indifferent between all these pure strategies Hence, if we want to find a mixed-strategy NE, we must find the probability distribution, which will make player i indifferent between the pure strategies

Battle of Sexes Find all NE in the game below Wife FootballBallet Husband Football2, 30, 0 Ballet1, 13, 2

Existence of Nash Equilibrium Nash Theorem: Every finite normal form game has a mixed-strategy equilibrium Proof (heuristic): Let r i (σ -i ) denote the best- response correspondence for player i. Let r(σ) : ∑ →∑ denote the Cartesian product of r i ’s. Then notice that r(σ) is nonempty and convex for all σ and has a closed graph (is upper hemi- continuous). Then refer to Kakutani’s fixed-point theorem and state that r(σ) has a fixed point, where σ *  r(σ * ), which is a NE.

Other Existence Theorems Debreu-Glicksberg-Fan Theorem: Consider a normal-form game where all S i are compact convex subsets of Euclidean space. If the payoff functions u i are continuous in s and quasi- concave in s i then there exists a pure-strategy NE. Glicksberg Theorem: Consider a normal-form game where all S i are compact subsets of metric space. If the payoff functions u i are continuous then there exists a mixed-strategy NE.

Non-Uniqueness of NE The bigger problem is that there are often many NE. We can use „refinements” of the equilibrium to find a more concrete solution: Focal Point Pareto Perfection

(B,F) Pareto dominates (D,E) Player 2 Player 1 EFGH A2, 22, 61, 40, 4 B0, 010, 102, 11, 1 C7, 02, 21, 55, 1 D9, 51, 30, 24, 4

Focal Point Which NE is the focal point? Player 2 Player 1 EFGH A100, 1002, 61, 40, 4 B0, 0100, 1002, 11, 1 C7, 02, 299, 995, 1 D9, 51, 30, 2100, 100

Correlated Equilibria Look at the Battle of Sexes. Do you think that the mixed-strategy equilibrium would be played? Not if players can communicate before the play.Then they can avoid the bad outcomes. They can allow Nature (a commonly observed random event) to decide which equilibrium they will play. Their expected payoffs may be bigger than in the mixed- strategy NE. Interestingly, if the players can observe imperfectly correlated signals, they can sometimes achieve expected payoff larger than in any NE.