Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.

Slides:



Advertisements
Similar presentations
Introduction to Game Theory
Advertisements

NON - zero sum games.
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.
Game Theory S-1.
15 THEORY OF GAMES CHAPTER.
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.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
1 Chapter 4: Minimax Equilibrium in Zero Sum Game SCIT1003 Chapter 4: Minimax Equilibrium in Zero Sum Game Prof. Tsang.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
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)
© 2015 McGraw-Hill Education. All rights reserved. Chapter 15 Game Theory.
Game Theory. “If you don’t think the math matters, then you don’t know the right math.” Chris Ferguson 2002 World Series of Poker Champion.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up)
Network Theory and Dynamic Systems Game Theory: Mixed Strategies
Short introduction to game theory 1. 2  Decision Theory = Probability theory + Utility Theory (deals with chance) (deals with outcomes)  Fundamental.
A Introduction to Game Theory Xiuting Tao. Outline  1 st a brief introduction of Game theory  2 nd Strategic games  3 rd Extensive games.
An Introduction to Game Theory Part I: Strategic Games
Game Theory Part 5: Nash’s Theorem.
2008/02/06Lecture 21 ECO290E: Game Theory Lecture 2 Static Games and Nash Equilibrium.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
5/16/20151 Game Theory Game theory was developed by John Von Neumann and Oscar Morgenstern in Economists! One of the fundamental principles of.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
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.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Review: Game theory Dominant strategy Nash equilibrium
An Introduction to Game Theory Part III: Strictly Competitive Games Bernhard Nebel.
Chapter 6 Extensive Games, perfect info
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.
Introduction to Game Theory Yale Braunstein Spring 2007.
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.
Introduction to Game Theory and its Applications in Computer Networks
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Game Theory.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Game Theory.
CPS 170: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
Game Theory.
Performance Evaluation of Networks, part II Giovanni Neglia G. Neglia10 December 2012.
Chapter 12 & Module E Decision Theory & Game Theory.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Two-person non zero-sum.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
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.
Chapter 11 Game Theory Math Game Theory What is it? – a way to model conflict and competition – one or more "players" make simultaneous decisions.
THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Introduction Giovanni Neglia.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
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. 2 You should know by now… u The security level of a strategy for a player is the minimum payoff regardless of what strategy his opponent uses. u A.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Introduction Giovanni Neglia.
Lecture 3: two-person non zero-sum games
INDEX Introduction of game theory Introduction of game theory Significance of game theory Significance of game theory Essential features of game theory.
By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.
Day 9 GAME THEORY. 3 Solution Methods for Non-Zero Sum Games Dominant Strategy Iterated Dominant Strategy Nash Equilibrium NON- ZERO SUM GAMES HOW TO.
Games, Strategies, and Decision Making By Joseph Harrington, Jr. First Edition Chapter 4: Stable Play: Nash Equilibria in Discrete Games with Two or Three.
Competitive Safety Analysis: Robust Decision-Making in Multi- Agent Systems Moshe Tennenholtz Kyle Rokos.
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.
Microeconomics Course E
Introduction to Game Theory
Introduction to Game Theory
Introduction to Game Theory
Multiagent Systems Game Theory © Manfred Huber 2018.
Presentation transcript:

Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non zero-sum games (part A) Giovanni Neglia INRIA – EPI Maestro 14 December 2009 Slides are based on a previous course with D. Figueiredo (UFRJ) and H. Zhang (Suffolk University)

Outline r Two-person zero-sum games m Matrix games Pure strategy equilibria (dominance and saddle points), ch 2 Mixed strategy equilibria, ch 3 m Game trees, ch 7 m About utility, ch 9 r Two-person non-zero-sum games m Nash equilibria… …And its limits (equivalence, interchangeability, Prisoner’s dilemma), ch. 11 and 12 m Strategic games, ch. 14 m Subgame Perfect Nash Equilibria (not in the book) m Repeated Games, partially in ch. 12 m Evolutionary games, ch. 15 r N-persons games

References r Main one: m Straffin, Game Theory and Strategy, The mathematical association of America r Subjects not covered by Straffin: m Osborne and Rubinstein, A course in game theory, MIT Press

Two-person Non-zero Sum Games r Players are not strictly opposed m payoff sum is non-zero AB A3, 42, 0 B5, 1-1, 2 Player 1 Player 2 r Situations where interest is not directly opposed m players could cooperate m communication may play an important role for the moment assume no communication is possible

What do we keep from zero-sum games? r Dominance r Movement diagram m pay attention to which payoffs have to be considered to decide movements r Enough to determine pure strategies equilibria m but still there are some differences (see after) AB A5, 42, 0 B3, 1-1, 2 Player 1 Player 2

What can we keep from zero-sum games? r As in zero-sum games, pure strategies equilibria do not always exist… r …but we can find mixed strategies equilibria AB A5, 0-1, 4 B3, 22, 1 Player 1 Player 2

