Concepts of Game Theory II. 2 The prisioners reasoning… Put yourself in the place of prisoner i (or j)… Reason as follows: –Suppose I cooperate… If j.

Slides:



Advertisements
Similar presentations
Concepts of Game Theory I
Advertisements

The Basics of Game Theory
Chapter 17: Making Complex Decisions April 1, 2004.
Game Theory Lecture 4 Game Theory Lecture 4.
Reaching Agreements II. 2 What utility does a deal give an agent? Given encounter  T 1,T 2  in task domain  T,{1,2},c  We define the utility of a.
Introduction to Game Theory Networked Life CSE 112 Spring 2005 Prof. Michael Kearns.
Infinitely Repeated Games
Crime, Punishment, and Forgiveness
Multiagent Interactions
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
Game Theory “Доверяй, Но Проверяй” - Russian Proverb (Trust, but Verify) - Ronald Reagan Mike Shor Lecture 6.
Game Theory “Доверяй, Но Проверяй” (“Trust, but Verify”) - Russian Proverb (Ronald Reagan) Topic 5 Repeated Games.
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.
6-1 LECTURE 6: MULTIAGENT INTERACTIONS An Introduction to MultiAgent Systems
An Introduction to... Evolutionary Game Theory
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. Games Oligopolist Play ▫Each oligopolist realizes both that its profit depends on what its competitor does and that its competitor’s profit.
Game Theory Game theory is an attempt to model the way decisions are made in competitive situations. It has obvious applications in economics. But it.
Coye Cheshire & Andrew Fiore March 21, 2012 // Computer-Mediated Communication Collective Action and CMC: Game Theory Approaches and Applications.
Multi-player, non-zero-sum games
Prisoner’s dilemma TEMPTATION>REWARD>PUNISHMENT>SUCKER.
An Introduction to Game Theory Part I: Strategic Games
Slide 1 of 13 So... What’s Game Theory? Game theory refers to a branch of applied math that deals with the strategic interactions between various ‘agents’,
Arguments for Recovering Cooperation Conclusions that some have drawn from analysis of prisoner’s dilemma: – the game theory notion of rational action.
Story time! Robert Axelrod. Contest #1 Call for entries to game theorists All entrants told of preliminary experiments 15 strategies = 14 entries + 1.
A Memetic Framework for Describing and Simulating Spatial Prisoner’s Dilemma with Coalition Formation Sneak Review by Udara Weerakoon.
Game Theory: Key Concepts Zero Sum Games Zero Sum Games Non – Zero Sum Games Non – Zero Sum Games Strategic Form Games  Lay out strategies Strategic Form.
Arguments for Recovering Cooperation Conclusions that some have drawn from analysis of prisoner’s dilemma: the game theory notion of rational action is.
Cooperation and ESSs Putting Humpty together again.
APEC 8205: Applied Game Theory Fall 2007
Design of Multi-Agent Systems Teacher Bart Verheij Student assistants Albert Hankel Elske van der Vaart Web site
Coye Cheshire & Andrew Fiore June 28, 2015 // Computer-Mediated Communication Game Theory, Games, and CMC.
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
DANSS Colloquium By Prof. Danny Dolev Presented by Rica Gonen
A Game-Theoretic Approach to Strategic Behavior. Chapter Outline ©2015 McGraw-Hill Education. All Rights Reserved. 2 The Prisoner’s Dilemma: An Introduction.
Punishment and Forgiveness in Repeated Games. A review of present values.
Agenda, Day 2  Questions about syllabus? About myths?  Prisoner’s dilemma  Prisoner’s dilemma vs negotiation  Play a single round  Play multiple rounds.
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.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Finite Iterated Prisoner’s Dilemma Revisited: Belief Change and End Game Effect Jiawei Li (Michael) & Graham Kendall University of Nottingham.
LECTURE 6: MULTIAGENT INTERACTIONS
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.
Evolving cooperation in one-time interactions with strangers Tags produce cooperation in the single round prisoner’s dilemma and it’s.
KRUGMAN'S MICROECONOMICS for AP* Game Theory Margaret Ray and David Anderson Micro: Econ: Module.
Section 2 – Ec1818 Jeremy Barofsky
Mixed Strategies and Repeated Games
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.
Robert Axelrod’s Tournaments Robert Axelrod’s Tournaments, as reported in Axelrod, Robert. 1980a. “Effective Choice in the Prisoner’s Dilemma.” Journal.
Game Theory by James Crissey Luis Mendez James Reid.
Mohsen Afsharchi Multiagent Interaction. What are Multiagent Systems?
1 Computer Science Department California Polytechnic State University San Luis Obispo, CA, U.S.A. Franz J. Kurfess CPE/CSC 580: Intelligent Agents 1.
Evolving Strategies for the Prisoner’s Dilemma Jennifer Golbeck University of Maryland, College Park Department of Computer Science July 23, 2002.
The Prisoner’s Dilemma or Life With My Brother and Sister John CT.
Arguments for Recovering Cooperation Conclusions that some have drawn from analysis of prisoner’s dilemma: – the game theory notion of rational action.
LECTURE 6: MULTIAGENT INTERACTIONS
Game Theory and Cooperation
PRISONER’S DILEMMA BERK EROL
tit-for-tat algorithm
Decision Theory and Game Theory
Computer-Mediated Communication
Learning 6.2 Game Theory.
LECTURE 6: MULTIAGENT INTERACTIONS
Chapter 29 Game Theory Key Concept: Nash equilibrium and Subgame Perfect Nash equilibrium (SPNE)
Game Theory Fall Mike Shor Topic 5.
Chapter 14 & 15 Repeated Games.
Game Theory Spring Mike Shor Topic 5.
Presentation transcript:

