Math 152: Applicable Mathematics and Computing

Similar documents
Math 152: Applicable Mathematics and Computing

The Shapley value and power indices

The nucleolus, the Shapley value and power indices

Cooperative Games. M2 ISI Systèmes MultiAgents. Stéphane Airiau LAMSADE

Game Theory: Spring 2017

Ü B U N G S A U F G A B E N. S p i e l t h e o r i e

Lecture: Topics in Cooperative Game Theory

Characterization of the Banzhaf Value Using a Consistency Axiom

A Coalition Formation Value for Games in Partition Function Form. Michel GRABISCH, Université de Paris I, Yukihiko FUNAKI, Waseda University

Background notes on bargaining

Department of Applied Mathematics Faculty of EEMCS. University of Twente. Memorandum No Owen coalitional value without additivity axiom

Solutions without dummy axiom for TU cooperative games

Weighted Voting Games

Cooperative Games. Stéphane Airiau. Institute for Logic, Language & Computations (ILLC) University of Amsterdam

Seminar: Topics in Cooperative Game Theory

Power in the US Legislature

Solutions to Exercises of Section IV.1.

COOPERATIVE GAMES. Department of Economics, MIT. 1. Definitions

AXIOMATIC CHARACTERIZATIONS OF THE SYMMETRIC COALITIONAL BINOMIAL SEMIVALUES. January 17, 2005

Consistency, anonymity, and the core on the domain of convex games

Incentives to form the grand coalition versus no incentive to split off from the grand coalition

TWO-PERSON COOPERATIVE GAMES

CORVINUS ECONOMICS WORKING PAPERS. Young's axiomatization of the Shapley value - a new proof. by Miklós Pintér CEWP 7/2015

Microeconomics. 2. Game Theory

Math.3336: Discrete Mathematics. Advanced Counting Techniques

Math-Net.Ru All Russian mathematical portal

A decomposition of the space of TU-games

Divisible Load Scheduling: An Approach Using Coalitional Games

Departamento de Estadística Statistics and Econometrics Series 18. Universidad Carlos III de Madrid October 2012

Power indices expressed in terms of minimal winning coalitions

Math 416, Spring 2010 Matrix multiplication; subspaces February 2, 2010 MATRIX MULTIPLICATION; SUBSPACES. 1. Announcements

Multiagent Systems Motivation. Multiagent Systems Terminology Basics Shapley value Representation. 10.

Interval values for strategic games in which players cooperate

Málaga Economic Theory Research Center Working Papers

No CHARACTERIZING CONVEXITY OF GAMES USING MARGINAL VECTORS. By Bas van Velzen, Herbert Hamers, Henk Norde. February 2003 ISSN

Characterizations of weighted and equal division values

Section Summary. Proof by Cases Existence Proofs

Dividends and Weighted Values in Games with Externalities

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India November 2007

International Journal of Pure and Applied Mathematics Volume 22 No , ON THE INVERSE PROBLEM FOR SEMIVALUES OF COOPERATIVE TU GAMES

Indices de pouvoir et d interaction en théorie des jeux coopératifs : une app. une approche par moindres carrés

Department of Applied Mathematics Faculty of EEMCS. University of Twente. Memorandum No. 1796

Noncooperative Games, Couplings Constraints, and Partial Effi ciency

GAMES WITH IDENTICAL SHAPLEY VALUES. 1. Introduction

MATH4250 Game Theory 1. THE CHINESE UNIVERSITY OF HONG KONG Department of Mathematics MATH4250 Game Theory

On the Impact of Independence of Irrelevant Alternatives

Players Indifferent to Cooperate and Characterizations of the Shapley Value

Notes on Coursera s Game Theory

Extensive Form Games I

Ziv Hellman and Ron Peretz Graph value for cooperative games

COOPERATIVE GAME THEORY: CORE AND SHAPLEY VALUE

Applied Cooperative Game Theory

What kind of bonus point system makes the rugby teams more offensive?

A NOTE ON FUNAKI AND YAMATO S TRAGEDY OF THE COMMONS

INTUITIVE SOLUTIONS IN GAME REPRESENTATIONS: THE SHAPLEY VALUE REVISITED. Pradeep Dubey. March 2018 COWLES FOUNDATION DISCUSSION PAPER NO.

Announcements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive

Weighted Voting Games

EC516 Contracts and Organisations, LSE

Centrality rewarding Shapley and Myerson values for undirected graph games

The Potential of the Holler-Packel Value and Index: A New Characterization

ON A THEOREM OF KALAI AND SAMET

The Value of Information in Zero-Sum Games

CER-ETH Center of Economic Research at ETH Zurich

Introduction to Game Theory

Game Theory: Spring 2017