Mixed strategies equilibria r Same idea of equilibrium m each player plays a mixed strategy (equalizing strategy), that equalizes the opponent payoffs m how to calculate it? AB A5, 0-1, 4 B3, 22, 1 Rose Colin

Mixed strategies equilibria r Same idea of equilibrium m each player plays a mixed strategy, that equalizes the opponent payoffs m how to calculate it? AB A-0-4 B-2 Rose Colin Rose considers Colin’s game 4 1 1/5 4/5

Mixed strategies equilibria r Same idea of equilibrium m each player plays a mixed strategy, that equalizes the opponent payoffs m how to calculate it? AB A5 B32 Rose Colin Colin considers Rose’s game 3/5 2/5

Mixed strategies equilibria r Same idea of equilibrium m each player plays a mixed strategy, that equalizes the opponent payoffs m how to calculate it? AB A5, 0-1, 4 B3, 22, 1 Rose Colin Rose playing (1/5,4/5) Colin playing (3/5,2/5) is an equilibrium Rose gains 13/5 Colin gains 8/5

Good news: Nash’s theorem [1950] r Every two-person games has at least one equilibrium either in pure strategies or in mixed strategies m Proved using fixed point theorem m generalized to N person game r This equilibrium concept called Nash equilibrium in his honor m A vector of strategies (a profile) is a Nash Equilibrium (NE) if no player can unilaterally change its strategy and increase its payoff

An useful property r Given a finite game, a profile is a mixed NE of the game if and only if for every player i, every pure strategy used by i with non-null probability is a best response to other players mixed strategies in the profile m see Osborne and Rubinstein, A course in game theory, Lemma 33.2

Bad news: what do we lose? r equivalence r interchangeability r identity of equalizing strategies with prudential strategies r main cause m at equilibrium every player is considering the opponent’s payoffs ignoring its payoffs. r New problematic aspect m group rationality versus individual rationality (cooperation versus competition) m absent in zero-sum games  we lose the idea of the solution

Game of Chicken 2 2 r Game of Chicken (aka. Hawk-Dove Game) m driver who swerves looses swervestay swerve0, 0-1, 5 stay5, -1-10, -10 Driver 1 Driver 2 Drivers want to do opposite of one another Two equilibria: not equivalent not interchangeable! playing an equilibrium strategy does not lead to equilibrium

Prudential strategies r Each player tries to minimize its maximum loss (then it plays in its own game) AB A5, 0-1, 4 B3, 22, 1 Rose Colin

Prudential strategies r Rose assumes that Colin would like to minimize her gain r Rose plays in Rose’s game r Saddle point in BB r B is Rose’s prudential strategy and guarantees to Rose at least 2 (Rose’s security level) AB A5 B32 Rose Colin

Prudential strategies r Colin assumes that Rose would like to minimize his gain (maximize his loss) r Colin plays in Colin’s game r mixed strategy equilibrium, r (3/5,2/5) is Colin’s prudential strategy and guarantees Colin a gain not smaller than 8/5 AB A0-4 B-2 Rose Colin

Prudential strategies r Prudential strategies m Rose plays B, Colin plays A w. prob. 3/5, B w. 2/5 m Rose gains 13/5 (>2), Colin gains 8/5 r Is it stable? m No, if Colin thinks that Rose plays B, he would be better off by playing A (Colin’s counter-prudential strategy) AB A5, 0-1, 4 B3, 22, 1 Rose Colin

Prudential strategies r are not the solution neither: m do not lead to equilibria m do not solve the group rationality versus individual rationality conflict r dual basic problem: m look at your payoff, ignoring the payoffs of the opponents

The Prisoner’s Dilemma r One of the most studied and used games m proposed in 1950 r Two suspects arrested for joint crime m each suspect when interrogated separately, has option to confess NCC 2, 210, 1 C1, 105, 5 Suspect 1 Suspect 2 payoff is years in jail (smaller is better) single NE better outcome

Pareto Optimal NCC 2, 210, 1 C1, 105, 5 Suspect 1 Suspect 2 r Def: outcome o* is Pareto Optimal if no other outcome would give to all the players a payoff not smaller and a payoff higher to at least one of them r Pareto Principle: to be acceptable as a solution of a game, an outcome should be Pareto Optimal o the NE of the Prisoner’s dilemma is not! r Conflict between group rationality (Pareto principle) and individual rationality (dominance principle) Pareto Optimal

Payoff polygon r All the points in the convex hull of the pure strategy payoffs correspond to payoffs obtainable by mixed strategies r The north-east boundary contains the Pareto optimal points AB A5, 0-1, 4 B3, 22, 1 Rose Colin A,A B,A A,B B,B NE Rose’s payoff Colin’s payoff

Exercises r Find NE and Pareto optimal outcomes: NCC 2, 210, 1 C1, 105, 5 AB A2, 33, 2 B1, 00, 1 swervestay swerve0, 0-1, 5 stay5, -1-10, -10 AB A2, 41, 0 B3, 10, 4