Chapter 11 What is Utility? A way of representing preferences Utility is not money (but it is a useful analogy) Typical relationship between utility &

Slides:



Advertisements
Similar presentations
Concepts of Game Theory I
Advertisements

Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
1 Game Theory. 2 Definitions Game theory -- formal way to analyze interactions among a group of rational agents behaving strategically Agents – players.
Game Theory S-1.
6-1 LECTURE 6: MULTIAGENT INTERACTIONS An Introduction to MultiAgent Systems
The basics of Game Theory Understanding strategic behaviour.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
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)
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
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.
Multi-player, non-zero-sum games
4 Why Should we Believe Politicians? Lupia and McCubbins – The Democratic Dilemma GV917.
Part 3: The Minimax Theorem
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Games What is ‘Game Theory’? There are several tools and techniques used by applied modelers to generate testable hypotheses Modeling techniques widely.
Game Theory.
OLIGOPOLY AND GAME THEORY Phillip J Bryson Marriott School, BYU.
An Introduction to Game Theory Part I: Strategic Games
Game Theory Part 5: Nash’s Theorem.
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.
Game Theory Analysis Sidney Gautrau. John von Neumann is looked at as the father of modern game theory. Many other theorists, such as John Nash and John.
Ecs289m Spring, 2008 Non-cooperative Games S. Felix Wu Computer Science Department University of California, Davis
GAME THEORY By Ben Cutting & Rohit Venkat. Game Theory: General Definition  Mathematical decision making tool  Used to analyze a competitive situation.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
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’,
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.
Chapter 12 Choices Involving Strategy McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All Rights Reserved.
Game-Theoretic Approaches to Multi-Agent Systems Bernhard Nebel.
Basics on Game Theory For Industrial Economics (According to Shy’s Plan)
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Static Games of Complete Information: Equilibrium Concepts
1 Section 2d Game theory Game theory is a way of thinking about situations where there is interaction between individuals or institutions. The parties.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Game Theory Statistics 802. Lecture Agenda Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
A Game-Theoretic Approach to Strategic Behavior. Chapter Outline ©2015 McGraw-Hill Education. All Rights Reserved. 2 The Prisoner’s Dilemma: An Introduction.
Intermediate Microeconomics
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 Robin Burke GAM 224 Spring Outline Admin Game Theory Utility theory Zero-sum and non-zero sum games Decision Trees Degenerate strategies.
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 Lecture 2: two-person non.
Chapters 29 and 30 Game Theory and Applications. Game Theory 0 Game theory applied to economics by John Von Neuman and Oskar Morgenstern 0 Game theory.
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.
Public Policy Analysis MPA 404 Lecture 24. Previous Lecture Graphical Analysis of Tariff and Quota Game Theory; The prisoner's Dilemma.
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.
Mohsen Afsharchi Multiagent Interaction. What are Multiagent Systems?
Chapters 29 and 30 Game Theory and Applications. Game Theory 0 Game theory applied to economics by John Von Neuman and Oskar Morgenstern 0 Game theory.
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
1 Computer Science Department California Polytechnic State University San Luis Obispo, CA, U.S.A. Franz J. Kurfess CPE/CSC 580: Intelligent Agents 1.
Lec 23 Chapter 28 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.
Games, Strategies, and Decision Making By Joseph Harrington, Jr. First Edition Chapter 4: Stable Play: Nash Equilibria in Discrete Games with Two or Three.
The Prisoner’s Dilemma or Life With My Brother and Sister John CT.
1 Fahiem Bacchus, University of Toronto CSC384: Intro to Artificial Intelligence Game Tree Search I ● Readings ■ Chapter 6.1, 6.2, 6.3, 6.6 ● Announcements:
Chapter 11 MultiAgent Interactions Each agent has preferences. Each agent gets utility depending on their choices and the choices of the other We can write.
Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.
Game Theory By Ben Cutting & Rohit Venkat.
Game theory Chapter 28 and 29
Intermediate Microeconomics
Introduction to Game Theory
Game theory Chapter 28 and 29
Decision Theory and Game Theory
LECTURE 6: MULTIAGENT INTERACTIONS
Chapter 29 Game Theory Key Concept: Nash equilibrium and Subgame Perfect Nash equilibrium (SPNE)
Presentation transcript:

Chapter 11 What is Utility? A way of representing preferences Utility is not money (but it is a useful analogy) Typical relationship between utility & money: 1

MultiAgent Interactions Each agent has preferences. Each agent gets utility depending on their choices and the choices of the other We can write this set of two utilities as a payoff matrix as follows. 2

PayOff Matrices -Business plan. Success depends on other’s choices. -For simplicity, consider two players. -I make a choice, but the consequences of that choice depends on what you do. -Let c(a 1,a 2 ) denote the consequence that results when I (agent 1) choose action a 1 and you (agent 2) choose action a 2 -Let the utility of that consequence be u 1 [c(a 1,a 2 )], we often abbreviate this as u 1 (a 1,a 2 ). -There is a sound mathematical theory called Game Theory for dealing with multi-agent choice problems when every agent knows its utilities and the utilities of all other agents. -the field of game theory came into being with the 1944 book Theory of Games and Economic Behavior by John von Neumann and Oskar Morgenstern some early work began. Theory of Games and Economic BehaviorJohn von NeumannOskar Morgenstern 3

Normal Form When outcomes depend only on a single choice by me and a single choice by you, then the game is said to be in normal form. This terminology represents the idea that the game is in a normative form, meaning a canonical form. The payoff matrix expresses games in normal form, but the game tree expresses games in extensive form- representing turn taking. It will probably be helpful to associate the phrase extensive form with the notion of a tree, and the phrase normal form with the notion of a payoff matrix. 4

Strategy Game theorists can reason about strategies, based on contingencies, rather than discrete actions. In this context, a strategy is not an attitude like play aggressively or defend the goal, but rather a complete expression of what to do in every contingency. As described by Poundstone, – [A strategy] is a complete description of a particular way to play a game, no matter what the other player(s) does and no matter how long the game lasts. A strategy must prescribe actions so thoroughly that you never have to make a decision in following it. A strategy is defined as a choice made in response to the previous choices made in the game. 5

Prisoners’ dilemma – damaged property 6 Both get large fines Ned is suspended Kelly gets wrist slapped Kelly is suspended Ned gets wrist slapped Both get minimal fines Confess Don’t Confess Ned Kelly

Prisoners’ dilemma 7 2,22,25,05,0 0,50,53,33,3 Confess (defect) Confess (defect) Don’t Confess (cooperate) Don’t Confess (cooperate) Ned Kelly

Solution Concepts Three different approaches: 1.minimax, maximin 2.Nash equilibria 3.Pareto optimal 8 Maximin: look at worst case scenario. Pick result that maximizes the worst case Confess (defect) Not confess (cooperative) Results2 or 50 or 3 Worst Case20

Best Response 9 Suppose for a moment that I am P1 and that I know what P2 will choose. Given that I know P2's choice, I can search through all of my choices and find the option that is the best response to his choice. For the prisoner's dilemma, if P2 chooses to confess then the option that maximizes my payoff is to confess. Similarly, if P2 chooses to not confess then the option that maximizes my payoff is to confess. Best response – simply the best thing I can do GIVEN I know what you will do. BUT, I don’t know what you will do. It has to do with regret. This prisoners dilemma problem makes it easy – as I pick the same thing either way.

Prisoners’ dilemma – Best Response 10 2,25,0 0,53,3 Confess (defect) Confess (defect) Don’t Confess (cooperate) Don’t Confess (cooperate) Ned Kelly