Math 447. Introduction to Probability and Statistics I. Fall 1998.

The Shapley Value for games with a finite number of effort levels. by Joël Adam ( )

The Core can be accessed in a Bounded Number of Steps

A Farsighted Stable Set for Partition Function Games

CORVINUS ECONOMICS WORKING PAPERS. On the impossibility of fair risk allocation. by Péter Csóka Miklós Pintér CEWP 12/2014

THE DISPUTED GARMENT PROBLEM: THE MATHEMATICS OF BARGAINING & ARBITRATION. Richard Weber

CS281A/Stat241A Lecture 19

Math.3336: Discrete Mathematics. Combinatorics: Basics of Counting

Negotiation: Strategic Approach

MATH 450: Mathematical statistics

Homework 6 Solutions

Implementation of the Ordinal Shapley Value for a three-agent economy 1

Binding Agreements II: Coalition Formation

Game Theory: Spring 2017

No PROJECT GAMES. By Arantza Estévez- Fernández, Peter Borm, Herbert Hamers. July 2005 ISSN

ECONOMIC STRENGTH IN COOPERATIVE GAMES

9/6. Grades. Exam. Card Game. Homework/quizzes: 15% (two lowest scores dropped) Midterms: 25% each Final Exam: 35%

Applied cooperative game theory:

GAME THEORETIC MODELS OF NETWORK FORMATION A GAME THEORETIC GENERALIZED ADDITIVE MODEL

MT-DP 2018/5 On bargaining sets of supplier-firm-buyer games

Ranking Sets of Objects by Using Game Theory

CS 598RM: Algorithmic Game Theory, Spring Practice Exam Solutions

Physics 2240, Spring 2015

The Nash bargaining model

Proof Systems and Transformation Games

Published: Social Choice and Welfare, 33(1), June 2009, pp doi: /s SEQUENTIAL ENTRY IN MANY-TO-ONE MATCHING MARKETS

6.207/14.15: Networks Lecture 24: Decisions in Groups

Secret-Key Generation in Many-to-One Networks: An Integrated Game-Theoretic and Information-Theoretic Approach

Expectation Formation Rules and the Core of Partition Function Games

Bargaining, Coalitions and Externalities: A Comment on Maskin

On some generalization of the notion of power index: ordinality and criticality in voting games

Merging and splitting in cooperative games: some (im-)possibility results

A NOTE ON THE ARTICU "SOMF: EXPERIMENTAL n-person GAMES" ' R. Duncan Luce

The Game of Normal Numbers

Compromise Stable TU-Games Quant, Marieke; Borm, Peter; Reijnierse, Hans; van Velzen, S.

Transcription:

Math 152: Applicable Mathematics and Computing June 5, 2017 June 5, 2017 1 / 19

Announcements Dun s office hours on Thursday are extended, from 12.30 3.30pm (in SDSC East 294). My office hours on Wednesday are extended (1 3pm), and other days by appointment. June 5, 2017 2 / 19

Last Time: Coalitional Form Example Game Three players simultaneously announces either 1 or 2. Let x be the sum of the announced numbers. If x is a multiple of 3, then Player 1 wins x and the remaining players win 0. If x is one more than a multiple of three, then Player 2 wins x and the other players win 0. Otherwise, Player 3 wins x and the others win 0. Last time, we found the coalitional form of the following game: v( ) = v({1}) = v({2}) = v({3}) = 0 v({1, 2}) = 16/5, v({1, 3}) = 5, v({2, 3}) = 25/6, v({1, 2, 3}) = 6. If they all cooperate and recieve a joint payoff of 6, how should they divide this up? June 5, 2017 3 / 19

Shapley Value Consider any game in coalitional form, where N is the set of players and v is the characteristic function. We assume that the players all cooperate and receive joint payoff v(n). Let the final payoff for Player i be denoted φ i (v). Like Nash s approach to bargaining, Shapley proposed several axioms that the solution should satisfy, and showed that they uniquely determine a solution. June 5, 2017 4 / 19

Shapley Axioms 1 Efficiency: i N φ i (v) = v(n). 2 Symmetry: If i, j are such that v(s {i}) = v(s {j}) for all sets S not containing i and j, then φ i (v) = φ j (v). 3 Dummy Axiom: If i is such that v(s {i}) = v(s) for all S not containing i, then φ i (v) = 0. 4 Additivity: If u, v are characteristic functions, then φ(u + v) = φ(u) + φ(v). June 5, 2017 5 / 19

Shapley Value: Example 1 Let N = {1, 2, 3}. Let v be the characteristic function v( ) = v({1}) = v({2}) = v({3}) = v({1, 3}) = v({2, 3}) = 0 v({1, 2}) = v({1, 2, 3}) = 1 June 5, 2017 6 / 19

