Taxation and Stability in Cooperative Games Yair Zick Maria Polukarov Nick R. Jennings AAMAS 2013.

Slides:



Advertisements
Similar presentations
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
Advertisements

A Short Tutorial on Cooperative Games
GAME THEORY.
Manipulation, Control, and Beyond: Computational Issues in Weighted Voting Games Edith Elkind (U. of Southampton) Based on joint work with: Y.Bachrach,
Agent Failures in Totally Balanced Games and Convex Games Authors: Yoram Bachrach 1 Ian Kash 1 Nisarg Shah 2 (speaker) 1 Microsoft Research Cambridge.
An Approximate Truthful Mechanism for Combinatorial Auctions An Internet Mathematics paper by Aaron Archer, Christos Papadimitriou, Kunal Talwar and Éva.
Effort Games and the Price of Myopia Michael Zuckerman Joint work with Yoram Bachrach and Jeff Rosenschein.
1 Combinatorial Agency with Audits Raphael Eidenbenz ETH Zurich, Switzerland Stefan Schmid TU Munich, Germany TexPoint fonts used in EMF. Read the TexPoint.
Algorithmic aspects of the core in cooperative games over graphs Vangelis Markakis Athens University of Economics and Business Dept. of Informatics Joint.
Negotiating a stable distribution of the payoff among agents may prove challenging. The issue of coalition formation has been investigated extensively,
Study Group Randomized Algorithms 21 st June 03. Topics Covered Game Tree Evaluation –its expected run time is better than the worst- case complexity.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
How Bad is Selfish Routing? By Tim Roughgarden Eva Tardos Presented by Alex Kogan.
1 CRP 834: Decision Analysis Week Five Notes. 2 Review Game Theory –Game w/ Mixed Strategies Graphic Method Linear Programming –Games In an Extensive.
Cooperative/coalitional game theory Vincent Conitzer
Cooperative Weakest Link Games Yoram Bachrach, Omer Lev, Shachar Lovett, Jeffrey S. Rosenschein & Morteza Zadimoghaddam CoopMAS 2013 St. Paul, Minnesota.
Yoram Bachrach Jeffrey S. Rosenschein November 2007.
Overlapping Coalition Formation: Charting the Tractability Frontier Y. Zick, G. Chalkiadakis and E. Elkind (submitted to AAMAS 2012)
Prisoners Dilemma rules 1.Binding agreements are not possible. Note in Prisoners dilemma, if binding agreements were possible, there would be no dilemma.
Arbitration, Fairness and Stability Revenue Division in Collaborative Settings Yair Zick Advisor: Prof. Edith Elkind.
Learning Cooperative Games Maria-Florina Balcan, Ariel D. Procaccia and Yair Zick (to appear in IJCAI 2015)
The Communication Complexity of Coalition Formation Among Autonomous Agents A. D. Procaccia & J. S. Rosenschein.
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.
Path Disruption Games (Cooperative Game Theory meets Network Security) Yoram Bachrach, Ely Porat Microsoft Research Cambridge.
Computing Shapley Values, Manipulating Value Distribution Schemes, and Checking Core Membership in Multi-Issue Domains Vincent Conitzer and Tuomas Sandholm.
Beyond selfish routing: Network Formation Games. Network Formation Games NFGs model the various ways in which selfish agents might create/use networks.
Job Market Signaling (Spence model)
Coalition Structures in Weighted Voting Games Georgios Chalkiadakis Edith Elkind Nicholas R. Jennings.
Arbitrators in Overlapping Coalition Formation Games
Cooperative/coalitional game theory A composite of slides taken from Vincent Conitzer and Giovanni Neglia (Modified by Vicki Allan) 1.
Reshef Meir School of Computer Science and Engineering Hebrew University, Jerusalem, Israel Joint work with Maria Polukarov, Jeffery S. Rosenschein and.
Yair Zick, Alexander Skopalik and Edith Elkind School of Physical and Mathematical Sciences Division of Mathematical Sciences Nanyang Technological University,
Cooperative/coalitional game theory A composite of slides taken from Vincent Conitzer and Giovanni Neglia (Modified by Vicki Allan) 1.
Game Theory.
Games of Incomplete Information. These games drop the assumption that players know each other’s preferences. Complete info: players know each other’s preferences.
Computational aspects of stability in weighted voting games Edith Elkind (NTU, Singapore) Based on joint work with Leslie Ann Goldberg, Paul W. Goldberg,
Overlapping Coalition Formation: Charting the Tractability Frontier Y. Zick, G. Chalkiadakis and E. Elkind (AAMAS 2012)
Principal - Agent Games. Sometimes asymmetric information develops after a contract has been signed In this case, signaling and screening do not help,
The Core MIT , Fall Lecture Outline  Coalitional Games and the Core The non-transferable utility ( “ NTU ” ) formulation The transferable.
Coalition Games: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC A C B.
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
Computational problems associated with a solution concept Why we need the compact representation of coalitional games Compactly-represented coalitional.
1 Risk Based Negotiation of Service Agent Coalitions Bastian Blankenburg, Matthias KluschDFKI Minghua He, Nick JenningsUniversity of Southampton.
1. 2 Non-Cooperative games Player I Player II I want the maximum payoff to Player I I want the maximum payoff to Player II.
Bounding the Cost of Stability in Games with Restricted Interaction Reshef Meir, Yair Zick, Edith Elkind and Jeffrey S. Rosenschein COMSOC 2012 (to appear)
Approximating Market Equilibria Kamal Jain, Microsoft Research Mohammad Mahdian, MIT Amin Saberi, Georgia Tech.
Complexity of Determining Nonemptiness of the Core Vincent Conitzer, Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Manipulating the Quota in Weighted Voting Games (M. Zuckerman, P. Faliszewski, Y. Bachrach, and E. Elkind) ‏ Presented by: Sen Li Software Technologies.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish agents strategically interact in using a network They.
Hedonic Clustering Games Moran Feldman Joint work with: Seffi Naor and Liane Lewin-Eytan.
1 a1a1 A1A1 a2a2 a3a3 A2A Mixed Strategies When there is no saddle point: We’ll think of playing the game repeatedly. We continue to assume that.
Negotiating Socially Optimal Allocations of Resources U. Endriss, N. Maudet, F. Sadri, and F. Toni Presented by: Marcus Shea.
11 The Cost of Stability in Network Flow Games Ezra Resnick Yoram Bachrach Jeffrey S. Rosenschein.
Market Design and Analysis Lecture 2 Lecturer: Ning Chen ( 陈宁 )
IF YOU ARE PLANNING TO BUY A USED CAR. Logon to Examine Buy End Start No Yes.
Linear Programming Chap 2. The Geometry of LP  In the text, polyhedron is defined as P = { x  R n : Ax  b }. So some of our earlier results should.
The Shapley Value The concept of the core is useful as a measure of stability. As a solution concept, it presents a set of imputations without distinguishing.
Cooperative Games Based on the book and slides by Chalkiadakis, Elkind and Wooldridge.
Optimization and Stability in Games with Restricted Interactions Reshef Meir, Yair Zick and Jeffrey S. Rosenschein CoopMAS 2012.
Coalitional Games on “Sparse” Social Networks Edith Elkind University of Oxford.
Dynamic Weighted Voting Games Edith Elkind Dmitrii Pasechnik Yair Zick AAMAS 2013.
Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains Vincent Conitzer, Tuomas Sandholm Computer.
Cooperative Games Based on the book and slides by Chalkiadakis, Elkind and Wooldridge.
Complexity of Determining Nonemptiness of the Core
CPS Cooperative/coalitional game theory
Economics and Computation Week 6: Assignment games
Multiagent Systems Game Theory © Manfred Huber 2018.
Presented By Aaron Roth
Normal Form (Matrix) Games
Presentation transcript:

