CCST9017. Hidden Order in Daily Life:
|
|
- Amanda Ferguson
- 5 years ago
- Views:
Transcription
1 CCST9017 Hidden Order in Daily Life: A Mathematical Perspective Lecture 4 Shapley Value and Power Indices I Prof. Patrick,Tuen Wai Ng Department of Mathematics, HKU
2 Example 1: An advertising agent approaches three movie stars, 1, 2, and 3, and asks them to sign an advertisement contract to promote certain soft drink. The agent says that he is interested in obtaining at least two signatures. If 1 and 2 sign, the agent will pay them a total of $100k(=$100,000). If 1 and 3 sign, the agent will pay them a total of $100k. On the other hand, if 2 and 3 sign, the agent will only pay them a total of $50k.
3 If all three agree to sign, the agent will pay them a total of $120k. In this example, the formation of a coalition means the agreement of its members to sign an advertisement: The mathematical model is: N= {1, 2, 3} (set of all players) Possible coalitions (subsets) and the value they generated: Ø (the empty set), {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3} (the grand coalition) v(ø ) = v(1)=v(2)=v(3)=0; v(1,2)=v(1,3)=100; v(2,3)=50; v(1,2,3)=120 Question: Which coalition will be formed?
4 In discussing coalition games, we can focus on how players bargain with each other over how to divide the payoff that they can achieve in a game by banding together and joining forces in a coalition. We shall now present a possible example of negotiations between players in the game described above: Player 2 proposes an equal division to Player 1: (50,50, 0) Player 3, who might get nothing, proposes to 1: (60,0,40)
5 Player 2 lowers his demands so he won't be left out: (70, 30, 0) Player 3 is prepared to settle for: (80, 0, 20) Player 2 turns to player 3 and proposes: (0, 25, 25) Player 1 is forced to compete and proposes: (70, 0,30) Player 2 suggests forming a coalition of all participants with a payoff division of: (70, 20, 30) If all players reach agreement at this stage, the game terminates, and it is said that the outcome of the game is (70,20,30) and that the coalition {1, 2, 3} was formed.
6 There is a rich theory that attempts to describe what outcomes are likely to form, but it is beyond the scope of this course. L.C.Thomas, Games, Theory and Applications Philip D. Straffin, Game Theory and Strategy. MATH3911 Game Theory and Strategy Instead, we address the question of what a judge is likely to decide if the three players decide to form a coalition and bring the game before him and ask him to propose a fair'' division of the total $120k.
7 Example 2: 24 Hours McDelivery (2014) After the lecture, Feel hungry
8 $20.3 Amy Clara $12.5 Betty $13.4
9 Order a Big Mac Meal $37.6
10 Use a Diagram/ Function to Model It Set of all players N = {1, 2, 3} where 1= Amy, 2= Betty, 3= Clara Can form different coalitions (subsets): Ø (the empty set), {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3} (the grand coalition) Payment for different coalitions: v(ø)=0; v(1)=20.3; v(2)=13.4; v(3)=12.5; v(1, 2)=33.7; v(1, 3)=32.8; v(2, 3)=25.9; v(1, 2, 3)=37.6 How to split the bill if they agree to order the Big Mac Meal?
11 Cooperative Games Games in coalitional form A solution concept for cooperative games----- Shapley value Shapley-Shubik power index for weighted voting power (will cover in the next lecture) Lloyd Shapley ( )
12 Lloyd S. Shapley Born in June 2, Graduated from Harvard with an A.B. in Mathematics in Awarded a PhD (Math) from Princeton in 1953 under the direction of Alan W. Tucker (supervisor of Johan Nash and introduced the game Prisoner s Dilemma). A Professor Emeritus at UCLA, affiliated with Departments of Mathematics and Economics. I m a mathematician, I m not an economist. Lloyd Shapley ( )
13 Nobel Prize in Economics (2012) Shapley was awarded the John von Neumann Theory Prize of the Institute for Operations Research and the Management Sciences in With Alvin E. Roth, Shapley won the 2012 Nobel Memorial Prize in Economic Sciences "for the theory of stable allocations and the practice of market design." Lloyd Shapley is the most important researcher in the filed of cooperative game theory. from dvanced-economicsciences2012.pdf
14 Nobel Prize in Economics (2012) The Shapley value has played a major role in the development of cooperative game theory, with a large variety of applications. The most important single-valued solution concept in cooperative game theory is the Shapley value. anced-economicsciences2012.pdf
15 Cooperative Games We now turn to the theory of cooperative games, where the focus of interest is the way in which the players bargain together over the division of the available payoff, rather than the way this payoff can be attained by the use of certain strategies. A large part of the theory of cooperative games deals with games in coalitional form or coalition function games.
16 Coalitions Let n 2 be the number of players in the game, numbered from 1 to n, and let N = {1, 2,..., n} be the set of players. A subset S of N (S N) is called a coalition and the set of all coalitions is denoted by 2 N. For example, if there are 3 players, i.e., N={1,2,3}, then we have 8 coalitions and 2 N ={Ø, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3},N}. The empty set, Ø is called the empty coalition while N is called the grand coalition.
17 Coalitional Form Definition. A game in coalitional form (N;v) consists of 1) a set N (the set of all players), and 2) a real-valued function v defined on 2 N ={S:S N} such that v(ø ) = 0. The function v is called the coalition function/characteristic function. The number v(s) is called the value or worth of the coalition S. We may think it this way, whenever a coalition S is formed, an amount of (transferable) utility or money or power or cost v(s) is generated.
18 Example 3: One Seller and Two Buyers Game Player 1 has a house which she values at $100,000 and offers it for sale. There are two potential buyers, Player 2 and 3, who each has $200,000 in cash, and value the house at $200,000. We can then model this situation as a game in coalitional form or coalitional game. Here the values are measured in the units of $100,000. First of all, let N={1,2,3}. The characteristic function v is given by: v(ø )=0 [by definition], v(1)=1,v(2)=v(3)=2 [initial conditions].
19 One Seller and Two Buyers Game v(1,2)=[0+ p]+[(2-p)+2]=4. It is because if player 1 and player 2 form a coalition and player 1 sells the house to 2 for some price p (1<p 2). Player 1 will then have p units in cash and player 2 will have 2-p units plus a house he values at 2 units. Hence the total wealth of the coalition is 4 units. v(1,3)=4, [for the same reasons]. v(2,3)=2+2=4. What should be v(1,2,3)?
20 One Seller and Two Players Game The formation of coalition {1,2,3} denotes a procedure in which all players take part. Such a procedure may be carried out as follows. Player 1 can sell the house to either player 2 or player 3. Suppose player 1 is thinking to sell the house to player 2 for some price p>1. Then we must have p=2 because if p < 2, then player 3 can offer q (>p) to player 1. So eventually we have v(1,2,3)=[0+2]+[(2-2)+2]+[2]=6.
21 Example 4: Weighted Voting Games In a voting body like a parliament, the players are parties and every party has a certain number of representatives. For example, a certain country with three parties in its parliament obtained the following election results: Party 1: 5 representatives; Party 2: 3 representatives; Party 3: 7 representatives. The number of representatives of party i is called the weight'' of party i and will be denoted by w i. In our example, w 1 = 5, w 2 = 3, w 3 = 7.
22 Example 4: Weighted Voting Games To pass a bill, we need the votes of at least half of members. Can model it as the following cooperative game (N; v) : N={1,2,3}, v is defined by v(s) = 1 if Σ i S w i 8 v(s) = 0 if Σ i S w i < 8 Remark: Σ i S means summing over i inside S. Party 2 has only 3 members but quite often both Party 1 and Party 3 needs the support from Party 2 in order to pass a motion. Question: How to measure the political power of each party?
23 Main Question: Given that the grand coalition N is formed, how should the players share the coalition worth among themselves? Each theory that attempts to answer this question is called a solution concept. We shall study one particular solution concept, namely, the Shapley value, which can be regarded as a division of money that an unbiased judge is likely to recommend. One possible way to obtain a solution concept is to lay down rules (axioms) that will enable an unbiased judge to suggest an allocation of v(n) among the players.
24 Axiomatic Approach We shall present a simple system of four conditions or axioms and show that this system of axioms offers the unbiased judge an opportunity to decide how to divide v(n) fairly among the players in any given game. The axioms presented later were first formulated in 1953 by Lloyd Shapley, who showed that indeed they dictate to the judge how to decide in every case. The division of payoffs according to this decision is called the Shapley value.
25 Value Functions A value function,, is function that assigns to each possible coalition function v of an n-person game (N;v), an n-tuple or vector, (v) = ( 1 (v), 2 (v),...., n (v)) of real numbers. i (v) (or simply i ) represents the worth or value of player i in the game with coalition function v. We shall impose four conditions/axioms of fairness on the vector (v) = ( 1 (v), 2 (v),...., n (v)).
26 Symmetric Players Definition: Players i and j of the game (N;v) are substitutes or symmetric players in the game (N;v) if for all subset S containing neither i nor j, v(s {i}) = v(s {j}) In particular, if S = Ø, we have v(i) = v(j). Two players are symmetric in the game if they can replace each other in every coalition that contains one of them; that is, if one player replaces the other the coalition worth does not change.
27 Null Players Definition: A player i of (N;v) is called a null player if v(s {i}) = v(s) for all S N. In particular, take S=Ø, we have v(i)=0. This simply means a null player does not contribute anything through his/her participation in any coalition.
28 Sum of Games Definition: The game (N;v) is called the sum of two games (N;u) and (N;w) if for every coalition S N, v(s)=u(s)+w(s) This definition is also correct in the other direction; that is, given any game (N;v), it is possible to split it into two games whose sum is the original game, for example
29 Shapley Value A Shapley value or value on N is a value function satisfying the following four conditions: 1. Symmetry condition: if i and j are symmetric players in (N;v), then i (v)= j (v) 2. Null player condition: if i is a null player, then i (v)= 0 3. Efficiency condition: Σ i N i (v) = v(n) 4. Additivity condition: i (v + w) = i (v) + i (w), for all i in N.
30 Remark The efficiency condition is reasonable, because the players want to divide among themselves everything they can achieve in the game when they unite, namely, exactly v(n). The additivity condition says that if we split the original game into a sum of individual games, the division of payoffs among the players in the original game should be the sum of divisions obtained in the individual games. The additivity condition is kind of artificial, but it provides a simple way to do the calculation.
31 Example (Ein-Yu Gura and Michael B. Maschler): Consider N ={1,2,3}, v(ø )=0, v(1) = 6, v(2) = 12, v(3) = 18, v(1,2) = 30, v(1,3) = 60, v(2,3) = 90, v(1,2,3) = 120 Classwork 1. Draw a figure to represent this game. 2. Is there any symmetric player or null player in this game? Answer:
32 Find the Shapley Value of the Game This game can be split into a sum of very simple games so that there will be null players and/or symmetric players in every game. We can then calculate the Shapley value of these games by the axioms above, and then, by the additivity axiom, we can calculate the Shapley value of the original game.
33 Find the Shapley Value of the Game We now present one way of splitting the original game into games in which there are mainly null players and/or symmetric players.
34 How is This Split Achieved? First, we split the original game into two games. We then split the right-hand game into two games.
35 We can again split the right-hand game into two games. And so on. Explanation: The split presented above is not random. At every stage we split the game into two games, one of which has a special property; namely, it contains a coalition T such that v(t) = v(s) whenever S contains T and v(s) = 0 for every other coalition. Such a game is called a carrier game and the coalition T is called its carrier.
36 Carrier Game Definition: A carrier game (N; v) is a game in which there is a coalition T, called the carrier of the game, such that v(s) = v(t), whenever T S; v(s) = 0, otherwise. In the first three games the carriers are {1}, {2}, and {3}. The fourth game is obtained by splitting the following game: The carrier coalition in the fourth game is {1,2}.
37 Why Did We Split the Game in This Way? We now present one way of splitting the original game into games in which there are mainly null players and/or symmetric players.
38 Find the Shapley Value of the Game If we examine the diagram of the split, we can calculate the following values: (6,0,0) (0,12,0) (0,0,18) (6,6,0) (18,0,18) (0,30,30) + (-8, -8, -8) (22,40,58) Ultimately, by the additivity axiom, the value obtained is the Shapley value of the original game. In general, Shapley established a unique value for every game.
39 Theorem 1 (Shapley, 1953): There exists a unique Shapley = ( 1,..., n ). Theorem 2 (Shapley, 1953): The Shapley value is given by = ( 1,..., n ), where for i = 1,..., n, i =1/n!Σ all permutations [v(n i {i}) v(n i )]. where N i represents the set of players preceding i in N corresponding to the permutation on N. Here, n!=1x2x3 xn is the total number of permutations of the set N and means union (e.g. {1,2} {4}={1,2,4}). Also, Σ means summation.
40 Example: The permutation = [3,2,5,4,1] is a mapping sending 1 to 3, 2 to 2, 3 to 5, 4 to 4 and 5 to 1. Example: For the permutation = [3,2,5,4,1], we have Classwork: N 4 = {3,2,5}. 3. For the permutation = [2,3,4,5,1], find N 5 and N 5 {5}? Answer:
41 Shapley s Formula Recall that the Shapley value should measure the overall significance of a player in the game. For example, when player i enters a coalition S, he receives the marginal contributions by which his entry increases the value of the coalition S he enters, i.e. v(s {i}) v(s). Of course, this measure of the marginal contributions/significance of player i depends on the coalition S he enters and we need to take into account the contributions of all possible coalition S.
42 Shapley s Formula So we take all possible orders of the players and average the corresponding marginal contributions. This is the reason why we would like to consider the difference [v(n i {i}) v(n i )] which measures the contribution of i when he joins N i. This explains the formula of the Shapley value stated in the above theorem.
43 Example 1 Recall that N ={1,2,3}, v(ø ) = v(1)=v(2)=v(3)=0; v(1,2)=v(1,3)=100; v(2,3)=50; v(1,2,3)=
44 i =1/n!Σ all permutations [v(n i {i}) v(n i )]. In order to compute the Shapley value for this game, we first notice that there are 3! =3x2x1=6 orderings/permutations of the 3 players: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2] and [3,2,1]. marginal contributions: [v(n i {i}) v(n i Permutation )] i 340 / / /
45 Therefore, (v) = (170/3,95/3, 95/3) The Shapley value shows that Player 1 should gets more than the other two players and this reflects the fact that Player 1 is actually more valuable. Checking Since player 2 and 3 are symmetric players, 2 (v) = 3 (v). The efficiency condition should give Σ i N i (v) = 170/3+95/3+95/3=v(N)=v(1,2,3)=120
46 Assignment Four Due date: Oct 2 (before 1:00pm) Please put your assignment into the assignment box at the second floor, Hui Oi Chow Building. Please write your tutorial group number on the right hand corner of your assignment Question One Amy, Betty and Clara are planning to run a new hair salon. They have complementary skills and can offer three different services: Amy can do the shampoo blow dry; Betty can do the haircut; while Clara knows how to do the hot oil treatment.
47 Question One They agree to have the following menu for their hair salon: A) Shampoo Blow Dry: $125 B) Haircut: $130 C) Hot Oil Treatment: $200 D) Shampoo Blow Dry + Haircut + Hot Oil Treatment: $350 The price of any combination of the services not mentioned above would simply be the sum of the price of the individual services. a) Model the situation as a suitable cooperative game (N; v). b) Use a diagram to represent the game defined in part a).
48 Question One c) Since there is a big discount if one chooses "Shampoo Blow Dry + Haircut + Hot Oil Treatment", most customers would choose this service. In this case, Amy, Betty and Clara agree that they will split the income $350 among themselves according to the Shapley value of the game defined in part (a). Find the Shapley value of the game by using two different methods. Hence, find out the amount Amy, Betty and Clara should earn from a customer who has chosen "Shampoo Blow Dry + Haircut + Hot Oil Treatment.
49 Question Two (Joseph Malkevitch s example in Theoretical Mathematics Finds Use in Economics-- A Tribute to Lloyd Shapley ) Suppose three towns A, B, and C are under court orders to clean up their sewage, currently being sent to the ocean but with more bacteria than meets the law. Because of the different fixed costs involved, if the towns teamed up, they would lower their costs of meeting the state standards. To minimize the cost, the towns are willing the form coalitions and share the costs.
50 The different costs of cleaning up the sewage building the power station are summarized below: A s cost of cleaning up the sewage alone is $12 million B s cost of cleaning up the sewage alone is $6 million C s cost of cleaning up the sewage alone is $8 million A and B together would cost $15 million A and C together would cost $17 million B and C together would cost $11 million A, B and C together would cost $20 million
51 Question Two a) Model this situation as a game in coalitional form (N;v), where N={1,2,3} and v is the cost function. b) Assume the grand coalition N is formed. Find the Shapley value of the game by splitting the game into some suitable games. c) Suppose A s cost is decreased from $12 million to $11 million and all the other costs are unchanged. Find the new Shapley value of the game. Reading assignment Please read the article Theoretical Mathematics Finds Use in Economics--A Tribute to Lloyd Shapley (from Feature Column of AMS, September 2016)
52 Possible Project Topic: You may do a group project on labor share problem: Let there be one owner of capital and a large number of workers, what should be the reasonable share of the profit for the workers? References J Weinstein, Fairness and Tax Policy: A Response to Mankiw's Proposed Just Deserts, Eastern Economic Journal,
53 Possible Project Topic: You may do a group project on Shapley s Nobel winning work on stable allocations. References Gale, D.; Shapley, L.,College admissions and the stability of marriage. Am. Math. Mon. 1962, 69, opular-economicsciences2012.pdf dvanced-economicsciences2012.pdf
54 Reference: Ein-Ya Gura and Michael B. Maschler, Insights into Game Theory, Cambridge University Press, Philip D. Straffin, Game Theory and Strategy, MAA,1993. We will consider application of Shapley value in political science in the next lecture. Thank You!
Part 2. Cooperative Game Theory
Part 2 Cooperative Game Theory CHAPTER 3 Coalitional games A coalitional game is a model of interacting decision makers that focuses on the behaviour of groups of players. Each group of players is called
More informationExercises for Introduction to Game Theory SOLUTIONS
Exercises for Introduction to Game Theory SOLUTIONS Heinrich H. Nax & Bary S. R. Pradelski March 19, 2018 Due: March 26, 2018 1 Cooperative game theory Exercise 1.1 Marginal contributions 1. If the value
More informationArpita Biswas. Speaker. PhD Student (Google Fellow) Game Theory Lab, Dept. of CSA, Indian Institute of Science, Bangalore
Speaker Arpita Biswas PhD Student (Google Fellow) Game Theory Lab, Dept. of CSA, Indian Institute of Science, Bangalore Email address: arpita.biswas@live.in OUTLINE Game Theory Basic Concepts and Results
More informationLecture 10: Auction Mechanisms
Microeconomics I: Game Theory Lecture 10: Auction Mechanisms (see Osborne, 2009, Sect 3.5) Dr. Michael Trost Department of Applied Microeconomics January 17, 2014 Dr. Michael Trost Microeconomics I: Game
More informationComputational Aspects of Game Theory Bertinoro Spring School Lecture 2: Examples
Computational Aspects of Game Theory Bertinoro Spring School 2011 Lecturer: Bruno Codenotti Lecture 2: Examples We will present some examples of games with a few players and a few strategies. Each example
More informationGame Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2)
Game Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2) Yu (Larry) Chen School of Economics, Nanjing University Fall 2015 Extensive Form Game I It uses game tree to represent the games.
More informationWhat is... Game Theory? By Megan Fava
ABSTRACT What is... Game Theory? By Megan Fava Game theory is a branch of mathematics used primarily in economics, political science, and psychology. This talk will define what a game is and discuss a
More informationIntroduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2016 Prof. Michael Kearns Game Theory for Fun and Profit The Beauty Contest Game Write your name and an integer between 0 and 100 Let
More informationIntroduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns percent who will actually attend 100% Attendance Dynamics: Concave equilibrium: 100% percent expected to attend
More informationSF2972: Game theory. Plan. The top trading cycle (TTC) algorithm: reference
SF2972: Game theory The 2012 Nobel prize in economics : awarded to Alvin E. Roth and Lloyd S. Shapley for the theory of stable allocations and the practice of market design The related branch of game theory
More informationECON 282 Final Practice Problems
ECON 282 Final Practice Problems S. Lu Multiple Choice Questions Note: The presence of these practice questions does not imply that there will be any multiple choice questions on the final exam. 1. How
More informationLecture 10: September 2
SC 63: Games and Information Autumn 24 Lecture : September 2 Instructor: Ankur A. Kulkarni Scribes: Arjun N, Arun, Rakesh, Vishal, Subir Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer:
More informationECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly
ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly Relevant readings from the textbook: Mankiw, Ch. 17 Oligopoly Suggested problems from the textbook: Chapter 17 Questions for
More informationSF2972: Game theory. Introduction to matching
SF2972: Game theory Introduction to matching The 2012 Nobel Memorial Prize in Economic Sciences: awarded to Alvin E. Roth and Lloyd S. Shapley for the theory of stable allocations and the practice of market
More informationBANZHAF VALUE FOR GAMES ANALYZING VOTING WITH ROTATION* 1. Introduction
OPERATIONS RESEARCH AND DECISIONS No. 4 2014 DOI: 10.5277/ord140406 Honorata SOSNOWSKA 1 BANZHAF VALUE FOR GAMES ANALYZING VOTING WITH ROTATION* The voting procedure has been presented with rotation scheme
More informationBargaining Games. An Application of Sequential Move Games
Bargaining Games An Application of Sequential Move Games The Bargaining Problem The Bargaining Problem arises in economic situations where there are gains from trade, for example, when a buyer values an
More information2. The Extensive Form of a Game
2. The Extensive Form of a Game In the extensive form, games are sequential, interactive processes which moves from one position to another in response to the wills of the players or the whims of chance.
More informationResource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory
Resource Allocation and Decision Analysis (ECON 8) Spring 4 Foundations of Game Theory Reading: Game Theory (ECON 8 Coursepak, Page 95) Definitions and Concepts: Game Theory study of decision making settings
More informationECO 5341 Strategic Behavior Lecture Notes 3
ECO 5341 Strategic Behavior Lecture Notes 3 Saltuk Ozerturk SMU Spring 2016 (SMU) Lecture Notes 3 Spring 2016 1 / 20 Lecture Outline Review: Dominance and Iterated Elimination of Strictly Dominated Strategies
More informationDistributed Optimization and Games
Distributed Optimization and Games Introduction to Game Theory Giovanni Neglia INRIA EPI Maestro 18 January 2017 What is Game Theory About? Mathematical/Logical analysis of situations of conflict and cooperation
More informationChapter 30: Game Theory
Chapter 30: Game Theory 30.1: Introduction We have now covered the two extremes perfect competition and monopoly/monopsony. In the first of these all agents are so small (or think that they are so small)
More informationMath 464: Linear Optimization and Game
Math 464: Linear Optimization and Game Haijun Li Department of Mathematics Washington State University Spring 2013 Game Theory Game theory (GT) is a theory of rational behavior of people with nonidentical
More informationCooperative versus Noncooperative Game Theory
Cooperative Games with Transferable Utility Cooperative versus Noncooperative Game Theory Noncooperative Games Players compete against each other, selfishly seeking to realize their own goals and to maximize
More informationGame Theory. Department of Electronics EL-766 Spring Hasan Mahmood
Game Theory Department of Electronics EL-766 Spring 2011 Hasan Mahmood Email: hasannj@yahoo.com Course Information Part I: Introduction to Game Theory Introduction to game theory, games with perfect information,
More informationSequential Coalitions
Sequential Coalitions There is another approach to measuring power, due to the mathematicians Shapley and Shubik (in fact, in 1954, predating Banzhaf s 1965 work). Idea: Instead of regarding coalitions
More informationDECISION MAKING GAME THEORY
DECISION MAKING GAME THEORY THE PROBLEM Two suspected felons are caught by the police and interrogated in separate rooms. Three cases were presented to them. THE PROBLEM CASE A: If only one of you confesses,
More informationGame Theory: introduction and applications to computer networks
Game Theory: introduction and applications to computer networks Lecture 1: introduction Giovanni Neglia INRIA EPI Maestro 30 January 2012 Part of the slides are based on a previous course with D. Figueiredo
More informationBelief-based rational decisions. Sergei Artemov
Belief-based rational decisions Sergei Artemov September 22, 2009 1 Game Theory John von Neumann was an Hungarian American mathematician who made major contributions to mathematics, quantum mechanics,
More informationPOLECONOMY THE GAME OF THE UNITED KINGDOM INTRODUCTION
POLECONOMY THE GAME OF THE UNITED KINGDOM INTRODUCTION Poleconorny is a role playing game about money and power where each player is both Tycoon and Politician. As a Tycoon buying and selling some of the
More informationDistributed Optimization and Games
Distributed Optimization and Games Introduction to Game Theory Giovanni Neglia INRIA EPI Maestro 18 January 2017 What is Game Theory About? Mathematical/Logical analysis of situations of conflict and cooperation
More informationGame Theory two-person, zero-sum games
GAME THEORY Game Theory Mathematical theory that deals with the general features of competitive situations. Examples: parlor games, military battles, political campaigns, advertising and marketing campaigns,
More informationGames in Extensive Form, Backward Induction, and Subgame Perfection:
Econ 460 Game Theory Assignment 4 Games in Extensive Form, Backward Induction, Subgame Perfection (Ch. 14,15), Bargaining (Ch. 19), Finitely Repeated Games (Ch. 22) Games in Extensive Form, Backward Induction,
More informationChapter 15: Game Theory: The Mathematics of Competition Lesson Plan
Chapter 15: Game Theory: The Mathematics of Competition Lesson Plan For All Practical Purposes Two-Person Total-Conflict Games: Pure Strategies Mathematical Literacy in Today s World, 9th ed. Two-Person
More informationMATH4994 Capstone Projects in Mathematics and Economics
MATH4994 Capstone Projects in Mathematics and Economics Homework One Course instructor: Prof. Y.K. Kwok 1. This problem is related to the design of the rules of a game among 6 students for allocating 6
More informationTHEORY: NASH EQUILIBRIUM
THEORY: NASH EQUILIBRIUM 1 The Story Prisoner s Dilemma Two prisoners held in separate rooms. Authorities offer a reduced sentence to each prisoner if he rats out his friend. If a prisoner is ratted out
More informationTopic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition
SF2972: Game theory Mark Voorneveld, mark.voorneveld@hhs.se Topic 1: defining games and strategies Drawing a game tree is usually the most informative way to represent an extensive form game. Here is one
More informationUltimatum Bargaining. James Andreoni Econ 182
1 Ultimatum Bargaining James Andreoni Econ 182 3 1 Demonstration: The Proposer-Responder Game 4 2 Background: Nash Equilibrium Example Let's think about how we make a prediction in this game: Each Player
More informationMicroeconomics of Banking: Lecture 4
Microeconomics of Banking: Lecture 4 Prof. Ronaldo CARPIO Oct. 16, 2015 Administrative Stuff Homework 1 is due today at the end of class. I will upload the solutions and Homework 2 (due in two weeks) later
More informationTopics in Applied Mathematics
Topics in Applied Mathematics Introduction to Game Theory Seung Yeal Ha Department of Mathematical Sciences Seoul National University 1 Purpose of this course Learn the basics of game theory and be ready
More informationINTRODUCTION TO GAME THEORY
1 / 45 INTRODUCTION TO GAME THEORY Heinrich H. Nax hnax@ethz.ch & Bary S. R. Pradelski bpradelski@ethz.ch February 20, 2017: Lecture 1 2 / 45 A game Rules: 1 Players: All of you: https://scienceexperiment.online/beautygame/vote
More informationProbability (Devore Chapter Two)
Probability (Devore Chapter Two) 1016-351-01 Probability Winter 2011-2012 Contents 1 Axiomatic Probability 2 1.1 Outcomes and Events............................... 2 1.2 Rules of Probability................................
More informationProblem 1 (15 points: Graded by Shahin) Recall the network structure of our in-class trading experiment shown in Figure 1
Solutions for Homework 2 Networked Life, Fall 204 Prof Michael Kearns Due as hardcopy at the start of class, Tuesday December 9 Problem (5 points: Graded by Shahin) Recall the network structure of our
More informationFair Stable Sets of Simple Games
Fair Stable Sets of Simple Games Eduard Talamàs June 4, 2017 Abstract Simple games are abstract representations of voting systems and other group-decision procedures. A stable set or von Neumann-Morgenstern
More informationStudent Name. Student ID
Final Exam CMPT 882: Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte Student Name Student ID Instructions. This exam is worth 30% of your final mark in this course.
More informationExploitability and Game Theory Optimal Play in Poker
Boletín de Matemáticas 0(0) 1 11 (2018) 1 Exploitability and Game Theory Optimal Play in Poker Jen (Jingyu) Li 1,a Abstract. When first learning to play poker, players are told to avoid betting outside
More informationMulti-Agent Bilateral Bargaining and the Nash Bargaining Solution
Multi-Agent Bilateral Bargaining and the Nash Bargaining Solution Sang-Chul Suh University of Windsor Quan Wen Vanderbilt University December 2003 Abstract This paper studies a bargaining model where n
More informationMath 611: Game Theory Notes Chetan Prakash 2012
Math 611: Game Theory Notes Chetan Prakash 2012 Devised in 1944 by von Neumann and Morgenstern, as a theory of economic (and therefore political) interactions. For: Decisions made in conflict situations.
More informationThe Last Diminisher Method Game Steps
Chapter 3 Notes from The Last Diminisher Method Game Steps Start: randomly assign player order P 1, P 2, P 3,... P N. (For instance, each player could draw a number from a hat, in which there are the numbers
More informationU strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium.
Problem Set 3 (Game Theory) Do five of nine. 1. Games in Strategic Form Underline all best responses, then perform iterated deletion of strictly dominated strategies. In each case, do you get a unique
More informationCutting a Pie Is Not a Piece of Cake
Cutting a Pie Is Not a Piece of Cake Julius B. Barbanel Department of Mathematics Union College Schenectady, NY 12308 barbanej@union.edu Steven J. Brams Department of Politics New York University New York,
More informationGame Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness
Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness March 1, 2011 Summary: We introduce the notion of a (weakly) dominant strategy: one which is always a best response, no matter what
More informationFinance Solutions to Problem Set #8: Introduction to Game Theory
Finance 30210 Solutions to Problem Set #8: Introduction to Game Theory 1) Consider the following version of the prisoners dilemma game (Player one s payoffs are in bold): Cooperate Cheat Player One Cooperate
More informationMechanism Design without Money II: House Allocation, Kidney Exchange, Stable Matching
Algorithmic Game Theory Summer 2016, Week 8 Mechanism Design without Money II: House Allocation, Kidney Exchange, Stable Matching ETH Zürich Peter Widmayer, Paul Dütting Looking at the past few lectures
More informationTerry College of Business - ECON 7950
Terry College of Business - ECON 7950 Lecture 5: More on the Hold-Up Problem + Mixed Strategy Equilibria Primary reference: Dixit and Skeath, Games of Strategy, Ch. 5. The Hold Up Problem Let there be
More informationSummary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility
Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should
More informationGames. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto
Games Episode 6 Part III: Dynamics Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Dynamics Motivation for a new chapter 2 Dynamics Motivation for a new chapter
More informationCMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro
CMU 15-781 Lecture 22: Game Theory I Teachers: Gianni A. Di Caro GAME THEORY Game theory is the formal study of conflict and cooperation in (rational) multi-agent systems Decision-making where several
More informationUPenn NETS 412: Algorithmic Game Theory Game Theory Practice. Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5
Problem 1 UPenn NETS 412: Algorithmic Game Theory Game Theory Practice Bonnie Clyde Silent Confess Silent 1, 1 10, 0 Confess 0, 10 5, 5 This game is called Prisoner s Dilemma. Bonnie and Clyde have been
More informationDEPARTMENT OF ECONOMICS WORKING PAPER SERIES. Stable Networks and Convex Payoffs. Robert P. Gilles Virginia Tech University
DEPARTMENT OF ECONOMICS WORKING PAPER SERIES Stable Networks and Convex Payoffs Robert P. Gilles Virginia Tech University Sudipta Sarangi Louisiana State University Working Paper 2005-13 http://www.bus.lsu.edu/economics/papers/pap05_13.pdf
More informationLecture Notes on Game Theory (QTM)
Theory of games: Introduction and basic terminology, pure strategy games (including identification of saddle point and value of the game), Principle of dominance, mixed strategy games (only arithmetic
More informationOverview GAME THEORY. Basic notions
Overview GAME EORY Game theory explicitly considers interactions between individuals hus it seems like a suitable framework for studying agent interactions his lecture provides an introduction to some
More informationStrategies and Game Theory
Strategies and Game Theory Prof. Hongbin Cai Department of Applied Economics Guanghua School of Management Peking University March 31, 2009 Lecture 7: Repeated Game 1 Introduction 2 Finite Repeated Game
More informationAxiomatic Probability
Axiomatic Probability The objective of probability is to assign to each event A a number P(A), called the probability of the event A, which will give a precise measure of the chance thtat A will occur.
More informationIntroduction: What is Game Theory?
Microeconomics I: Game Theory Introduction: What is Game Theory? (see Osborne, 2009, Sect 1.1) Dr. Michael Trost Department of Applied Microeconomics October 25, 2013 Dr. Michael Trost Microeconomics I:
More informationVariations on the Two Envelopes Problem
Variations on the Two Envelopes Problem Panagiotis Tsikogiannopoulos pantsik@yahoo.gr Abstract There are many papers written on the Two Envelopes Problem that usually study some of its variations. In this
More informationDynamic Games: Backward Induction and Subgame Perfection
Dynamic Games: Backward Induction and Subgame Perfection Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 22th, 2017 C. Hurtado (UIUC - Economics)
More information2. (a) Solve the following two-person zero-sum matrix game.
Final Examination Mathematics 167, Game Theory Ferguson Tues June 14, 2005 1 (a) Consider a game of nim with 3 piles of sizes 9, 17 and 21 Is this a P-position or an N-position? If an N-position, what
More informationECO 463. SimultaneousGames
ECO 463 SimultaneousGames Provide brief explanations as well as your answers. 1. Two people could benefit by cooperating on a joint project. Each person can either cooperate at a cost of 2 dollars or fink
More informationReading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.
Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Additional readings could be assigned from time to time. They are an integral part of the class and you are expected to read
More informationGrade 7/8 Math Circles. February 14 th /15 th. Game Theory. If they both confess, they will both serve 5 hours of detention.
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles February 14 th /15 th Game Theory Motivating Problem: Roger and Colleen have been
More informationModeling the Dynamics of Coalition Formation Games for Cooperative Spectrum Sharing in an Interference Channel
Modeling the Dynamics of Coalition Formation Games for Cooperative Spectrum Sharing in an Interference Channel Zaheer Khan, Savo Glisic, Senior Member, IEEE, Luiz A. DaSilva, Senior Member, IEEE, and Janne
More informationPROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo
PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the color of the hat of the other two girls, but not the color
More informationLecture 7: The Principle of Deferred Decisions
Randomized Algorithms Lecture 7: The Principle of Deferred Decisions Sotiris Nikoletseas Professor CEID - ETY Course 2017-2018 Sotiris Nikoletseas, Professor Randomized Algorithms - Lecture 7 1 / 20 Overview
More informationCHAPTER 7 Probability
CHAPTER 7 Probability 7.1. Sets A set is a well-defined collection of distinct objects. Welldefined means that we can determine whether an object is an element of a set or not. Distinct means that we can
More informationPROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the colo
PROBLEM SET 1 1. (Geanokoplos, 1992) Imagine three girls sitting in a circle, each wearing either a red hat or a white hat. Each girl can see the color of the hat of the other two girls, but not the color
More informationGAME THEORY MODULE 4. After completing this supplement, students will be able to: 1. Understand the principles of zero-sum, two-person games.
MODULE 4 GAME THEORY LEARNING OBJECTIVES After completing this supplement, students will be able to: 1. Understand the principles of zero-sum, two-person games. 2. Analyze pure strategy games and use dominance
More informationCopyright 2008, Yan Chen
Unless otherwise noted, the content of this course material is licensed under a Creative Commons Attribution Non-Commercial 3.0 License. http://creativecommons.org/licenses/by-nc/3.0/ Copyright 2008, Yan
More information6. Bargaining. Ryan Oprea. Economics 176. University of California, Santa Barbara. 6. Bargaining. Economics 176. Extensive Form Games
6. 6. Ryan Oprea University of California, Santa Barbara 6. Individual choice experiments Test assumptions about Homo Economicus Strategic interaction experiments Test game theory Market experiments Test
More informationExperimental Instructions
Experimental Instructions This appendix contains all the experimental instructions for the dictator games and the helping game. While we refer to our subjects as decision makers and partners for clarity
More informationLECTURE 26: GAME THEORY 1
15-382 COLLECTIVE INTELLIGENCE S18 LECTURE 26: GAME THEORY 1 INSTRUCTOR: GIANNI A. DI CARO ICE-CREAM WARS http://youtu.be/jilgxenbk_8 2 GAME THEORY Game theory is the formal study of conflict and cooperation
More informationSection Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies.
Section Notes 6 Game Theory Applied Math 121 Week of March 22, 2010 Goals for the week be comfortable with the elements of game theory. understand the difference between pure and mixed strategies. be able
More informationCHAPTER LEARNING OUTCOMES. By the end of this section, students will be able to:
CHAPTER 4 4.1 LEARNING OUTCOMES By the end of this section, students will be able to: Understand what is meant by a Bayesian Nash Equilibrium (BNE) Calculate the BNE in a Cournot game with incomplete information
More informationName: Final Exam May 7, 2014
MATH 10120 Finite Mathematics Final Exam May 7, 2014 Name: Be sure that you have all 16 pages of the exam. The exam lasts for 2 hrs. There are 30 multiple choice questions, each worth 5 points. You may
More information16.410/413 Principles of Autonomy and Decision Making
16.10/13 Principles of Autonomy and Decision Making Lecture 2: Sequential Games Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology December 6, 2010 E. Frazzoli (MIT) L2:
More informationGame Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology.
Game Theory 44812 (1393-94 2 nd term) Dr. S. Farshad Fatemi Graduate School of Management and Economics Sharif University of Technology Spring 2015 Dr. S. Farshad Fatemi (GSME) Game Theory Spring 2015
More informationBlock 1 - Sets and Basic Combinatorics. Main Topics in Block 1:
Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.
More informationGOLDEN AND SILVER RATIOS IN BARGAINING
GOLDEN AND SILVER RATIOS IN BARGAINING KIMMO BERG, JÁNOS FLESCH, AND FRANK THUIJSMAN Abstract. We examine a specific class of bargaining problems where the golden and silver ratios appear in a natural
More informationInstructions [CT+PT Treatment]
Instructions [CT+PT Treatment] 1. Overview Welcome to this experiment in the economics of decision-making. Please read these instructions carefully as they explain how you earn money from the decisions
More informationGame Theory and Randomized Algorithms
Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international
More informationGrade 7/8 Math Circles. Visual Group Theory
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles October 25 th /26 th Visual Group Theory Grouping Concepts Together We will start
More informationMixed Strategies; Maxmin
Mixed Strategies; Maxmin CPSC 532A Lecture 4 January 28, 2008 Mixed Strategies; Maxmin CPSC 532A Lecture 4, Slide 1 Lecture Overview 1 Recap 2 Mixed Strategies 3 Fun Game 4 Maxmin and Minmax Mixed Strategies;
More informationCHECKMATE! A Brief Introduction to Game Theory. Dan Garcia UC Berkeley. The World. Kasparov
CHECKMATE! The World A Brief Introduction to Game Theory Dan Garcia UC Berkeley Kasparov Welcome! Introduction Topic motivation, goals Talk overview Combinatorial game theory basics w/examples Computational
More informationExam 2 Version A. I then apply a standard grading scale to determine your letter grade:
BA 210 Exam 2 Version A Dr. Jon Burke This is practice for your Exam 2. Exam 2 is a 100-minute exam (1hr. 40 min.). There are 5 questions (20 minutes per question). The exam begins exactly at the normal
More informationGame theory. Logic and Decision Making Unit 2
Game theory Logic and Decision Making Unit 2 Introduction Game theory studies decisions in which the outcome depends (at least partly) on what other people do All decision makers are assumed to possess
More informationCognitive Radios Games: Overview and Perspectives
Cognitive Radios Games: Overview and Yezekael Hayel University of Avignon, France Supélec 06/18/07 1 / 39 Summary 1 Introduction 2 3 4 5 2 / 39 Summary Introduction Cognitive Radio Technologies Game Theory
More informationInternational Economics B 2. Basics in noncooperative game theory
International Economics B 2 Basics in noncooperative game theory Akihiko Yanase (Graduate School of Economics) October 11, 2016 1 / 34 What is game theory? Basic concepts in noncooperative game theory
More informationFictitious Play applied on a simplified poker game
Fictitious Play applied on a simplified poker game Ioannis Papadopoulos June 26, 2015 Abstract This paper investigates the application of fictitious play on a simplified 2-player poker game with the goal
More informationIntroduction. If you enjoy this short course, you can learn more about GMAT Advanced by visiting
Introduction Thank you for subscribing to our daily GMAT practice question. Please accept this GMAT counting methods study guide as our free gift to you. This e-book contains a small excerpt from our popular
More informationNote that there are questions printed on both sides of each page!
Math 1001 Name: Fall 2007 Test 2 Student ID: 11/7/07 Time allowed: 50 minutes Section: 10:10 11:15 12:20 This exam includes 7 pages, including this one and a sheet for scratch work. There are a total of
More informationStability of Cartels in Multi-market Cournot Oligopolies
Stability of artels in Multi-market ournot Oligopolies Subhadip hakrabarti Robert P. Gilles Emiliya Lazarova April 2017 That cartel formation among producers in a ournot oligopoly may not be sustainable
More information