1/20 On the Shapley-like Payoff Mechanisms in Peer-Assisted Services with Multiple Content Providers April 17, 2011 JEONG-WOO CHO KAIST, South Korea Joint.

Slides:



Advertisements
Similar presentations
Network Resource Broker for IPTV in Cloud Computing Lei Liang, Dan He University of Surrey, UK OGF 27, G2C Workshop 15 Oct 2009 Banff,
Advertisements

The Weighted Proportional Resource Allocation Milan Vojnović Microsoft Research Joint work with Thành Nguyen Microsoft Research Asia, Beijing, April, 2011.
Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma, Jiang Chen, Yang Richard Yang and Arvind Krishnamurthy Yale University University.
A Short Tutorial on Cooperative Games
Rarest First and Choke Algorithms are Enough Arnaud LEGOUT INRIA, Sophia Antipolis France G. Urvoy-Keller and P. Michiardi Institut Eurecom France.
Incentives Build Robustness in BitTorrent Author: Bram Cohen Presenter: Brian Liao.
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
Negotiating a stable distribution of the payoff among agents may prove challenging. The issue of coalition formation has been investigated extensively,
C H A P T E R C H E C K L I S T When you have completed your study of this chapter, you will be able to Describe and identify oligopoly and explain how.
Internet Economics: the use of Shapley value for ISP settlement Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
Kangaroo: Video Seeking in P2P Systems Xiaoyuan Yang †, Minas Gjoka ¶, Parminder Chhabra †, Athina Markopoulou ¶, Pablo Rodriguez † † Telefonica Research.
On the Economics of P2P Systems Speaker Coby Fernandess.
Natural Selection in Peer-to-Peer Streaming: From the Cathedral to the Bazaar Vivek Shrivastava, Suman Banerjee University of Wisconsin-Madison, USA ACM.
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
Xavier León PhD defense
Modelling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks.
GREEN IPTV A Resource and Energy Efficient Network for IPTV.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Multimedia Streaming in Dynamic Peer-to-Peer Systems and Mobile Wireless.
Taxation and Stability in Cooperative Games Yair Zick Maria Polukarov Nick R. Jennings AAMAS 2013.
The Communication Complexity of Coalition Formation Among Autonomous Agents A. D. Procaccia & J. S. Rosenschein.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
The Allocation of Value For Jointly Provided Services By P. Linhart, R. Radner, K. G. Ramkrishnan, R. Steinberg Telecommunication Systems, Vol. 4, 1995.
Motivation Due to the development of new Internet access technologies (DSL's and HFC's), VoD services have become increasingly popular Despite the continuous.
Beyond selfish routing: Network Formation Games. Network Formation Games NFGs model the various ways in which selfish agents might create/use networks.
Modeling and analysis of BitTorrent-like P2P network Fan Bin Oct,1 st,2004.
Dept. of Computer Science & Engineering The Chinese University of Hong Kong 1 Interaction of Overlay Networks: Properties and Control Professor John C.S.
Coalition Structures in Weighted Voting Games Georgios Chalkiadakis Edith Elkind Nicholas R. Jennings.
Arbitrators in Overlapping Coalition Formation Games
1 Can Internet Video-on-Demand be Profitable? Cheng Huang, Jin Li (Microsoft Research Redmond), Keith W. Ross (Polytechnic University) ACM SIGCOMM 2007.
Distributed Rational Decision Making Sections By Tibor Moldovan.
The Shapley Value: Its Use and Implications on Internet Economics Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
NET NEUTRALITY:THE TECHNICAL SIDE OF THE DEBATE A WHITE PAPER Author:Jon Crowcroft Speaker : 游文霖.
Computational aspects of stability in weighted voting games Edith Elkind (NTU, Singapore) Based on joint work with Leslie Ann Goldberg, Paul W. Goldberg,
Can Internet Video-on-Demand Be Profitable? SIGCOMM 2007 Cheng Huang (Microsoft Research), Jin Li (Microsoft Research), Keith W. Ross (Polytechnic University)
France Telecom Group Brussels 19 January 2010 Smart and Ubiquitous Audio-visual and Multimedia Services Framework Program 7 for period Consultation.
Can Network Coding Help in P2P Networks? Dah Ming Chiu, Raymond W Yeung, Jiaqing Huang and Bin Fan Chinese University of Hong Kong Presented by Arjumand.
Coalition Games: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC A C B.
Rade Stanojevic Using Tuángòu to Reduce IP Transit Costs Rade Stanojevic (Joint work with Ignacio Castro and Sergey Gorinsky) ‍‍ ACM CoNext 2011 Tokyo,
Beyond Routing Games: Network (Formation) Games. Network Games (NG) NG model the various ways in which selfish users (i.e., players) strategically interact.
RAdio resource Management and Optimization 134 Sinchon-Dong, Seodaemun-Gu, Seoul, , Korea Phone :
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.
Beyond Routing Games: Network (Formation) Games. Network Games (NG) NG model the various ways in which selfish users (i.e., players) strategically interact.
Center for Information and Communication Technologies Potentials and Challenges of Peer-to-Peer Technology Copenhagen, December 2, 2005 Halldor Matthias.
Jean Walrand – NSF – April 24-25, 20031/5 Economic Mechanisms Grand Challenge: Design economic mechanisms that provide incentives for increasing the utility.
Michael Schapira Yale and UC Berkeley Joint work with P. Brighten Godfrey, Aviv Zohar and Scott Shenker.
Rabin Model of Monopoly Pricing. Preliminaries Monopolist has cost c per unit Consumer values the good  Monopolist picks price p  [c,  ] Consumer picks.
1 - CS7701 – Fall 2004 Review of: Detecting Network Intrusions via Sampling: A Game Theoretic Approach Paper by: – Murali Kodialam (Bell Labs) – T.V. Lakshman.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish agents strategically interact in using a network They.
Beyond selfish routing: Network Games. Network Games NGs model the various ways in which selfish users (i.e., players) strategically interact in using.
Can Internet Video-on-Demand Be Profitable? Cheng Huang, Jin Li (Microsoft Research), Keith W. Ross (Polytechnic University) ACM SIGCOMM 2007.
Designing Games for Distributed Optimization Na Li and Jason R. Marden IEEE Journal of Selected Topics in Signal Processing, Vol. 7, No. 2, pp ,
Variable Bandwidth Allocation Scheme for Energy Efficient Wireless Sensor Network SeongHwan Cho, Kee-Eung Kim Korea Advanced Institute of Science and Technology.
Non-Cooperative Behavior in Wireless Networks Márk Félegyházi (EPFL) PhD. public defense July 9, 2007.
Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design Authors: Matei Ripeanu Ian Foster Adriana.
Network Formation Games. NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models: Global Connection Game.
Consider a very simple setting: a fish stock is harvested by two symmetric (identical) players, which can be fishermen or fleets. 2.1 A Simple Non-cooperative.
Public Policy Process An Introduction.
A Novel Coalitional Game Model for Security Issues in Wireless Networks Xiaoqi LiMichael Lyu Computer Science and Engineering Department The Chinese 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.
Caching Games between Content Providers and Internet Service Providers
Caching Games between Content Providers and Internet Service Providers
Aspiration-based Learning
Determining the Peer Resource Contributions in a P2P Contract
Public Policy Process An Introduction.
Challenges with developing a Commercial P2P System
Presentation transcript:

1/20 On the Shapley-like Payoff Mechanisms in Peer-Assisted Services with Multiple Content Providers April 17, 2011 JEONG-WOO CHO KAIST, South Korea Joint work with YUNG YI KAIST, South Korea

2/20 IPTV: Global Trend MRG Inc., “IPTV Global Forecast – 2010 to 2014”, Semiannual IPTV Global Forecast, Dec RNCOS Inc., “Global IPTV Market Forecast to 2014”, Market Research Report, Feb IPTV Service Providers

3/20 P2P can reduce the operational cost of IPTV. [CHA08] Cost: total amount of traffic between DSLAM and the first IP router P2P: Potential for Cost Reduction [CHA08] M. Cha, P. Rodriguez, S. Moon, and J. Crowcroft, “On next-generation telco-managed P2P TV architecture”, USENIX IPTPS, Feb Dynamic IP multicast is the best solution but not implemented in routers. The analysis based on a large-scale real trace shows the operational cost of IPTV can be significantly cut down (up to 83%) by P2P.

4/20  BitTorrent: unprecedented success in terms of scalability, efficiency, and energy-saving.  Unfortunately, P2P nowadays is transmitting mostly illegal contents.  Hide-and-seek between content providers and pirates. Can we exploit the virtues of P2P to create a rational symbiosis between content providers and peers? Peer-Assisted Service Peer-Assisted Service [MIS10]: Coordinated legal P2P System Peers legally assist providers in distribution of legal contents. Hence, the operational costs of the content providers are reduced. [MIS10] V. Misra, S. Ioannidis, A. Chaintreau, and L. Massoulié, “Incentivizing peer-assisted services: A fluid Shapley value approach”, ACM Sigmetrics, June 2010.