Taxation and Stability in Cooperative Games Yair Zick Maria Polukarov Nick R. Jennings AAMAS 2013

Cooperative TU Games Agents divide into coalitions; generate profit Coalition members can freely divide profits. How should profits be divided? $5 $3 $2

TU Games - Notations Agents: N = {1,…, n } Coalition: S µ N Characteristic function: v : 2 N → R A TU game G = h N, v i is anonymous, if the value of a coalition is only a function of its size. A TU game is monotone, if the value of a coalition can only increase by adding more agents to it.

Payoffs We assume that only the grand coalition N is formed. Agents may freely distribute profits. An imputation is a vector x = ( x 1,…, x n ) such that Σ i 2 N x i = v ( N ). Individual rationality: each agent gets at least what she can make on her own: x i ≥ v ({ i })

The Core The core is the set of all stable outcomes: for all S µ N we have x ( S ) ¸ v ( S ) ; a game with a non-empty core is called stable. May be empty in many games. Example: the 3-majority game. Three players; any set of size two or more has a value of 1; singletons have a value of 0. The total amount to be divided is 1; if (w.l.o.g.) player 1 gets more than 0, then players 2 and 3 get a total payoff of less than 1.

Stabilizing Games The 3-Majority game has an empty core. However, if one reduces the value of all 2- player coalitions by 1/3, the core becomes non-empty (giving 1/3 to each player is a stable outcome). Similarly: reduce the value of {2,3} to 0. Reducing the value of some coalitions can result in a stable game.

