Change search
ReferencesLink to record
Permanent link

Direct link
On the Shapley-like Payoff Mechanisms in Peer-Assisted Services with Multiple Content Providers
KAIST (Korea Advanced Institute of Science and Technology).ORCID iD: 0000-0001-9338-4960
KAIST (Korea Advanced Institute of Science and Technology). (LANADA, EE Dept.)
2012 (English)In: Game Theory for Networks: 2nd International ICST Conference, GameNets 2011, Shanghai, China, April 11-18, 2011, Revised Selected Papers / [ed] Rahul Jain, Kannan, Rajgopal, Springer Science+Business Media B.V., 2012, Vol. 75Conference paper (Refereed)
Abstract [en]

This paper studies an incentive structure for cooperation and its stability in peer-assisted services when there exist multiple content providers, using a coalition game theoretic approach. We first consider a generalized coalition structure consisting of multiple providers with many assisting peers, where peers assist providers to reduce the operational cost in content distribution. To distribute the profit from cost reduction to players (i.e., providers and peers), we then establish a generalized formula for individual payoffs when a “Shapley-like” payoff mechanism is adopted. We show that the grand coalition is unstable, even when the operational cost functions are concave, which is in sharp contrast to the recently studied case of a single provider where the grand coalition is stable. We also show that irrespective of stability of the grand coalition, there always exist coalition structures which are not convergent to the grand coalition. Our results give us an important insight that a provider does not tend to cooperate with other providers in peer-assisted services, and be separated from them. To further study the case of the separated providers, three examples are presented; (i) underpaid peers, (ii) service monopoly, and (iii) oscillatory coalition structure. Our study opens many new questions such as realistic and efficient incentive structures and the tradeoffs between fairness and individual providers’ compQC 2012etition in peerassisted services.

Place, publisher, year, edition, pages
Springer Science+Business Media B.V., 2012. Vol. 75
, Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, 75
National Category
URN: urn:nbn:se:kth:diva-86262ISBN: 978-3-642-30372-2OAI: diva2:500568
2nd International ICST Conference on Game Theory for Networks. GameNets 2011, April 16-18 2011, Shanghai, China
ICT - The Next Generation

QC 20120504

Available from: 2012-09-01 Created: 2012-02-13 Last updated: 2013-04-15Bibliographically approved

Open Access in DiVA

fulltext(553 kB)180 downloads
File information
File name FULLTEXT01.pdfFile size 553 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Conference websiteSpringer link

Search in DiVA

By author/editor
Cho, Jeong-woo

Search outside of DiVA

GoogleGoogle Scholar
Total: 180 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 94 hits
ReferencesLink to record
Permanent link

Direct link