Best Response 11 Suppose that instead of knowing exactly which choices P2 was going to make, I know only that P2 will play confess, say, 40% of the time and not confess 60% of the time. I can find the expected utility for confessing (.4*(2)+.6*(5) = 3.8 and the expected utility for not confessing (.4*(0)+.6*(3) = 1.8), which tells me that my best response to P2's strategy is to confess. The notion of a best response is very useful to help understand other solution concepts from multi-agent choice. For example, the maximin solution can be viewed as the best-response (i.e., the maximal payoff) when I believe that the other player will always be able to choose the thing that hurts me the most.

Prisoners’ dilemma 12 2,25,0 0,53,3 Confess Don’t Confess Ned Kelly Note that no matter what Ned does, Kelly is better off if she confesses than if she does not confess. So ‘confess’ is a dominant strategy from Kelly’s perspective. We can predict that she will always confess.

Nash Equilibrium Suppose you decide to look at the best choice for both of you. Clearly, ”not confess” is best for both. Assuming both of you pick that “best for both solution” – You observe that if you confess, your utility improves. – You observe that if the other player confesses, HIS utility improves. – You notice that if you both confess, neither player has the motivation to change his mind. A Nash equilibrium is a set of solutions where every player's choice is a best response to every other player's choice. In other words, the equilibrium solution is made up of a set of individual choices that make up a joint action from which neither benefits by deviating. 13

Nash Equilibrium – (Beautiful Mind) In general, we will say that two strategies s 1 and s 2 are in Nash equilibrium if: 1.under the assumption that agent i plays s 1, agent j can do no better than play s 2 ; and 2.under the assumption that agent j plays s 2, agent i can do no better than play s 1. Neither agent has any incentive to deviate from a Nash equilibrium- it is stable Unfortunately: 1.Not every interaction scenario has a Nash equilibrium 2.Some interaction scenarios have more than one Nash equilibrium 14

Criteria for evaluating systems Social welfare: max outcome ∑ i u i (outcome) where u i is the utility for player i. Surplus: social welfare of outcome – social welfare of status quo – Constant sum games have 0 surplus (as all options sum to same total). Markets are not constant sum Pareto efficiency: An outcome o is Pareto efficient if there exists no other outcome o’ such that some agent has higher utility in o’ than in o and no agent has lower utility – if we maximize social welfare we have pareto optimal, but not vice versa – Not a very useful way of selecting strategies Individual rationality: Agent will do what is best for him Stability: No agents can increase their utility by changing their strategies (given everyone else keeps the same strategy). If I knew what my opponent would do, would I still be satisfied with my decision? Symmetry: I get same utility as you if our roles were reversed. No dictator: no agent is inherently preferred. 15

Example: Prisoner’s Dilemma Two people are arrested for a crime. If neither suspect confesses, both get light sentence. If both confess, then they get sent to jail. If one confesses and the other does not, then the confessor gets no jail time and the other gets a heavy sentence. (Actual numbers vary in different versions of the problem, but relative values are the same) 16 2,2 5,0 0,53,3 Confess Don’t Confess Dominant Strategy Equil not pareto optimal Maximize social welfare Don’t Confess Pareto optimal

Pareto Optimal Both maximin and Nash equilibrium solutions are pretty pessimistic; they frame the problem as a competitive game between my interests and your interests. This competition is not healthy because they both produce a solution (to prisoners dilemma) with both confessing, and both therefore receiving next to least favorite outcome of all possibilities (5,3,2,0). The idea behind Pareto optimality is that some joint solutions should obviously be avoided because they are bad for everyone. 17

Stated as ordinal (position) rather than cardinal (how much) values… 18 2,24,1 1,43,3 DefectCooperate Defect

The term pareto efficient… The term pareto efficient is named after Vilfredo Pareto, an Italian economist who used the concept in his studies of economic efficiency and income distribution. He is also the one credited with the 80/20 rule to describe the unequal distribution of wealth in his country, observing that twenty percent of the people owned eighty percent of the wealth. If an economic system is not Pareto efficient, then it is the case that some individual can be made better off without anyone being made worse off. It is commonly accepted that such inefficient outcomes are to be avoided, and therefore Pareto efficiency is an important criterion for evaluating economic systems and political policies. 19

Strategic Dominance One of my actions is better than my other choices regardless of what my opponent picks. 20 (Example is a non-symmetric game) P1 is always better off by playing C Is there a dominant strategy for P2? (No, why?) A strategically dominant solution is a solution which is a best response for every possible choice made by the other players.

Satisficing Equilibrium There are other, non-traditional solution concepts that are relevant for multi-agent games. One of these solution concepts is the notion of satisficing equilibrium. The word satisfice means to strive for something that is sufficient. A satisficing equilibrium occurs when agents have arrived at choices such that the consequence produced by these choices yields utilities that all agents are satisfied with. It is an equilibrium because a satisficing agent is content with what they have. If all agents are content, no agent has an incentive to change its actions, which means that the solution is stable. In real world, may not know (or have resources to evaluate) all options, but can make a decision knowing that it is “good enough” 21

At seats: Show in normal form- wrestling there is a widespread practice in high school wrestling where the participants intentionally lose unnaturally large amounts of weight so as to compete against lighter opponents. In doing so, the participants are clearly not at their top level of physical and athletic fitness and yet often end up competing against the same opponents anyway, who have also followed this practice (mutual defection). The result is a reduction in the level of competition. Yet if a participant maintains their natural weight (cooperating), they could compete against a stronger opponent who has lost considerable weight. 22

Utility: inconvenience (0,-1) + competitive advantage (-3,3) Losing to competeCompete at normal weight Losing to compete -1, -12, -3 Compete at normal weight -3,20,0 23 So what is best option?

Game of Chicken Consider another type of encounter — the game of chicken: (Think of James Dean in Rebel without a Cause) Difference from prisoner’s dilemma: Mutually going straight is most feared outcome. (Whereas sucker’s payoff is most feared in prisoner’s dilemma.) straightswerve straight-10, -1010, 5 swerve5, 107, 7 24 Kelly Ned

Game of Chicken Is there a dominant strategy? Is there a pareto optimal (can’t do better without making someone worse)? Is there a “Nash” equilibrium – knowing what my opponent is going to do, would I be happy with my decision? straightswerve straight-10, -1010, 5 swerve5, 107, 7 25

Try this one Is there a dominant strategy? Is there a pareto optimal (can’t do better without making someone worse)? Is there a “Nash” equilibrium – knowing what my opponent is going to do, would I be happy with my decision? coopdefect coop5,50,0 defect0,010,10 26

And this one Is there a dominant strategy? Is there a pareto optimal (can’t do better without making someone worse)? Is there a “Nash” equilibrium – knowing what my opponent is going to do, would I be happy with my decision? coopdefect coop1,04,3 defect3,35,2 27

And this one Is there a dominant strategy? Is there a pareto optimal (can’t do better without making someone worse)? Is there a “Nash” equilibrium – knowing what my opponent is going to do, would I be happy with my decision? coopdefect coop1,04,3 defect3,35,2 28

Free Rider described by Poundstone It's late at night, and there's no one in the subway station. Why not just hop over the turnstiles and save yourself the fare? But remember, if everyone hopped the turnstiles, the subway system would go broke, and no one would be able to get anywhere. What's the chance that your lost fare will bankrupt the subway system? Virtually zero. The trains run whether the cars are empty or full. In no way does an extra passenger increase the system's operating expenses. But if everybody thinks this way 29

Normal form game* (matching pennies) 30 Agent 1 Agent 2 H H T T -1, 1 1, -1 *aka strategic form, matrix form Action Outcome Payoffs

Extensive form game (matching pennies) 31 Player 1 Player 2 H H H T T T (-1,1) (1,-1) Action Terminal node (outcome) Payoffs (player1,player 2) Player 2 doesn’t know what has been played so he doesn’t know which node he is at.

Strategies Strategy: – A strategy, s j, is a complete contingency plan; defines actions which agent j should take for all possible states of the world. In these simple games, the state is always “the beginning”. Strategy profile: s=(s 1,…,s n ) – what each agent did (assuming n players). – s -i = (s1,…,s i-1,s i+1,…,s n ) - what everyone else did Utility function: u i (s) – Note that the utility of an agent depends on the strategy profile, not just its own strategy – We assume agents are expected utility maximizers 32

Normal form game* (matching pennies) 33 Agent 1 Agent 2 H H T T -1, 1 1, -1 *aka strategic form, matrix form Strategy for agent 1: H Strategy for agent 2: T Strategy profile (H,T) U 1 ((H,T))=1 U 2 ((H,T))=-1

Battle of the Sexes 34 2,24,3 3,41,1 Shopping Fishing Shopping Wife preference Husband preference Consider the famous game of Battle of the Sexes. In the game, a husband and wife must independently decide on a date activity. The husband would prefer one form of entertainment, say fishing, and the wife would prefer another form of entertainment, say shopping for clothes. Although both have their most preferred activity, both prefer being together to being alone.

Maximin Worst Choice Fishing Shopping Wife preference Husband preference Wife Looks at worst option for her. Pick solution with maximizes

Reactions Maximin – both should be selfish (and do what they want). Not a great solution as if either “defects” (from the selfish choice) makes both happier. Is better than worst case of (1,1) In fact, either consequence that results when one is selfish and the other unselfish dominates (in the Pareto-optimal sense) the maximin solution, and both of these consequences are in equilibrium (since neither player benefits by unilaterally changing his/her mind). Unfortunately, with no way to communicate the players are left with making independent choices to try and reach an equilibrium. 36

Reaction? Could just randomly pick a strategy – Termed mixed strategy. How do you think that would work?

Battle of the sexes (cont) Additionally, using a mixed strategy (picking each option a fraction of the time) does not help their chances. In fact, the expected payoffs for two independent mixed strategies are pretty bad; if both randomly choose, the expected payoff is only not much better than the maximin value. For your information, the set of possible payoffs for all possible combinations of mixed strategies are illustrated below. 38

39 Shows how various combinations of mixed strategies interact. Randomly pick a mixed strategy for each, then plot the result.

Battle of the Sexes 40 2,2 (4/9) 4,3 (2/9) 3,4 (2/9) 1,1 (1/9) Shopping 2/3 Fishing 1/3 Fishing 2/3 Shopping 1/3 Wife preference Husband preference Suppose husband picks fishing 2/3 of the time and wife picks 2/3 shopping. utility: 2*4/9 + 4*2/9 + 3*2/9 + 1(1/9) = 2.56

A simple competition game 41 60, 6036, 7036, 35 70, 3650, 5030, 35 35, 3635, 3025, 25 High Medium Low Pierce Donna Note – no player has a dominant strategy. But low is dominated for both players. So we can predict that neither will play low. Remove it.

Iterated Elimination of Dominated Strategies Let R i  S i be the set of removed strategies for agent i Initially R i =Ø Choose agent i, and strategy s i such that s i  S i \R i (S i subtract R i ) and there exists s i ’  S i \R i such that Add s i to R i, continue Theorem: If a unique strategy profile, s*, survives iterated elimination, then it is a Nash Eq. Theorem: If a profile, s*, is a Nash Eq then it must survive iterated elimination. 42 ui(s i ’,s -i )>ui(s i,s -i ) for all s -i  S -i \R -i

A simple competition game 43 60, 6036, 70 70, 3650, 50 High Medium Low Pierce Donna Once we have removed low, medium is now a dominant strategy for both. So we predict that both Pierce and Donna will play medium.

Example – Zero Sum (most vicious) (We divide the same cake. If I lose, you win.) Bi matrix form (show utilities separately each player) Cake slicing Two players – cutter – chooser Cutter's Utility Choose bigger piece Choose smaller piece Cut cake evenly ½ - a bit½ + a bit Cut unevenly Small pieceBig piece Chooser's Utility Choose bigger piece Choose smaller piece Cut cake evenly ½ + a bit½ - a bit Cut unevenly Big pieceSmall piece 44

Zero Sum Scientists debate whether zero sum scenarios really exist. However, many TREAT situations as if they did. 45

Rationality – each player will take highest utility option – taking into account the other player's likely behavior In example – if cutter cuts unevenly he might like to end up in the lower right but the other player would never do that – -10 – if the current cuts evenly, he will end up in the upper left – -1 this is a stable outcome – neither player has an incentive to deviate Cutter's Utility Choose bigger piece Choose smaller piece Cut cake evenly (-1, +1)(+1, -1) Cut unevenly (-10, +10)(+10, -10) 46

Other Symmetric 2 x 2 Games Given the 4 possible outcomes of (symmetric) cooperate/defect games, there are 24 possible orderings on outcomes (showing preference for first player) – CC  CD  DC  DD Cooperation dominates – DC  DD  CC  CD Defect dominates Deadlock. You will always do best by defecting – DC  CC  DD  i CD Prisoner’s dilemma – DC  CC  CD  DD Chicken – CC  DC  DD  CD Stag hunt 47