Shapley Value: Example 1 Let N = {1, 2, 3}. Let v be the characteristic function v( ) = v({1}) = v({2}) = v({3}) = v({1, 3}) = v({2, 3}) = 0 v({1, 2}) = v({1, 2, 3}) = 1 Axiom 1 implies φ 1 (v) + φ 2 (v) + φ 3 (v) = 1 June 5, 2017 6 / 19

Shapley Value: Example 1 Let N = {1, 2, 3}. Let v be the characteristic function v( ) = v({1}) = v({2}) = v({3}) = v({1, 3}) = v({2, 3}) = 0 v({1, 2}) = v({1, 2, 3}) = 1 Axiom 1 implies φ 1 (v) + φ 2 (v) + φ 3 (v) = 1 Axiom 2 implies φ 1 (v) = φ 2 (v), since v( {1}) = v( {2}) and v({3} {1}) = v({3} {2}). June 5, 2017 6 / 19

Shapley Value: Example 1 Let N = {1, 2, 3}. Let v be the characteristic function v( ) = v({1}) = v({2}) = v({3}) = v({1, 3}) = v({2, 3}) = 0 v({1, 2}) = v({1, 2, 3}) = 1 Axiom 1 implies φ 1 (v) + φ 2 (v) + φ 3 (v) = 1 Axiom 2 implies φ 1 (v) = φ 2 (v), since v( {1}) = v( {2}) and v({3} {1}) = v({3} {2}). Axiom 3 implies φ 3 (v) = 0 (check!). June 5, 2017 6 / 19

Shapley Value: Example 1 Let N = {1, 2, 3}. Let v be the characteristic function v( ) = v({1}) = v({2}) = v({3}) = v({1, 3}) = v({2, 3}) = 0 v({1, 2}) = v({1, 2, 3}) = 1 So, φ 1 (v) = 1/2 φ 2 (v) = 1/2 φ 3 (v) = 0 June 5, 2017 7 / 19

