Game Theory, Continued: From Zero-Sum to Non-Zero-Sum. Problem Set 3 due on FRIDAY!

Similar documents
Game Theory: From Zero-Sum to Non-Zero-Sum. CSCI 3202, Fall 2010

Repeated games. Felix Munoz-Garcia. Strategy and Game Theory - Washington State University

ECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns

The book goes through a lot of this stuff in a more technical sense. I ll try to be plain and clear about it.

CMU-Q Lecture 20:

Two-Person General-Sum Games GAME THEORY II. A two-person general sum game is represented by two matrices and. For instance: If:

Machine Learning in Iterated Prisoner s Dilemma using Evolutionary Algorithms

The Success of TIT FOR TAT in Computer Tournaments

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro

Game theory. Logic and Decision Making Unit 2

ECON 282 Final Practice Problems

FIRST PART: (Nash) Equilibria

LECTURE 26: GAME THEORY 1

Mixed Strategies; Maxmin

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides

BS2243 Lecture 3 Strategy and game theory

Japanese. Sail North. Search Search Search Search

Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016

Robustness against Longer Memory Strategies in Evolutionary Games.

Repeated Games. ISCI 330 Lecture 16. March 13, Repeated Games ISCI 330 Lecture 16, Slide 1

Multiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence

Section Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies.

Chapter 3 Learning in Two-Player Matrix Games

CS510 \ Lecture Ariel Stolerman

Creating a New Angry Birds Competition Track

Game Theory. 4: Nash equilibrium in different games and mixed strategies

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly

Finance Solutions to Problem Set #8: Introduction to Game Theory

Lecture 7. Repeated Games

Contents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6

Repeated Games. Economics Microeconomic Theory II: Strategic Behavior. Shih En Lu. Simon Fraser University (with thanks to Anke Kessler)

Exercises for Introduction to Game Theory SOLUTIONS

6.001, Fall Semester, Problem Set 3 3. In game theory, atwo-person binary-choice game is represented by atwo-by-two matrix.

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood

3-2 Lecture 3: January Repeated Games A repeated game is a standard game which isplayed repeatedly. The utility of each player is the sum of

The Game Theory of Game Theory Ruben R. Puentedura, Ph.D.

An Intersection of Art, Biology, Ethics, and Computer Science," Gustavo Rodriguez-Rivera Computer Science Purdue University

Math 464: Linear Optimization and Game

Math 152: Applicable Mathematics and Computing

Advanced Microeconomics: Game Theory

Math 611: Game Theory Notes Chetan Prakash 2012

Lab: Prisoner s Dilemma

ECON 312: Games and Strategy 1. Industrial Organization Games and Strategy

Game Theory: introduction and applications to computer networks

DECISION MAKING GAME THEORY

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown

Dominant Strategies (From Last Time)

CSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi

EC3224 Autumn Lecture #02 Nash Equilibrium

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory

Games in Extensive Form, Backward Induction, and Subgame Perfection:

Game Theory and Randomized Algorithms

Computing Nash Equilibrium; Maxmin

Introduction to Game Theory

NORMAL FORM (SIMULTANEOUS MOVE) GAMES

Adversarial Search and Game Theory. CS 510 Lecture 5 October 26, 2017

3 Game Theory II: Sequential-Move and Repeated Games

Complexity, Virtualization, and the Future of Cooperation

1 Deterministic Solutions

Mohammad Hossein Manshaei 1394

UPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5

Game Theory. Wolfgang Frimmel. Dominance

Instability of Scoring Heuristic In games with value exchange, the heuristics are very bumpy Make smoothing assumptions search for "quiesence"

COORDINATION GAMES. Nash Equilibria, Schelling Points and the Prisoner s Dilemma. Owain Evans, MIT Paradox, Monday 25 February 2013.

Distributed Optimization and Games

Optimization of Multipurpose Reservoir Operation Using Game Theory

DR. SARAH ABRAHAM CS349 UNINTENDED CONSEQUENCES

Evolutionary Game Theory and Linguistics

Game Theory. Vincent Kubala

The Best Evolutionary Solution to the Iterated Prisoner s Dilemma

Note: A player has, at most, one strictly dominant strategy. When a player has a dominant strategy, that strategy is a compelling choice.

CSC304 Lecture 2. Game Theory (Basic Concepts) CSC304 - Nisarg Shah 1

Introduction to Game Theory

Appendix A A Primer in Game Theory

What is Trust and How Can My Robot Get Some? AIs as Members of Society

What is... Game Theory? By Megan Fava

Dominant and Dominated Strategies

37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game

CPS331 Lecture: Genetic Algorithms last revised October 28, 2016

Noncooperative Games COMP4418 Knowledge Representation and Reasoning

Introduction to Game Theory

Game Theory. Vincent Kubala

2. The Extensive Form of a Game

Computational Methods for Non-Cooperative Game Theory

Dominance and Best Response. player 2

Game Theory. 4: Nash equilibrium in different games and mixed strategies