Our Work We explore taxation methods (i.e. reductions in coalition value), that ensure stability. What is the minimal amount of tax required in order to stabilize a game? Which taxation schemes are optimal? When are known taxation schemes optimal?

Some Background Taxation is not new " -core: coalition values reduced by ". Least-core: corresponds to the " * -core, where " * is the smallest " for which the " -core is not empty. Reliability extensions: each agent i survives with probability r i ; the value of a coalition is reduced to its expected value. Myerson graphs, etc…

1 23 x 1 = v ({1}) x 2 = v ( N ) − v ({1,3}) x 2 = v ({2}) x 1 = v ( N ) − v ({2,3}) x 3 = v ({3}) x 3 = v ( N ) − v ({1,2}) x 1 + x 2 + x 3 = v ( N )

1 23 x 1 = v ({1}) x 2 = v ( N ) − v ({1,3}) x 2 = v ({2}) x 1 = v ( N ) − v ({2,3}) x 3 = v ({3}) x 3 = v ( N ) − v ({1,2}) x 1 + x 2 + x 3 = v ( N ) " " " " " "

1 23 x 1 = v ({1}) x 2 = v ( N ) − v ({1,3}) x 2 = v ({2}) x 1 = v ( N ) − v ({2,3}) x 3 = v ({3}) x 3 = v ( N ) − v ({1,2}) x 1 + x 2 + x 3 = v ( N ) "

Exploring Taxation Methods Given a game G = h N, v i, we say that G ’ ≤ G if v ( S ) ≥ v ’ ( S ) for all S µ N. A game G ’ is maximal-stable w.r.t. G if G ’ ≤ G It has a non-empty core If G ’’ is stable and G ’ ≤ G ’’ ≤ G, then one of the inequalities holds with equality.

Exploring Taxation Methods Increasing the value of any coalition results in losing either stability or dominance. Observations: Maximal-stable games still distribute v ( N ) to the agents. They are defined by a single vector x = ( x 1,…, x n ); the value of each coalition S is min{ v ( S ), x ( S )}.

Optimal Taxation Schemes The set of dominated games with a non-empty core is a convex polyhedron denoted S ( G ). We are interested in the set of games that minimizes the total tax taken. These games are said to have optimal taxation schemes.

Optimal Taxation Schemes We characterize the optimal taxation scheme for anonymous games. Given an anonymous game, where v ( S ) = f (| S |), the optimal taxation scheme is given by reducing the value of each coalition to min ( f (| S |), f (| N |)/| S |). Good for small coalitions; bad for large coalitions.

Existing Taxation Schemes Suppose that a central authority wants to implement a taxation scheme. What conditions must hold in order for this taxation scheme to be optimal? We find conditions on the underlying cooperative game which ensure this for the " -core and for reliability extensions.

Conclusions & Future Work Given a class of cooperative games, what taxation schemes would be optimal? How much are we “over-taxing” by using a given taxation scheme? Other ways of measuring total taxation. Computational complexity: efficient computation of optimal taxes?

Thank you! Questions? P.S.: I am on the job market!