Shapley Value: The game w S More generally: For any set of players N, and any S N, let w S be the characteristic function defined by { 0 if S T w S (T ) = 1 if S T Applying axioms 1 3 just as above, we get { 0 if i S φ i (w S ) = if i S 1 S Remark. The game w S is simply the game where the team scores 1 if the team contains all players in S, and otherwise the team scores 0. June 5, 2017 8 / 19

Shapley Value: The game cw S More generally still: For any set of players N, and any S N, let cw S be the characteristic function defined by { 0 if S T cw S (T ) = c if S T Applying axioms 1 3 just as above, we get { 0 if i S φ i (cw S ) = if i S c S June 5, 2017 9 / 19

Shapley Value: Example 2 Let N = {1, 2, 3}. Let v be the characteristic function v( ) = v({1}) = v({2}) = v({3}) = v({1, 3}) = v({2, 3}) = 0 v({1, 2}) = 1 v({1, 2, 3}) = 4 June 5, 2017 10 / 19

Shapley Value: Example 2 Let N = {1, 2, 3}. Let v be the characteristic function v( ) = v({1}) = v({2}) = v({3}) = v({1, 3}) = v({2, 3}) = 0 v({1, 2}) = 1 v({1, 2, 3}) = 4 Notice that we can write v = w {1,2} + 3w {1,2,3} June 5, 2017 10 / 19

Shapley Value: Example 2 Let N = {1, 2, 3}. Let v be the characteristic function v( ) = v({1}) = v({2}) = v({3}) = v({1, 3}) = v({2, 3}) = 0 v({1, 2}) = 1 v({1, 2, 3}) = 4 Notice that we can write v = w {1,2} + 3w {1,2,3} So φ(v) = φ(w {1,2} ) + φ(3w {1,2,3} ) = (1/2, 1/2, 0) + (1, 1, 1) June 5, 2017 10 / 19

Shapley Values: General Approach We know the Shapley value for characteristic functions of the form w S. Given a general characteristic function v, if we can write it as v = S N c S w S for some constants c S, then we can compute φ(v). We will show that we can always write v in this way, and so we can always compute φ. June 5, 2017 11 / 19

Shapley Values: General Approach Theorem There exists a unique function φ satisfying the Shapley axioms. Proof. By above, we just need to show that any v can be written uniquely as v = S N c S w S for some constants c S. We are forced to choose c {i} = v({i}) for each singleton set. Now inductively set c T = v(t ) S T S T c S June 5, 2017 12 / 19

Shapley Values: General Approach Theorem There exists a unique function φ satisfying the Shapley axioms. Proof continued... We have set Now c S w S (T ) = S T S N c T = v(t ) S T S T c S c T = c T + S T S T = v(t ) S T S T c T c T + S T S T c T = v(t ) June 5, 2017 13 / 19

Shapley Value: Example 3 Recall the coalitional form for the example from last time: v( ) = v({1}) = v({2}) = v({3}) = 0 v({1, 2}) = 16/5, v({1, 3}) = 5, v({2, 3}) = 25/6, v({1, 2, 3}) = 6 June 5, 2017 14 / 19

Shapley Value: Example 3 Recall the coalitional form for the example from last time: v( ) = v({1}) = v({2}) = v({3}) = 0 v({1, 2}) = 16/5, v({1, 3}) = 5, v({2, 3}) = 25/6, v({1, 2, 3}) = 6 We need to find the constants c S. We begin with c {1} = v({1}) = 0 Similarly c {2} = c {3} = 0 June 5, 2017 14 / 19

Shapley Value: Example 3 Recall the coalitional form for the example from last time: v( ) = v({1}) = v({2}) = v({3}) = 0 v({1, 2}) = 16/5, v({1, 3}) = 5, v({2, 3}) = 25/6, v({1, 2, 3}) = 6 Next, we get c {1,2} = v({1, 2}) c {1} c {2} = 16/5 June 5, 2017 15 / 19

Shapley Value: Example 3 Recall the coalitional form for the example from last time: v( ) = v({1}) = v({2}) = v({3}) = 0 v({1, 2}) = 16/5, v({1, 3}) = 5, v({2, 3}) = 25/6, v({1, 2, 3}) = 6 Next, we get c {1,2} = v({1, 2}) c {1} c {2} = 16/5 c {1,3} = v({1, 3}) c {1} c {3} = 5 c {2,3} = v({2, 3}) c {2} c {3} = 25/6 June 5, 2017 15 / 19

Shapley Value: Example 3 Recall the coalitional form for the example from last time: v( ) = v({1}) = v({2}) = v({3}) = 0 v({1, 2}) = 16/5, v({1, 3}) = 5, v({2, 3}) = 25/6, v({1, 2, 3}) = 6 Finally c {1,2,3} = v({1, 2, 3}) c {1,2} c {1,3} c {2,3} c {1} c {2} c {3} = 6 16/5 5 25/6 = 191/30 June 5, 2017 16 / 19

Shapley Value: Example 3 Putting this together, we get v = 16 5 w {1,2} + 5w {1,3} + 25 6 w {2,3} 191 30 w {1,2,3} June 5, 2017 17 / 19

Shapley Value: Example 3 Putting this together, we get Finally, we have v = 16 5 w {1,2} + 5w {1,3} + 25 6 w {2,3} 191 30 w {1,2,3} φ 1 (v) = 16 5 1 2 + 5 1 2 + 25 6 0 191 30 1 3 = 1.97 7 June 5, 2017 17 / 19

Shapley Value: Example 3 Putting this together, we get Finally, we have v = 16 5 w {1,2} + 5w {1,3} + 25 6 w {2,3} 191 30 w {1,2,3} φ 1 (v) = 16 5 1 2 + 5 1 2 + 25 6 0 191 30 1 3 = 1.97 7 φ 2 (v) = 16 5 1 2 + 5 0 + 25 6 1 2 191 30 1 3 = 1.56 1 June 5, 2017 17 / 19

Shapley Value: Example 3 Putting this together, we get Finally, we have v = 16 5 w {1,2} + 5w {1,3} + 25 6 w {2,3} 191 30 w {1,2,3} φ 1 (v) = 16 5 1 2 + 5 1 2 + 25 6 0 191 30 1 3 = 1.97 7 φ 2 (v) = 16 5 1 2 + 5 0 + 25 6 1 2 191 30 1 3 = 1.56 1 φ 3 (v) = 16 5 0 + 5 1 2 + 25 6 1 2 191 30 1 3 = 2.46 1 June 5, 2017 17 / 19

Shapley Value Typically the numbers aren t as bad as in the last question. For example: Consider the game in coalitional form with N = {1, 2, 3} and characteristic function v( ) = 0, v({1}) = 1, v({2}) = 0, v({3}) = 1 v({1, 2}) = 4, v({1, 3}) = 3, v({2, 3}) = 5, v({1, 2, 3}) = 8 (Remark. At this point we have covered all material necessary for the questions in homework 7, including the ungraded ones.) June 5, 2017 18 / 19

Shapley Value: An Explicit Formula Theorem The Shapley value satisfies φ i (v) = S N i S ( S 1)!(n S )! n! (v(s) v(s {i})) Since we have shown that the Shapley function is unique, to prove that this formula holds we just need to show it satisfies axioms 1 4. Remark. A formula is always nice, but the recursive approach from before may be less error-prone (and allows the computation of all Shapley values at the same time). June 5, 2017 19 / 19