Normal Form Games: A Brief Introduction

Game theory Computational Models of Cognition

Adversarial Search and Game- Playing C H A P T E R 6 C M P T : S P R I N G H A S S A N K H O S R A V I

PARALLEL NASH EQUILIBRIA IN BIMATRIX GAMES ISAAC ELBAZ CSE633 FALL 2012 INSTRUCTOR: DR. RUSS MILLER

Economics of Strategy (ECON 4550) Maymester 2015 Foundations of Game Theory

A Game Playing System for Use in Computer Science Education

17.5 DECISIONS WITH MULTIPLE AGENTS: GAME THEORY

Multilevel Selection In-Class Activities. Accompanies the article:

Solution Concepts 4 Nash equilibrium in mixed strategies

Chapter 2 Basics of Game Theory

Multi-player, non-zero-sum games

Transcription:

Game Theory, Continued: From Zero-Sum to Non-Zero-Sum Problem Set 3 due on FRIDAY!

Blue Cooperate Red Defect Cooperate 3 3 5 0 0 5 1 1 Defect

Game Theory: Basic Taxonomy Zero- vs. non-zero sum Two- vs. N-person games Finite vs. infinite number of choices Iterated vs. non-iterated games Games of perfect information

Two-Person Zero Sum Games The notion of a dominant choice The solution of a zero-sum game The value of a game The minimax theorem Pure vs. Mixed strategies

Blue A B A 5 3 Red B 4 1

Blue 4 5 10 3 Worst I can do Red 8 4 3 7 7 6 8 9 7 2 4 6 Worst I can do

Scissors Paper Stone Scissors 0 1-1 Paper -1 0 1 Stone 1-1 0

The Minimax Theorem in Game Theory Applies to zero-sum, two-person finite games. The minimax theorem says that in such a game, there is a value V for the game (the same value V for both players). Given an optimal strategy (possibly a mixed strategy), each player can be assured (on average) of obtaining at least V for the game regardless of what the other player does. What this means, essentially, is that both players can examine such a matrix and determine beforehand (and regardless of the other player s plan) what they need to do to ensure receiving an average of V for the game.

A Non-Zero-Sum Game Blue Red 8 4 6 2 5 7 4 8

Blue Red 5 6 3 7 7 2 9 8

Clyde Clam up Bonnie Stool Pigeon Clam up 1 year 1 year 0 years 20 years Stool Pigeon 20 years 0 years 10 years 10 years

Blue Cooperate Red Defect Cooperate 3 3 5 0 0 5 1 1 Defect

Blue Red 6 6 7 4 4 7-3 -3

Blue Red 3 3 3 1 1 3 0 0

Blue Red 4 4 3 1 1 3 0 0

The Ultimatum Game : adding intangibles to a utility function Two players, Red and Blue. Red is given $1000 and is told that he can choose an amount to be taken out of this total to offer Blue. Blue then chooses whether to accept this amount or not. If Blue rejects Red s offer, both get nothing.

Axelrod s idea: hold a computer tournament in which each contestant is a program that will play a series of rounds of the Prisoner s Dilemma game. Researchers can send in a program to enter in the tournament: each program will play all the others in a series of about 100 successive rounds of the PD game.

Some Simple Axelrod- Tournament-like strategies All-Defect simply defects on every round Poor-Trusting-Fool simply cooperates on every round Random is a test strategy that simply cooperates or defects randomly Unforgiving cooperates initially until the first time that the other player defects; after that, Unforgiving defects forever

The Tit-for-Tat Strategy Tit-for-Tat cooperates on the first round. Thereafter, on every subsequent round, it simply imitates what the other player did on the previous round. (That is, Tit-for-Tat does at round N what the other player did at round N-1.)

A British staff office on a tour of the trenches remarked that he was astonished to observe German soldiers walking about within rifle range behind their own line. Our men appeared to take no notice. I privately made up my mind to do away with that sort of thing when we took over; such things should not be allowed. These people evidently did not know there was a war on. Both sides apparently believed in the policy of live and let live. Dugdale 1932, quoted in Axelrod, p. 74

The high commands of the two sides did not share the view of the common soldier who said: The real reason for the quietness of some sections of the line was that neither side had any intention of advancing in that particular district... If the British shelled the Germans, the Germans replied, and the damage was equal: if the Germans bombed an advanced piece of trench and killed five Englishmen, an answering fusillade killed five Germans. Belton Cobb 1916, quoted in Axelrod p. 76

The ethics that developed are illustrated in this incident, related by a British officer recalling his experience while facing a Saxon unit of the German Army. I was having tea with A Company when we heard a lot of shouting and went out to investigate. We found our men and the Germans standing on their respective parapets. Suddenly a salvo arrived but did no damage. Naturally both sides got down and our men started swearing at the Germans, when all at once a brave German got on to his parapet and shouted out We are very sorry about that; we hope no one was hurt. It is not our fault, it is that damned Prussian artillery. Rutter 1934, quoted in Axelrod, p. 85