Game Theory: Minimax, Maximin, and Iterated Removal Naima Hammoud
|
|
- Kellie Potter
- 6 years ago
- Views:
Transcription
1 Game Theory: Minimax, Maximin, and Iterated Removal Naima Hammoud March 14, 17
2 Last Lecture: expected value principle Colin A B Rose A - - B - Suppose that Rose knows Colin will play ½ A + ½ B Rose s Expectations for playing pure strategies E Rose (A) =1/ +1/ ( ) = 1/ E Rose (B) =1/ +1/ () = / Rose s expected payoff if she plays strategy A is -1/ Rose s expected payoff if she plays strategy B is /
3 Last Lecture: expected value principle Colin A B Rose A - - B - Suppose that Rose knows Colin will play ½ A + ½ B Rose s Expectations for playing pure strategies E Rose (A) =1/ +1/ ( ) = 1/ E Rose (B) =1/ +1/ () = / Because / > -1/ Rose chooses to maximize her payoff by playing B. That s of course only if Colin is playing ½ A + ½ B
4 Last Lecture: expected value principle Colin A B Rose A - - B - Rule of thumb: If you know your opponent is playing a mixed strategy and will continue to play it, you should use a strategy that maximizes your expected payoff.
5 Last Lecture We saw that in soccer penalty-kick data collected by Ignacio Palacios- Huerta () that kickers and goal-keepers seem to be playing the Nash equilibrium! But is that really the case? Goalie Left Goalie Right Kicker Left Kicker Right Nash frequency Actual frequency
6 Last Lecture We saw that in soccer penalty-kick data collected by Ignacio Palacios- Huerta () that kickers and goal-keepers seem to be playing the Nash equilibrium! But is that really the case? The player is actually trying to maximize their own gain and minimize the gain of the goal keeper It turns out that in zero-sum games, the Nash equilibrium, maximizing your own gain, and minimizing your opponent s gain actually coincide.
7 Zero-sum Games zero-sum game: A zero-sum game is one in which the sum of the individual payoffs for each outcome is zero. Example: Matching pennies Colin Rose Heads Tails Heads Tails The sum of payoffs for this outcome is zero, as is the sum of payoffs for every other outcome.
8 Minimax, Maximin zero-sum game: A zero-sum game is one in which the sum of the individual payoffs for each outcome is zero. Minimax strategy: minimizing one s own maximum loss Maximin strategy: maximize one s own minimum gain
9 Zero-sum game example Column player,, 1, 1 44, 4,, 1, 1,, 5 Column player Since the payoffs of the column player (shown red) are just the negative of the payoffs of the row player, we can write a matrix only showing payoffs of the row player (on the right). Once we have that, we can find the maximin & minimax.
10 Maximin strategy for : maximize their own minimum gain A Column player A B C 1 minimum gain B 44 5 C 1 If plays the first strategy (strategy A) then their minimum gain is.
11 Maximin strategy for : maximize their own minimum gain A B Column player A B C minimum gain C 1 If plays strategy B then their minimum gain is -.
12 Maximin strategy for : maximize their own minimum gain A B Column player A B C minimum gain C 1 If plays strategy C then their minimum gain is -.
13 Maximin strategy for : maximize their own minimum gain Minimax strategy for player : minimize their own maximum loss A B Column player A B C minimum gain C 1 maximum loss 4 If player plays strategy A then their maximum loss is 4 (their max loss is s max gain)
14 Maximin strategy for : maximize their own minimum gain Minimax strategy for player : minimize their own maximum loss A B Column player A B C minimum gain C 1 maximum loss 4 If player plays strategy B then their maximum loss is (their max loss is s max gain)
15 Maximin strategy for : maximize their own minimum gain Minimax strategy for player : minimize their own maximum loss A B Column player A B C minimum gain C 1 maximum loss 4 If player plays strategy C then their maximum loss is (their max loss is s max gain)
16 Maximin strategy for : maximize their own minimum gain Minimax strategy for player : minimize their own maximum loss A B Column player A B C minimum gain maximin C 1 maximum loss 4 minimax Take the maximum of the minimum gains, i.e. the maximum of row minima (maximin), and the minimum of the maximum losses, i.e. the minimum of column maxima (minimax). If they are equal, you have a saddle point.
17 Maximin strategy for : maximize their own minimum gain Minimax strategy for player : minimize their own maximum loss A B Column player A B C saddle point minimum gain maximin C 1 maximum loss 4 minimax If a saddle point exists, it should always be played. Here plays A and player plays B
18 Maximin strategy for : maximize their own minimum gain Minimax strategy for player : minimize their own maximum loss A B Column player A B C saddle point minimum gain maximin C 1 maximum loss 4 minimax A saddle point is a Nash equilibrium
19 More examples player minimax None of the row minima equals any of the column maxima, so no saddle points maximin player The highlighted entry is the saddle point, and both players will play it.
20 Dominated strategies: iterated removal Dominated strategy: There is some other strategy that does better than it. A dominated strategy will never be played, so we can remove it from the game We can iterate until we get to to the dominant strategy This is called iterated removal of dominated strategies
21 iterated removal example Column player Left Center Right Up 1 Middle Down 1 4 1
22 Column player Left Center Right Up 1 Middle Down Column player will never play Right because it is strictly dominated by Center. The payoffs of player playing Right are (,, 1), which are dominated by (1, 1, ) from playing Center. Therefore we can remove Right.
23 Column player Left Center Right Up 1 Middle Down player will never play Middle because it is strictly dominated by Up. Payoffs of Middle are (1, 1) which are dominated by (, ) from Up.
24 Column player Left Center Up 1 Down 1 4 The new game matrix is now smaller.
25 Column player Left Center Up 1 Down 1 4 Column player will never play Left because it is strictly dominated by Center. Payoff of (, 1) from Left versus (1, ) from Center.
26 Column player Center Up 1 Down 4 Now row player is better off playing Down than Up, because the payoff is 4 instead of. So (4, ) is a unique Nash equilibrium
27 FAITH TELEVISION S NEW HIT GAMESHOW You have observed the host to be 99.98% accurate in the last 1, games. If he predicted that the contestant chooses only Box #, he rewards their faith with the million dollars.! Do you take both boxes or only Box #? Box 1 $1 Box $1 million or nothing 4
28 THE MATRIX FOR NEWCOMB S PROBLEM HOST Predicts that you select both boxes Predicts that you select Box # CONTESTANT You select both $1, $1,1, You select Box # $ $1,,
29 TWO ARGUMENTS Argument 1: Have faith and take Box # In your observations of the last 1, games, the host has been shown to possess 99.98% accuracy in predicting the contestants choice. If you select both boxes, you will almost certainly get only $1. If you have faith (in the host, in your observations), and select Box #, you will win the million dollars. Argument : Take both boxes What does it matter what the host predicted? Either there is one million dollars in Box # or there isn t. The host s prediction does not change the contents of the box here and now. By opening both boxes, you get either $1 or $1,1,. This is better than $ or $1,,.
Their opponent will play intelligently and wishes to maximize their own payoff.
Two Person Games (Strictly Determined Games) We have already considered how probability and expected value can be used as decision making tools for choosing a strategy. We include two examples below for
More informationUsing the Maximin Principle
Using the Maximin Principle Under the maximin principle, it is easy to see that Rose should choose a, making her worst-case payoff 0. Colin s similar rationality as a player induces him to play (under
More information6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts
6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts Asu Ozdaglar MIT February 9, 2010 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria
More information1. better to stick. 2. better to switch. 3. or does your second choice make no difference?
The Monty Hall game Game show host Monty Hall asks you to choose one of three doors. Behind one of the doors is a new Porsche. Behind the other two doors there are goats. Monty knows what is behind each
More informationNow we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium. in pure strategies through intentional mixing.
Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 7. SIMULTANEOUS-MOVE GAMES: MIXED STRATEGIES Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium in pure strategies
More informationm 11 m 12 Non-Zero Sum Games Matrix Form of Zero-Sum Games R&N Section 17.6
Non-Zero Sum Games R&N Section 17.6 Matrix Form of Zero-Sum Games m 11 m 12 m 21 m 22 m ij = Player A s payoff if Player A follows pure strategy i and Player B follows pure strategy j 1 Results so far
More informationPrisoner s Dilemma. CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma. Prisoner s Dilemma. Prisoner s Dilemma.
CS 331: rtificial Intelligence Game Theory I You and your partner have both been caught red handed near the scene of a burglary. oth of you have been brought to the police station, where you are interrogated
More informationBest counterstrategy for C
Best counterstrategy for C In the previous lecture we saw that if R plays a particular mixed strategy and shows no intention of changing it, the expected payoff for R (and hence C) varies as C varies her
More information15.053/8 February 28, person 0-sum (or constant sum) game theory
15.053/8 February 28, 2013 2-person 0-sum (or constant sum) game theory 1 Quotes of the Day My work is a game, a very serious game. -- M. C. Escher (1898-1972) Conceal a flaw, and the world will imagine
More informationCS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma
CS 331: Artificial Intelligence Game Theory I 1 Prisoner s Dilemma You and your partner have both been caught red handed near the scene of a burglary. Both of you have been brought to the police station,
More informationG5212: Game Theory. Mark Dean. Spring 2017
G5212: Game Theory Mark Dean Spring 2017 More on Nash Equilibrium So now we know That (almost) all games have a Nash Equilibrium in mixed strategies How to find these equilibria by calculating best responses
More informationIntroduction to Multi-Agent Programming
Introduction to Multi-Agent Programming 10. Game Theory Strategic Reasoning and Acting Alexander Kleiner and Bernhard Nebel Strategic Game A strategic game G consists of a finite set N (the set of players)
More informationStrategy Lines and Optimal Mixed Strategy for R
Strategy Lines and Optimal Mixed Strategy for R Best counterstrategy for C for given mixed strategy by R In the previous lecture we saw that if R plays a particular mixed strategy, [p, p, and shows no
More informationEconomics 109 Practice Problems 1, Vincent Crawford, Spring 2002
Economics 109 Practice Problems 1, Vincent Crawford, Spring 2002 P1. Consider the following game. There are two piles of matches and two players. The game starts with Player 1 and thereafter the players
More informationIntroduction to Game Theory
Chapter G Notes 1 Epstein, 2013 Introduction to Game Theory G.1 Decision Making Game theory is a mathematical model that provides a atic way to deal with decisions under circumstances where the alternatives
More informationLINEAR PROGRAMMING. Homework 7
LINEAR PROGRAMMING Homework 7 Fall 2014 Csci 628 Megan Rose Bryant 1. Your friend is taking a Linear Programming course at another university and for homework she is asked to solve the following LP: Primal:
More informationMATH 210, PROBLEM SET 1 DUE IN LECTURE ON WEDNESDAY, JAN. 28
MATH 210, PROBLEM SET 1 DUE IN LECTURE ON WEDNESDAY, JAN. 28 1. Frankfurt s theory of lying and bullshit. Read Frankfurt s book On Bullshit. In particular, see the description of the distinction he makes
More informationOutline for today. Stat155 Game Theory Lecture 13: General-Sum Games. General-sum games. General-sum games. Dominated pure strategies
Outline for today Stat155 Game Theory Lecture 13: General-Sum Games Peter Bartlett October 11, 2016 Two-player general-sum games Definitions: payoff matrices, dominant strategies, safety strategies, Nash
More informationWeek 8: Basic concepts in game theory
Week 8: Basic concepts in game theory Part 1: Examples of games We introduce here the basic objects involved in game theory. To specify a game ones gives The players. The set of all possible strategies
More informationCS711 Game Theory and Mechanism Design
CS711 Game Theory and Mechanism Design Problem Set 1 August 13, 2018 Que 1. [Easy] William and Henry are participants in a televised game show, seated in separate booths with no possibility of communicating
More informationECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games
University of Illinois Fall 2018 ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games Due: Tuesday, Sept. 11, at beginning of class Reading: Course notes, Sections 1.1-1.4 1. [A random
More informationSI 563 Homework 3 Oct 5, Determine the set of rationalizable strategies for each of the following games. a) X Y X Y Z
SI 563 Homework 3 Oct 5, 06 Chapter 7 Exercise : ( points) Determine the set of rationalizable strategies for each of the following games. a) U (0,4) (4,0) M (3,3) (3,3) D (4,0) (0,4) X Y U (0,4) (4,0)
More informationStrategies and Nash Equilibrium. A Whirlwind Tour of Game Theory
Strategies and Nash Equilibrium A Whirlwind Tour of Game Theory (Mostly from Fudenberg & Tirole) Players choose actions, receive rewards based on their own actions and those of the other players. Example,
More informationWhen one firm considers changing its price or output level, it must make assumptions about the reactions of its rivals.
Chapter 3 Oligopoly Oligopoly is an industry where there are relatively few sellers. The product may be standardized (steel) or differentiated (automobiles). The firms have a high degree of interdependence.
More informationpreferences of the individual players over these possible outcomes, typically measured by a utility or payoff function.
Leigh Tesfatsion 26 January 2009 Game Theory: Basic Concepts and Terminology A GAME consists of: a collection of decision-makers, called players; the possible information states of each player at each
More informationGame Theory: introduction and applications to computer networks
Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up) Giovanni Neglia INRIA EPI Maestro 20 January 2014 Part of the slides are based on a previous course with D. Figueiredo
More informationThe Nash equilibrium of the stage game is (D, R), giving payoffs (0, 0). Consider the trigger strategies:
Problem Set 4 1. (a). Consider the infinitely repeated game with discount rate δ, where the strategic fm below is the stage game: B L R U 1, 1 2, 5 A D 2, 0 0, 0 Sketch a graph of the players payoffs.
More informationGame theory and applications: Lecture 1
Game theory and applications: Lecture 1 Adam Szeidl September 20, 2018 Outline for today 1 Some applications of game theory 2 Games in strategic form 3 Dominance 4 Nash equilibrium 1 / 8 1. Some applications
More information6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2
6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2 Daron Acemoglu and Asu Ozdaglar MIT October 14, 2009 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria Mixed Strategies
More informationCS 7180: Behavioral Modeling and Decision- making in AI
CS 7180: Behavioral Modeling and Decision- making in AI Algorithmic Game Theory Prof. Amy Sliva November 30, 2012 Prisoner s dilemma Two criminals are arrested, and each offered the same deal: If you defect
More informationLECTURE 4: MULTIAGENT INTERACTIONS
What are Multiagent Systems? LECTURE 4: MULTIAGENT INTERACTIONS Source: An Introduction to MultiAgent Systems Michael Wooldridge 10/4/2005 Multi-Agent_Interactions 2 MultiAgent Systems Thus a multiagent
More informationTUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 152 ENGINEERING SYSTEMS Spring Lesson 16 Introduction to Game Theory
TUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 52 ENGINEERING SYSTEMS Spring 20 Introduction: Lesson 6 Introduction to Game Theory We will look at the basic ideas of game theory.
More informationUC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016
UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016 More on strategic games and extensive games with perfect information Block 2 Jun 11, 2017 Auctions results Histogram of
More informationCMPSCI 240: Reasoning about Uncertainty
CMPSCI 240: Reasoning about Uncertainty Lecture 23: More Game Theory Andrew McGregor University of Massachusetts Last Compiled: April 20, 2017 Outline 1 Game Theory 2 Non Zero-Sum Games and Nash Equilibrium
More informationPAULI MURTO, ANDREY ZHUKOV. If any mistakes or typos are spotted, kindly communicate them to
GAME THEORY PROBLEM SET 1 WINTER 2018 PAULI MURTO, ANDREY ZHUKOV Introduction If any mistakes or typos are spotted, kindly communicate them to andrey.zhukov@aalto.fi. Materials from Osborne and Rubinstein
More informationWeek 8: Basic concepts in game theory
Week 8: Basic concepts in game theory Part 1: Examples of games We introduce here the basic objects involved in game theory. To specify a game ones gives The players. The set of all possible strategies
More informationThursday, March 3
5.53 Thursday, March 3 -person -sum (or constant sum) game theory -dimensional multi-dimensional Comments on first midterm: practice test will be on line coverage: every lecture prior to game theory quiz
More informationAn introduction on game theory for wireless networking [1]
An introduction on game theory for wireless networking [1] Ning Zhang 14 May, 2012 [1] Game Theory in Wireless Networks: A Tutorial 1 Roadmap 1 Introduction 2 Static games 3 Extensive-form games 4 Summary
More informationHomework #2 Psychology 101 Spr 03 Prof Colin Camerer
Homework #2 Psychology 101 Spr 03 Prof Colin Camerer This is available Monday 28 April at 130 (in class or from Karen in Baxter 332, or on web) and due Wednesday 7 May at 130 (in class or to Karen). Collaboration
More informationIntroduction to Game Theory
Chapter G Notes 1 Epstein, 2013 Introduction to Game Theory G.1 Decision Making Game theory is a mathematical model that provides a systematic way to deal with decisions under circumstances where the alternatives
More informationIntroduction to Game Theory
Introduction to Game Theory Presentation vs. exam You and your partner Either study for the exam or prepare the presentation (not both) Exam (50%) If you study for the exam, your (expected) grade is 92
More informationMATH 121 GAME THEORY REVIEW
MATH 121 GAME THEORY REVIEW ERIN PEARSE Contents 1. Definitions 2 1.1. Non-cooperative Games 2 1.2. Cooperative 2-person Games 4 1.3. Cooperative n-person Games (in coalitional form) 6 2. Theorems and
More informationS 2,2-1, x c C x r, 1 0,0
Problem Set 5 1. There are two players facing each other in the following random prisoners dilemma: S C S, -1, x c C x r, 1 0,0 With probability p, x c = y, and with probability 1 p, x c = 0. With probability
More informationGame Theory Notes: Examples of Games with Dominant Strategy Equilibrium or Nash Equilibrium
Game Theory Notes: Examples of Games with Dominant Strategy Equilibrium or Nash Equilibrium Below are two different games. The first game has a dominant strategy equilibrium. The second game has two Nash
More informationIntroduction to Game Theory
Introduction to Game Theory 3a. More on Normal-Form Games Dana Nau University of Maryland Nau: Game Theory 1 More Solution Concepts Last time, we talked about several solution concepts Pareto optimality
More informationCS 798: Homework Assignment 4 (Game Theory)
0 5 CS 798: Homework Assignment 4 (Game Theory) 1.0 Preferences Assigned: October 28, 2009 Suppose that you equally like a banana and a lottery that gives you an apple 30% of the time and a carrot 70%
More informationGame Theory. VK Room: M1.30 Last updated: October 22, 2012.
Game Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 22, 2012. 1 / 33 Overview Normal Form Games Pure Nash Equilibrium Mixed Nash Equilibrium 2 / 33 Normal Form Games
More informationRegret Minimization and Security Strategies
Chapter 5 Regret Minimization and Security Strategies Until now we implicitly adopted a view that a Nash equilibrium is a desirable outcome of a strategic game. In this chapter we consider two alternative
More informationElements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition
Elements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition Kai Hao Yang /2/207 In this lecture, we will apply the concepts in game theory to study oligopoly. In short, unlike
More informationIV. Cooperation & Competition
IV. Cooperation & Competition Game Theory and the Iterated Prisoner s Dilemma 10/15/03 1 The Rudiments of Game Theory 10/15/03 2 Leibniz on Game Theory Games combining chance and skill give the best representation
More informationComparative Study between Linear and Graphical Methods in Solving Optimization Problems
Comparative Study between Linear and Graphical Methods in Solving Optimization Problems Mona M Abd El-Kareem Abstract The main target of this paper is to establish a comparative study between the performance
More informationMAT 4250: Lecture 1 Eric Chung
1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose
More informationPAULI MURTO, ANDREY ZHUKOV
GAME THEORY SOLUTION SET 1 WINTER 018 PAULI MURTO, ANDREY ZHUKOV Introduction For suggested solution to problem 4, last year s suggested solutions by Tsz-Ning Wong were used who I think used suggested
More informationECO 5341 (Section 2) Spring 2016 Midterm March 24th 2016 Total Points: 100
Name:... ECO 5341 (Section 2) Spring 2016 Midterm March 24th 2016 Total Points: 100 For full credit, please be formal, precise, concise and tidy. If your answer is illegible and not well organized, if
More informationSolution to Tutorial 1
Solution to Tutorial 1 011/01 Semester I MA464 Game Theory Tutor: Xiang Sun August 4, 011 1 Review Static means one-shot, or simultaneous-move; Complete information means that the payoff functions are
More informationRepeated, Stochastic and Bayesian Games
Decision Making in Robots and Autonomous Agents Repeated, Stochastic and Bayesian Games Subramanian Ramamoorthy School of Informatics 26 February, 2013 Repeated Game 26/02/2013 2 Repeated Game - Strategies
More informationPlayer 2 H T T -1,1 1, -1
1 1 Question 1 Answer 1.1 Q1.a In a two-player matrix game, the process of iterated elimination of strictly dominated strategies will always lead to a pure-strategy Nash equilibrium. Answer: False, In
More informationB w x y z a 4,4 3,3 5,1 2,2 b 3,6 2,5 6,-3 1,4 A c -2,0 2,-1 0,0 2,1 d 1,4 1,2 1,1 3,5
Econ 414, Exam 1 Name: There are three questions taken from the material covered so far in the course. All questions are equally weighted. If you have a question, please raise your hand and I will come
More informationSolution to Tutorial /2013 Semester I MA4264 Game Theory
Solution to Tutorial 1 01/013 Semester I MA464 Game Theory Tutor: Xiang Sun August 30, 01 1 Review Static means one-shot, or simultaneous-move; Complete information means that the payoff functions are
More informationChapter 2 Strategic Dominance
Chapter 2 Strategic Dominance 2.1 Prisoner s Dilemma Let us start with perhaps the most famous example in Game Theory, the Prisoner s Dilemma. 1 This is a two-player normal-form (simultaneous move) game.
More informationGame Theory - Lecture #8
Game Theory - Lecture #8 Outline: Randomized actions vnm & Bernoulli payoff functions Mixed strategies & Nash equilibrium Hawk/Dove & Mixed strategies Random models Goal: Would like a formulation in which
More informationGAME THEORY. Game theory. The odds and evens game. Two person, zero sum game. Prototype example
Game theory GAME THEORY (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Mathematical theory that deals, in an formal, abstract way, with the general features of competitive situations
More informationMaximizing Winnings on Final Jeopardy!
Maximizing Winnings on Final Jeopardy! Jessica Abramson, Natalie Collina, and William Gasarch August 2017 1 Introduction Consider a final round of Jeopardy! with players Alice and Betty 1. We assume that
More informationChapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem
Chapter 10: Mixed strategies Nash equilibria reaction curves and the equality of payoffs theorem Nash equilibrium: The concept of Nash equilibrium can be extended in a natural manner to the mixed strategies
More informationCS711: Introduction to Game Theory and Mechanism Design
CS711: Introduction to Game Theory and Mechanism Design Teacher: Swaprava Nath Domination, Elimination of Dominated Strategies, Nash Equilibrium Domination Normal form game N, (S i ) i N, (u i ) i N Definition
More informationCMPSCI 240: Reasoning about Uncertainty
CMPSCI 240: Reasoning about Uncertainty Lecture 21: Game Theory Andrew McGregor University of Massachusetts Last Compiled: April 29, 2017 Outline 1 Game Theory 2 Example: Two-finger Morra Alice and Bob
More informationGame Theory Tutorial 3 Answers
Game Theory Tutorial 3 Answers Exercise 1 (Duality Theory) Find the dual problem of the following L.P. problem: max x 0 = 3x 1 + 2x 2 s.t. 5x 1 + 2x 2 10 4x 1 + 6x 2 24 x 1 + x 2 1 (1) x 1 + 3x 2 = 9 x
More informationIterated Dominance and Nash Equilibrium
Chapter 11 Iterated Dominance and Nash Equilibrium In the previous chapter we examined simultaneous move games in which each player had a dominant strategy; the Prisoner s Dilemma game was one example.
More informationEcon 323 Microeconomic Theory. Practice Exam 2 with Solutions
Econ 323 Microeconomic Theory Practice Exam 2 with Solutions Chapter 10, Question 1 Which of the following is not a condition for perfect competition? Firms a. take prices as given b. sell a standardized
More informationName. Answers Discussion Final Exam, Econ 171, March, 2012
Name Answers Discussion Final Exam, Econ 171, March, 2012 1) Consider the following strategic form game in which Player 1 chooses the row and Player 2 chooses the column. Both players know that this is
More informationGame Theory Lecture #16
Game Theory Lecture #16 Outline: Auctions Mechanism Design Vickrey-Clarke-Groves Mechanism Optimizing Social Welfare Goal: Entice players to select outcome which optimizes social welfare Examples: Traffic
More information(a) Describe the game in plain english and find its equivalent strategic form.
Risk and Decision Making (Part II - Game Theory) Mock Exam MIT/Portugal pages Professor João Soares 2007/08 1 Consider the game defined by the Kuhn tree of Figure 1 (a) Describe the game in plain english
More informationMaximizing Winnings on Final Jeopardy!
Maximizing Winnings on Final Jeopardy! Jessica Abramson, Natalie Collina, and William Gasarch August 2017 1 Abstract Alice and Betty are going into the final round of Jeopardy. Alice knows how much money
More informationEcon 323 Microeconomic Theory. Chapter 10, Question 1
Econ 323 Microeconomic Theory Practice Exam 2 with Solutions Chapter 10, Question 1 Which of the following is not a condition for perfect competition? Firms a. take prices as given b. sell a standardized
More informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #24 Scribe: Jordan Ash May 1, 2014
COS 5: heoretical Machine Learning Lecturer: Rob Schapire Lecture #24 Scribe: Jordan Ash May, 204 Review of Game heory: Let M be a matrix with all elements in [0, ]. Mindy (called the row player) chooses
More informationECO303: Intermediate Microeconomic Theory Benjamin Balak, Spring 2008
ECO303: Intermediate Microeconomic Theory Benjamin Balak, Spring 2008 Game Theory: FINAL EXAMINATION 1. Under a mixed strategy, A) players move sequentially. B) a player chooses among two or more pure
More informationAS/ECON 2350 S2 N Answers to Mid term Exam July time : 1 hour. Do all 4 questions. All count equally.
AS/ECON 2350 S2 N Answers to Mid term Exam July 2017 time : 1 hour Do all 4 questions. All count equally. Q1. Monopoly is inefficient because the monopoly s owner makes high profits, and the monopoly s
More informationMA300.2 Game Theory 2005, LSE
MA300.2 Game Theory 2005, LSE Answers to Problem Set 2 [1] (a) This is standard (we have even done it in class). The one-shot Cournot outputs can be computed to be A/3, while the payoff to each firm can
More informationIn the Name of God. Sharif University of Technology. Graduate School of Management and Economics
In the Name of God Sharif University of Technology Graduate School of Management and Economics Microeconomics (for MBA students) 44111 (1393-94 1 st term) - Group 2 Dr. S. Farshad Fatemi Game Theory Game:
More informationGAME THEORY. (Hillier & Lieberman Introduction to Operations Research, 8 th edition)
GAME THEORY (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Game theory Mathematical theory that deals, in an formal, abstract way, with the general features of competitive situations
More informationTest 1. ECON3161, Game Theory. Tuesday, September 25 th
Test 1 ECON3161, Game Theory Tuesday, September 2 th Directions: Answer each question completely. If you cannot determine the answer, explaining how you would arrive at the answer may earn you some points.
More informationProblem 3 Solutions. l 3 r, 1
. Economic Applications of Game Theory Fall 00 TA: Youngjin Hwang Problem 3 Solutions. (a) There are three subgames: [A] the subgame starting from Player s decision node after Player s choice of P; [B]
More informationAnswer Key: Problem Set 4
Answer Key: Problem Set 4 Econ 409 018 Fall A reminder: An equilibrium is characterized by a set of strategies. As emphasized in the class, a strategy is a complete contingency plan (for every hypothetical
More informationMath 135: Answers to Practice Problems
Math 35: Answers to Practice Problems Answers to problems from the textbook: Many of the problems from the textbook have answers in the back of the book. Here are the answers to the problems that don t
More informationName. FINAL EXAM, Econ 171, March, 2015
Name FINAL EXAM, Econ 171, March, 2015 There are 9 questions. Answer any 8 of them. Good luck! Remember, you only need to answer 8 questions Problem 1. (True or False) If a player has a dominant strategy
More informationGame Theory Problem Set 4 Solutions
Game Theory Problem Set 4 Solutions 1. Assuming that in the case of a tie, the object goes to person 1, the best response correspondences for a two person first price auction are: { }, < v1 undefined,
More informationElements of Economic Analysis II Lecture X: Introduction to Game Theory
Elements of Economic Analysis II Lecture X: Introduction to Game Theory Kai Hao Yang 11/14/2017 1 Introduction and Basic Definition of Game So far we have been studying environments where the economic
More informationECE 586BH: Problem Set 5: Problems and Solutions Multistage games, including repeated games, with observed moves
University of Illinois Spring 01 ECE 586BH: Problem Set 5: Problems and Solutions Multistage games, including repeated games, with observed moves Due: Reading: Thursday, April 11 at beginning of class
More information1 R. 2 l r 1 1 l2 r 2
4. Game Theory Midterm I Instructions. This is an open book exam; you can use any written material. You have one hour and 0 minutes. Each question is 35 points. Good luck!. Consider the following game
More informationTopic One: Zero-sum games and saddle point equilibriums
MATH4321 Game Theory Topic One: Zero-sum games and saddle point equilibriums 1.1 Definitions and examples Essential elements of a game Game matrix and game tree representation of a game Expected payoff
More informationGame Theory: Additional Exercises
Game Theory: Additional Exercises Problem 1. Consider the following scenario. Players 1 and 2 compete in an auction for a valuable object, for example a painting. Each player writes a bid in a sealed envelope,
More informationMATH 4321 Game Theory Solution to Homework Two
MATH 321 Game Theory Solution to Homework Two Course Instructor: Prof. Y.K. Kwok 1. (a) Suppose that an iterated dominance equilibrium s is not a Nash equilibrium, then there exists s i of some player
More informationJianfei Shen. School of Economics, The University of New South Wales, Sydney 2052, Australia
. Zero-sum games Jianfei Shen School of Economics, he University of New South Wales, Sydney, Australia emember that in a zerosum game, u.s ; s / C u.s ; s / D, s ; s. Exercise. Step efer Matrix A, we know
More informationRationalizable Strategies
Rationalizable Strategies Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 1st, 2015 C. Hurtado (UIUC - Economics) Game Theory On the Agenda 1
More informationReview Best Response Mixed Strategy NE Summary. Syllabus
Syllabus Contact: kalk00@vse.cz home.cerge-ei.cz/kalovcova/teaching.html Office hours: Wed 7.30pm 8.00pm, NB339 or by email appointment Osborne, M. J. An Introduction to Game Theory Gibbons, R. A Primer
More informationZero-sum games of two players. Zero-sum games of two players. Zero-sum games of two players. Zero-sum games of two players
Martin Branda Charles University Faculty of Mathematics and Physics Department of Probability and Mathematical Statistics Computational Aspects of Optimization A triplet {X, Y, K} is called a game of two
More informationToday. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction
Today Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction 2 / 26 Auctions Used to allocate: Art Government bonds Radio spectrum Forms: Sequential
More informationSection Strictly Determined Games, Dominated Rows, Saddle Points
Finite Math B Chapter 11 Practice Questions Game Theory Section 11.1 - Strictly Determined Games, Dominated Rows, Saddle Points MULTIPLE CHOICE. Choose the one alternative that best completes the statement
More informationGame Theory. Important Instructions
Prof. Dr. Anke Gerber Game Theory 2. Exam Summer Term 2012 Important Instructions 1. There are 90 points on this 90 minutes exam. 2. You are not allowed to use any material (books, lecture notes etc.).
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 22 COOPERATIVE GAME THEORY Correlated Strategies and Correlated
More information