Characterizing distribution rules for cost sharing games Raga Gopalakrishnan Caltech Joint work with Jason R. Marden & Adam Wierman.

Slides:



Advertisements
Similar presentations
Best Response Dynamics in Multicast Cost Sharing
Advertisements

Real-Time Competitive Environments: Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks Anwar Mohammadi, Nathan Fisher, and Daniel.
Dispatching to Incentivize Fast Service in Multi-Server Queues Raga Gopalakrishnan and Adam Wierman California Institute of Technology Sherwin Doroudi.
Conditional Equilibrium Outcomes via Ascending Price Processes Joint work with Hu Fu and Robert Kleinberg (Computer Science, Cornell University) Ron Lavi.
The Weighted Proportional Resource Allocation Milan Vojnović Microsoft Research Joint work with Thành Nguyen Microsoft Research Asia, Beijing, April, 2011.
KONSTANDINA KOUTSOUBA PhD Candidate ATHANASIOS KAMPAS Assistant Professor DEPT. OF AGRICULTURAL ECONOMICS AND DEVELOPMENT AGRICULTURAL UNIVERSITY OF ATHENS.
Network Security: an Economic Perspective Marc Lelarge (INRIA-ENS) currently visiting STANFORD TRUST seminar, Berkeley 2011.
Risk Models and Controlled Mitigation of IT Security R. Ann Miura-Ko Stanford University February 27, 2009.
An Architectural View of Game Theoretic Control Raga Gopalakrishnan and Adam Wierman California Institute of Technology Jason R. Marden University of Colorado.
A Short Tutorial on Cooperative Games
Potential games are necessary to ensure pure Nash equilibria in cost sharing games.
(CS/SS 241) Introduction to SISL: Topics in Algorithmic game theory Adam Wierman – 258 Jorgensen John Ledyard – 102 Baxter Jason R. Marden – 335 Moore.
Raga Gopalakrishnan University of Colorado at Boulder Adam Wierman (Caltech) Amy R. Ward (USC) Sherwin Doroudi (CMU) Scheduling and Staffing when Servers.
Agent Failures in Totally Balanced Games and Convex Games Authors: Yoram Bachrach 1 Ian Kash 1 Nisarg Shah 2 (speaker) 1 Microsoft Research Cambridge.
© The McGraw-Hill Companies, Inc., 2002 McGraw-Hill/Irwin Decision Making is pushed down. Delegation of Decision Making (Decentralization) Decentralization.
Economics and Climate Applications: Exploring the Frontier Debra J. Rubas Harvey S.J. Hill James W. Mjelde.
Regret Minimization and the Price of Total Anarchy Paper by A. Blum, M. Hajiaghayi, K. Ligett, A.Roth Presented by Michael Wunder.
Coalition Formation and Price of Anarchy in Cournot Oligopolies Joint work with: Nicole Immorlica (Northwestern University) Georgios Piliouras (Georgia.
Cooperative/coalitional game theory Vincent Conitzer
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
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)
A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks John C.S. Lui The Chinese University of Hong Kong Joint work.
Institute for Economics and Mathematics at St. Petersburg Russian Academy of Sciences Vladimir Matveenko Bargaining Powers, Weights of Individual Utilities,
The Allocation of Value For Jointly Provided Services By P. Linhart, R. Radner, K. G. Ramkrishnan, R. Steinberg Telecommunication Systems, Vol. 4, 1995.
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.
The Price Of Stability for Network Design with Fair Cost Allocation Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Eva Tardos, Tom Wexler, Tim Roughgarden.
Applications of TU Games Vito Fragnelli University of Eastern Piedmont Politecnico di Torino 24 April 2002 Outline Cost Allocation Problems Infrastructure.
More Powerful and Simpler Cost-Sharing Methods Carmine Ventre Joint work with Paolo Penna University of Salerno.
Distributed Rational Decision Making Sections By Tibor Moldovan.
Algorithms, Games and the Internet Christos H. Papadimitriou UC Berkeley
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Balanced per capita contributions and levels structure of cooperation María Gómez-Rúa Juan Vidal-Puga Universidade de Vigo coalition structure.
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
Noam Nisan Non-price Equilibria in Markets of Discrete goods Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan.
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
Contribution Games in Social Networks Elliot Anshelevich Rensselaer Polytechnic Institute (RPI) Troy, New York Martin Hoefer RWTH Aachen University Aachen,
1 Issues on the border of economics and computation נושאים בגבול כלכלה וחישוב Congestion Games, Potential Games and Price of Anarchy Liad Blumrosen ©
The Agencies Method for Coalition Formation in Experimental Games John Nash (University of Princeton) Rosemarie Nagel (Universitat Pompeu Fabra, ICREA,
Overlapping Coalition Formation: Charting the Tractability Frontier Y. Zick, G. Chalkiadakis and E. Elkind (AAMAS 2012)
Uniform Price Auctions: Equilibria and Efficiency Vangelis Markakis Athens University of Economics & Business (AUEB) 1 Orestis Telelis University of Liverpool.
Raga Gopalakrishnan University of Colorado at Boulder Sean D. Nixon (University of Vermont) Jason R. Marden (University of Colorado at Boulder) Stable.
A Projection Framework for Near- Potential Polynomial Games Nikolai Matni Control and Dynamical Systems, California.
Coalition Games: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC A C B.
1 Efficiency and Nash Equilibria in a Scrip System for P2P Networks Eric J. Friedman Joseph Y. Halpern Ian Kash.
Network Design Games Éva Tardos Cornell University.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Market Equilibrium: The Quest for the “Right” Model.
Complexity of Determining Nonemptiness of the Core Vincent Conitzer, Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish agents strategically interact in using a network They.
Cooperation, Power and Conspiracies Yoram Bachrach.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish users (i.e., players) strategically interact in using.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Primal-Dual Algorithms for Rational Convex Programs II: Dealing with Infeasibility.
Designing Games for Distributed Optimization Na Li and Jason R. Marden IEEE Journal of Selected Topics in Signal Processing, Vol. 7, No. 2, pp ,
Ron Peretz (LSE) Ziv Hellman (Bar Ilan) Graph Value for Cooperative Games Game Theory Seminar, Bar Ilan University, May 2014.
Hedonic Clustering Games Moran Feldman Joint work with: Seffi Naor and Liane Lewin-Eytan.
Vasilis Syrgkanis Cornell University
Network Formation Games. NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models: Global Connection Game.
Coalitional Games on “Sparse” Social Networks Edith Elkind University of Oxford.
Network Formation Games. NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models: Global Connection Game.
Complexity of Determining Nonemptiness of the Core
Algorithmic Game Theory and Internet Computing
CPS Cooperative/coalitional game theory
Christos H. Papadimitriou UC Berkeley
Presented By Aaron Roth
Algorithmic Problems Related To The Internet
Welfare Economics Part II
Network Formation Games
Network Formation Games
Richard Ma, Sam Lee, John Lui (CUHK) David Yau (Purdue)
Presentation transcript:

Characterizing distribution rules for cost sharing games Raga Gopalakrishnan Caltech Joint work with Jason R. Marden & Adam Wierman

Cost sharing games: Self-interested agents make decisions, and share the incurred cost among themselves. Lots of examples: Network formation games Facility location games Profit sharing games Key Question: How should the cost be shared?

Cost sharing games: Lots of examples: Network formation games Facility location games Profit sharing games S1 S2 D1 D2 Key Question: How should the cost be shared? Self-interested agents make decisions, and share the incurred cost among themselves.

Cost sharing games: Lots of examples: Network formation games Facility location games Profit sharing games Key Question: How should the cost be shared? Self-interested agents make decisions, and share the incurred cost among themselves.

Cost sharing games: Lots of examples: Network formation games Facility location games Profit sharing games Key Question: How should the cost be shared? Self-interested agents make decisions, and share the incurred cost among themselves.

Cost sharing games: Lots of examples: Network formation games [Jackson 2003][Anshelevich et al. 2004] Facility location games [Goemans et al. 2000] [Chekuri et al. 2006] Profit sharing games [Kalai et al. 1982] [Ju et al. 2003] Huge literature in Economics Growing literature in CS New application: Designing for distributed control [Gopalakrishnan et al. 2011][Ozdaglar et al. 2009][Alpcan et al. 2009] Key Question: How should the cost be shared? Self-interested agents make decisions, and share the incurred cost among themselves.

Cost sharing games (more formally): set of agents/players set of resources S1 S2 D1 D2 Example:

Cost sharing games (more formally): set of agents/players set of resources

Cost sharing games (more formally): set of agents/players set of resources common base welfare function

Cost sharing games (more formally): set of agents/players set of resources resource-specific coefficients welfare function

Cost sharing games (more formally): set of agents/players set of resources resource-specific coefficients welfare function

Cost sharing games (more formally): set of agents/players set of resources resource-specific coefficients distribution rule welfare function

Requirements on the distribution rule The distribution rule should be: (i) Budget-balanced (ii) “Stable” and/or “Fair” (iii) “Efficient”

Requirements on the distribution rule The distribution rule should be: (i) Budget-balanced (ii) “Stable” and/or “Fair” (iii) “Efficient”

Requirements on the distribution rule [Gillies 1959] [Devanur et al. 2003] [Chander et al. 2006] The distribution rule should be: (i) Budget-balanced (ii) “Stable” and/or “Fair” (iii) “Efficient” Lots of work on characterizing “stability” and “fairness” Nash equilibrium Core [von Neumann et al. 1944] [Nash 1951] [Moulin 1992] [Albers et al. 2006]

Requirements on the distribution rule [Gillies 1959] [Devanur et al. 2003] [Chander et al. 2006] The distribution rule should be: (i) Budget-balanced (ii) “Stable” and/or “Fair” (iii) “Efficient” Lots of work on characterizing “stability” and “fairness” Nash equilibrium Core [von Neumann et al. 1944] [Nash 1951] [Moulin 1992] [Albers et al. 2006]

Requirements on the distribution rule The distribution rule should be: (i) Budget-balanced (ii) “Stable” and/or “Fair” (iii) “Efficient” Has good Price of Anarchy and Price of Stability properties

The Shapley value [] The Shapley value [Shapley 1953] A player’s share of the welfare should depend on their “average” marginal contribution Note: There is also a weighted Shapley value

Properties of the Shapley value approximations are often tractable [Castro et al. 2009]

Research question: Are there distribution rules besides the (weighted) Shapley value that always guarantee a Nash equilibrium?

Research question: Our (surprising) answer: NO, for any submodular welfare function. “decreasing marginal returns” Are there distribution rules besides the (weighted) Shapley value that always guarantee a Nash equilibrium? natural way to model many real-world problems

The inspiration for our work Our result

The inspiration for our work Our result

Consequences

Proof Sketch “contributing coalition” “magnitude of contribution”

Proof Sketch (A single T-Welfare Function) Don’t allocate welfare to any player

Proof Sketch (General Welfare Functions) Don’t allocate welfare to any player Allocate welfare only to players in these formed coalitions, independent of others

Proof Sketch (General Welfare Functions) Don’t allocate welfare to any player Allocate welfare only to players in these formed coalitions, independent of others Weights of common players in any two coalitions must be linearly dependent

Research question: Are there distribution rules besides the (weighted) Shapley value that always guarantee a Nash equilibrium? Cost Sharing Games Our answer: NO, for any submodular welfare function. what about for other welfare functions? Understand what causes this fundamental restriction – perhaps some structure of action sets?

Characterizing distribution rules for cost sharing games Raga Gopalakrishnan Caltech Joint work with Jason R. Marden & Adam Wierman

References [von Neumann et al. 1944] [Nash 1951] [Shapley 1953] [Gillies 1959] [Shapley 1967] [Kalai et al. 1982] [Moulin 1992] [Goemans et al. 2000] [Ui 2000] [Devanur et al. 2003] [Jackson 2003] [Ju et al. 2003] [Anshelevich et al. 2004] [Conitzer et al. 2004] [Albers et al. 2006] [Chander et al. 2006] [Chekuri et al. 2006] [Alpcan et al. 2009] [Ozdaglar et al. 2009] [Chen et al. 2010] [Gopalakrishnan et al. 2011] [Marden et al. 2011]