1 CRP 834: Decision Analysis Week Five Notes. 2 Review Game Theory –Game w/ Mixed Strategies Graphic Method Linear Programming –Games In an Extensive.

Slides:



Advertisements
Similar presentations
Concepts of Game Theory I
Advertisements

The Basics of Game Theory
A Short Tutorial on Cooperative Games
Ultimatum Game Two players bargain (anonymously) to divide a fixed amount between them. P1 (proposer) offers a division of the “pie” P2 (responder) decides.
Two-Person, Zero-Sum Game: Advertising TV N TVN 0 TV N TVN Column Player: Row Player: Matrix of Payoffs to Row.
© 2009 Institute of Information Management National Chiao Tung University Game theory The study of multiperson decisions Four types of games Static games.
Weighted Voting When we try to make collective decisions, it is only natural to consider how things are done in society. We are familiar with voting for.
Negotiating a stable distribution of the payoff among agents may prove challenging. The issue of coalition formation has been investigated extensively,
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.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
1 Game Theory. By the end of this section, you should be able to…. ► In a simultaneous game played only once, find and define:  the Nash equilibrium.
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)
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.
Network Theory and Dynamic Systems Game Theory: Mixed Strategies
Chapter 11 Game Theory and the Tools of Strategic Business Analysis.
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Thursday. 2.No new reading for Thursday, should be done with Ch 8, up to page.
Dynamic Games of Complete Information.. Repeated games Best understood class of dynamic games Past play cannot influence feasible actions or payoff functions.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Chapter 14 Game Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole, a.
Algorithmic Game Theory - Basic Solution Concepts and Computational Issues Éva Tardos and Vijay V. Vazirani Presentation Reiknirit, rökfræði og reiknanleiki.
The Prisoner’s Dilemma -Both arrested during botched bank robbery. -Kept in separate cells – NO COMMUNICATION. -Offered separate deals if they confess.
Strategic Decisions Making in Oligopoly Markets
GAME THEORY By Ben Cutting & Rohit Venkat. Game Theory: General Definition  Mathematical decision making tool  Used to analyze a competitive situation.
Cooperative/coalitional game theory Vincent Conitzer
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’,
Chapter 11 Game Theory and Asymmetric Information
Game-Theoretic Approaches to Multi-Agent Systems Bernhard Nebel.
Cooperative/coalitional game theory A composite of slides taken from Vincent Conitzer and Giovanni Neglia (Modified by Vicki Allan) 1.
Prisoners Dilemma rules 1.Binding agreements are not possible. Note in Prisoners dilemma, if binding agreements were possible, there would be no dilemma.
Taxation and Stability in Cooperative Games Yair Zick Maria Polukarov Nick R. Jennings AAMAS 2013.
Cooperative/coalitional game theory A composite of slides taken from Vincent Conitzer and Giovanni Neglia (Modified by Vicki Allan) 1.
The Allocation of Value For Jointly Provided Services By P. Linhart, R. Radner, K. G. Ramkrishnan, R. Steinberg Telecommunication Systems, Vol. 4, 1995.
Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
Cooperative/coalitional game theory A composite of slides taken from Vincent Conitzer and Giovanni Neglia (Modified by Vicki Allan) 1.
Game Theory Objectives:
Cooperative/coalitional game theory A composite of slides taken from Vincent Conitzer and Giovanni Neglia (Modified by Vicki Allan) 1.
Game Theory.
Anonymizing Web Services Through a Club Mechanism With Economic Incentives Mamata Jenamani Leszek Lilien Bharat Bhargava Department of Computer Sciences.
The Agencies Method for Coalition Formation in Experimental Games John Nash (University of Princeton) Rosemarie Nagel (Universitat Pompeu Fabra, ICREA,
Game Theory.
Starbucks, Beating The Prisoners Dillema Brooke Hatcher Econ 202 April 28 th, 2012.
Game Theory.
Game Theory, Strategic Decision Making, and Behavioral Economics 11 Game Theory, Strategic Decision Making, and Behavioral Economics All men can see the.
1 Efficiency and Nash Equilibria in a Scrip System for P2P Networks Eric J. Friedman Joseph Y. Halpern Ian Kash.
Lecture 4: N-person non zero-sum games
McGraw-Hill/Irwin Copyright  2008 by The McGraw-Hill Companies, Inc. All rights reserved. GAME THEORY, STRATEGIC DECISION MAKING, AND BEHAVIORAL ECONOMICS.
Chapter 14 Game Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole, a.
1 CRP 834: Decision Analysis Week Four Notes. 2 Review Game Theory –Classification and Description –Two Person Zero-Sum Game Game w/ Dominating Strategy.
Chapter 11 Game Theory Math Game Theory What is it? – a way to model conflict and competition – one or more "players" make simultaneous decisions.
Game theory and competitor analysis Paul C. Godfrey Mark H. Hansen Brigham Young University.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
Chapter 12 - Imperfect Competition: A Game-Theoretic Approach Copyright © 2015 The McGraw-Hill Companies, Inc. All rights reserved.
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.
What games do economists play? To see more of our products visit our website at Tom Allen, Head of Economics, Eton College.
Part 3 Linear Programming
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 Some details on the Simplex Method approach 2x2 games 2xn and mx2 games Recall: First try pure strategies. If there are no saddle points use mixed.
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.
ECO290E: Game Theory Lecture 3 Why and How is Nash Equilibrium Reached?
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.
A Novel Coalitional Game Model for Security Issues in Wireless Networks Xiaoqi LiMichael Lyu Computer Science and Engineering Department The Chinese University.
Contents of the Talk Preliminary Materials Motivation and Contribution
Game Theory Developed to explain the optimal strategy in two-person interactions. Initially, von Neumann and Morganstern Zero-sum games John Nash Nonzero-sum.
Game Theory Solutions 1 Find the saddle point for the game having the following payoff table. Use the minimax criterion to find the best strategy for.
The effect of punishment on cooperation in public good dilemmas with uncertainty about endowments Ori Weisel & Gary Bornstein Kyoto, August 2009.
Presentation transcript:

1 CRP 834: Decision Analysis Week Five Notes

2 Review Game Theory –Game w/ Mixed Strategies Graphic Method Linear Programming –Games In an Extensive Form

3 Two-Person Non-Zero Sum Games Prisoner’s Dilemma –Two prisoners held in separated jail cells No confession : Both set free (4) Both confess: Moderate jail term (2) One confesses, the other not: Reward (5) & severe punishment (0) Prisoner 2 Don’t ConfessConfess Prisoner 1Don’t Confess(4,4)(0,5) Confess(5,0)(2,2)

4 Equilibrium Points w/ Non-Zero Sum Games Strategies: –Player 1: (x 1, x 2,…,x i,…,x m ) = X (1xm) –Player 2: (y 1, y 2,…,y i,…,y n ) = Y (n*1) Payoffs: –Player 1: P 1 ij  P 1 (1xm) –Player 2: P 2 ij  P 2 (nx1) Expected payoffs: –Player 1: XP 1 Y=∑∑x i y j P 1 ij –Player 2: XP 2 Y=∑∑ x i y j P 2 ij X*, Y* is an equilibrium solution if (Player 1) XP 1 Y* ≤ X*P 1 Y* for all x (Player 2) X*P 2 Y ≤ X*P 1 Y* for all y.

5 Cooperative Game A nonconstant sum game in which the players can discuss their strategies before play and make binding agreements on strategies they will employ (i.e., they can form coalitions) Basic Problem: how to divide the coalition payoff among the members. Analyzed through the characteristic function (payoff function) of all possible coalitions.

6 Characteristic Function (Payoff function) V(N)  Grand coalition payoff (N) V(i)  Individual payoff V(S)  Coalition S payoff (1<S<N) Example:( Game in a 0-1 normalized form) Case of 3 players with benefits  (convention)    (Q) How to distribute the benefits of grand payoff among players?

7 Distribution of Benefits Grand Coalition Condition Group Rationality Individual Rationality CORE: a set of imputations satisfying “coalition rationality”

8 Shapley Value An imputation based on the power of each of the players A unique imputation is always produced by the Shapley value. Power of Player: Shapley value of player i: Probability to join the coalition s s = number of players in s n= number of players in total population.

9 Shapley Value  n (s) is simply the probability that a player joins coalition s. (A) Probability for the size of coalition S out of N  Binomial probability = # of coalition of size s that can be formed out of n participants (B) Probability that a specific coalition will be chosen – (C) # of players that can join this coalition s = (n-s) (D) Probability that a specific player I will join a coalition 1/(n-s) Therefore, the probability that a player I joins coalition s is:

10 Shaply Value of Player 1 Example: Player 1 (n=3) SPower of Player Weights(  )Shapley Value (  i 1 )   (1) -  (Ø) = 0,  (1,2)-  (2) = 0.1,  (1,3)-  (2) = 0.2,  (1,2,3)-  (2,3) = 0.8 2/6 1/6 2/6 0 1/60 2/60 16/60 ∑  i =1∑  i 1 =19/60  1 =19/60,  2 =19/60,  3 =22/60 ∑  i =1. V(1,2,3)=1

11 Application: Method for apportioning costs among participants in regional systems (Giglio and Wrightington, 1972) (Q) How to allocate cost for wastewater treatment facilities among three communities considering pollution standards and geography of the site. River A B C ? ?

12 For various combinations: Water PollutionCost P A =10 P B =20 P C =50 C A =20 C B =32 C C =48 C AB =45 C BC =60 C AC =60 C ABC =78 Application: Method for apportioning costs among participants in regional systems (Giglio and Wrightington, 1972)

13 Methods for Apportioning costs (Giglio and Wrightington, 1972) Cost sharing based on the measure of pollution Cost sharing based on single plant costs with a rebate proportional to the measure of pollution Cost sharing based on the separable costs remaining benefit method Cost Sharing Based on Bargaining Including the Regional Authority as a Participant

14 Method 1:Cost sharing based on the measure of pollution Each user pays an amount directly proportional to the amount of pollution he produces All polluters are treated equally. A pays 9.75 (=78*(10/80)), B 19.50, and C Notice: C pays more than he would if he decided to treat his waste alone This anomaly would arise if one user has a favorable geographic location (i.e. near to the river receiving the effluent)

15 Method 2: Cost sharing based on single plant costs with a rebate proportional to the measure of pollution Assumption: the rebate is proportional to the measure of pollution. C A + C B +C C = 100 (C A =20, C B =32, C C =48) C ABC = 78 (rebate = 22) A pays (=20-22*(10/80)), B 26.5, and C (Total = 78) Note that B+C = > C BC =60

16 Method 3: Cost sharing based on the separable costs remaining benefit method Uses the cost of alterative to determine the minimum cost that each community should assume. C ABC –C AB =33  C added 33 C ABC -C BC =18  A added 18 C ABC -C AC =18  B added 18 ∑ =69  C ABC =78 (need to add 9) Then allocate 9 proportional to the measure of pollution. A  , B  20.25, C  (∑ =78)

17 Method 4: Cost Sharing Based on Bargaining Including the Regional Authority as a Participant What is needed to make the regional plan work when there is no natural stable (feasible) solution (  subsidy & tax) Design of a specific core using different weighting factors: (cf: 2x 1 +2X 2 +10x 3 )