5/20 Incentive Structure Incentive Structure of Peer-Assisted Services Q: Will users (peers) donate their resources to content providers? A: No, they should be paid their due deserts. A quote from an interview of BBC iPlayer with CNET UK: “Some people didn't like their upload bandwidth being used.” We study in this paper multiple : An incentive structure in peer-assisted services when there exist multiple content providers. : The case of single-provider was analyzed in [MIS10]. We study Shapley-like payoff mechanisms to distribute the profit from the cost reduction. We use coalition game theory to analyze stability and fairness of the payoff mechanisms. [MIS10] V. Misra, S. Ioannidis, A. Chaintreau, and L. Massoulié, “Incentivizing peer-assisted services: A fluid Shapley value approach”, ACM Sigmetrics, June 2010.

6/20 Outline 1.Introduction 2.Minimal Formalism Game with Coalition Structure Shapley Value and Aumann-Drèze Value 3.Coalition Game in Peer-Assisted Services 4.Instability of the Grand Coalition 5.Critique of the Aumann-Drèze Value 6.Conclusion

7/20 Game with Coalition Structure Non-partitioned player set Grand Coalition Partitioned player set

8/20 Shapley-like Values  Value (or a Payoff Mechanism)  A worth distribution scheme.  Summarizes each player’s contribution to the coalition in one number.

9/20 Toy Example Non-partitioned player set Grand Coalition Partitioned player set Worth = 4 Worth = 1 Worth = 2

10/20 Outline 1.Introduction 2.Minimal Formalism 3.Coalition Game in Peer-Assisted Services Worth Function Fluid Aumann-Drèze Value for Multiple-Provider Coalitions 4.Instability of the Grand Coalition 5.Critique of the Aumann-Drèze Value 6.Conclusion

11/20 Worth Function in Peer-Assisted Services  How to define the coalition worth (cost reduction) in peer-assisted services?

12/20 Fluid Aumann-Drèze Payoff A simplistic formula for Shapley-like payoff distribution scheme. A generalized formula of the Aumann-Shapley (A-S) prices in coalition game theory

13/20 Outline 1.Introduction 2.Minimal Formalism 3.Coalition Game in Peer-Assisted Services 4.Instability of the Grand Coalition Shapley Value Not in the Core Aumann-Drèze Payoff Doesn’t Lead to the Grand Coalition 5.Critique of the Aumann-Drèze Value 6.Conclusion

14/20 A stark contrast to the single-provider case in [MIS10] where the Shapley payoff vector is proven to lie in the core. In other words, the number of content providers matters. [MIS10] V. Misra, S. Ioannidis, A. Chaintreau, and L. Massoulié, “Incentivizing peer-assisted services: A fluid Shapley value approach”, ACM Sigmetrics, June 2010.

15/20 Convergence to the Grand Coalition  What happens if the initial coalition structure is not the grand coalition? : Will the coalition structure converge to the grand coalition? : To define the notion of convergence and stability, we introduce and use the stability notion of Hart and Kurz [HAR93]. Simplified Version of Theorem 3 Simplified Version of Theorem 3 If there are two or more providers, the grand coalition is not the global attractor. Whether the Shapley value lies in the core or not, whether the cost functions are concave of not, the grand coalition is not globally stable. [HAR83] S. Hart and M. Kurz, “Endogenous Formation of Coalitions”, Econometrica, vol. 51, pp , 1983.

16/20 Outline 1.Introduction 2.Minimal Formalism 3.Coalition Game in Peer-Assisted Services 4.Instability of the Grand Coalition 5.Critique of the Aumann-Drèze Value Unfairness, Monopoly and Oscillation 6.Conclusion

17/20 Critique of A-D Value: Unfairness  Our stability results suggest that if the content providers are rational (selfish), the grand coalition will not be formed, hence single-provider coalitions will persist.  We illustrate the weak points the A-D payoff when the providers are separate.

18/20 Critique of A-D Value: Monopoly

19/20 Critique of A-D Value: Oscillation Oscillation It is not yet clear how this behavior will be developed in large-scale systems.  Relaxing the assumption of monotonicity of the cost functions, we can find an example which exhibits the oscillatory behavior of coalition structure.  There are two content providers and two peers in the following example.

20/20 Conclusion A Lesson to Learn: “Conflicting Pursuits of Profits” – Shapley value is not in the core. – The coalition structure does not converge to the grand coalition. – Providers tend to persist in single-provider coalitions. Shapley-like Incentive Structures in Peer-Assisted Services multiplemany – A simple fluid formula of the Shapley-like payoffs for the general case of multiple providers and many peers. More Issues for the Case of Single-Provider Coalitions. – Providers and peers do not receive their Shapley payoffs. – How to regulate the service monopoly? Do we have to? – How to prevent oscillatory behavior of coalition structure? Fair profit-sharing and opportunism of players are difficult to stand together. : In our next paper, we have proposed a compromising and stable value (payoff).