Concepts of Game Theory II

2 The prisioners reasoning… Put yourself in the place of prisoner i (or j)… Reason as follows: –Suppose I cooperate… If j cooperates, we both get a payoff of 3. If j defects, then I will get a payoff of 0. Best payoff I can be guaranteed to get if I cooperate is 0. –Suppose I defect… If j cooperates, I get a payoff of 5. If j defects, then I will get a payoff of 2. Best payoff I can be guaranteed to get if I defect is 2. In summary: –If I cooperate the worst case is that I will get a payoff of 0 –If I defect the worst case is that I will get a payoff of 2 –Id prefer a guaranteed payoff of 2 to a payoff of 0! DefectCoop Defect Coop i j

3 Features of Prisoners Dilemma (1) The individual rational action is defect –This guarantees a pay-off of no worse than 2 –Whereas cooperating guarantees a pay-off of at most 1. So, defection is the best response to all possible strategies: –Both agents defect and get a pay-off of 2 But naïve intuition says this is not the best outcome: –They could both cooperate and each get a pay-off of 3!

4 Features of Prisoners Dilemma (2) This apparent paradox is the fundamental problem of multi-agent interactions. –It seems to imply that cooperation will not occur in societies of self-interested agents. A real world example: nuclear arms reduction The prisoners dilemma is ubiquitous (very common!) Can we recover cooperation?

5 Arguments for Recovering Cooperation Some conclusions that have been drawn from this analysis: –The game theory notion of rational action is wrong! –Somehow the dilemma is being formulated incorrectly. Arguments to recover cooperation: –We are not all Machiavellian! –The other prisoner is my twin! –People are not (always) rational! –The shadow of the future…

6 The Iterated Prisoners Dilemma One answer: play the game more than once –Lets use an applet: If you know you will be meeting your opponent again –Then the incentive to defect appears to evaporate. Cooperation is the rational choice in the infinitely repeated prisoners dilemma

7 Backwards Induction Suppose you both know that you will play the game exactly n times On round n, you have an incentive to defect to gain that extra bit of pay-off. This makes round n-1 the last real game, and so you have an incentive to defect there too –And so on… When playing the prisoners dilemma with a –fixed –finite –pre-determined and –commonly known number of rounds, defection is the best strategy.

8 Axelrods Tournament Suppose you play the prisoners dilemma game against a range of opponents. What single strategy should you use to play against all these opponents so that you maximise your overall pay- off? Axelrod (1984) investigated this problem with a tournament for computer programs playing the prisoners dilemma. Robert Axelrod

9 Strategies ALL-D –Always defect the hawk strategy. TIT-FOR-TAT –On round u=0, cooperate –On round u>0, copy the opponents round u-1 move TESTER –On round u=0, defect. –If the opponent retaliated, then play TIT-FOR-TAT –Otherwise intersperse cooperation and defection JOSS –As for TIT-FOR-TAT, except periodically defect

10 How to succeed in Axelrods Tournament Axelrod suggests the following: Dont be envious –Dont play as if it were a zero sum game –You dont have to beat your opponent for you to do well Be nice (dont be the first to defect) –Start by cooperating, and reciprocate cooperation Retaliate appropriately –Always punish defection immediately, –But use measured force dont overdo it Dont hold grudges –Always reciprocate cooperation immediately

11 Who wins? In the 1980s tournament, TIT-FOR-TAT won. But, when paired with a mindless strategy like RANDOM, TIT-FOR-TAT sinks to its opponent's level. So, it cant be seen as a best strategy. The tournament was run again in 2004, and TIT-FOR-TAT did not win. What strategy won, and why?

12 Game of Chicken Difference to prisoners dilemma: –Mutual defection is the most feared outcome. Strategies (C,D ) and (D,C ) in Nash equilibrium. i j DefectCoop Defect Coop

13 The Stag Hunt (1) You can hunt deer (cooperate) or hare (defect) Only if both cooperate will they succeed in catching the deer and receive the maximum pay-off. i j DefectCoop Defect Coop

14 The Stag Hunt (2) A pessimist would always hunt hare. A cautious player who is uncertain about what the other player will choose to do would also hunt hare. For agents to cooperate in the Stag Hunt, there must be a measure of trust between them. This measure of trust is a kind of social contract between the players; a contract that requires prior agreement.

15 A Variation of the Prisoners Dilemma A spatial variant of the iterated prisoner's dilemma A model for cooperation vs. conflict in groups It shows spread of –altruism –exploitation for personal gain in an interacting population of agents learning from each other –Initially population consists of cooperators and a certain amount of defectors –Advantage of defection is determined by value of b in the 'payoff matrix' –A player determines its new strategy by selecting the most favourable strategy from itself and its direct neighbours

16 Variation of the Prisoners Dilemma Applet:

17 An Introduction to Multi-Agent Systems, M. Wooldridge, John Wiley & Sons, Chapter 6. Also check: Various applets for the prisoners dilemma: Spatial variant of the iterated prisoners dilemma: Software for Axelrods Tournament: Recommended Reading