Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Game Theoretic Analysis of Selfish Content Replication on Graphs
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0001-7528-9994
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-4876-0223
2011 (English)In: 7th Swedish National Computer Networking Workshop (SNCNW), 2011, 2011Conference paper, Published paper (Refereed)
Abstract [en]

Replication games are a model of the problem of content placement in computer and communication systems, when the participating nodes maketheir decisions such as to maximize their individualutilities. In this paper we consider replication gamesplayed over arbitrary social graphs; the social graphmodels limited interaction between the players due to,e.g., the network topology. We show that in replicationgames there is an equilibrium object placement forarbitrary social graphs. Nevertheless, if all nodes followa myopic strategy to update their object placementsthen they might cycle arbitrarily long before reachingan equilibrium if the social graph is non-complete. Wegive sufficient conditions under which such cycles do notexist, and propose an efficient distributed algorithm toreach an equilibrium over a non-complete social graph.

Place, publisher, year, edition, pages
2011.
Keyword [en]
Game theory, Selfish Replication
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-118447OAI: oai:DiVA.org:kth-118447DiVA, id: diva2:606206
Conference
7th Swedish National Computer Networking Workshop (SNCNW), 2011
Note

QC 20130226

Available from: 2013-02-26 Created: 2013-02-18 Last updated: 2013-02-26Bibliographically approved

Open Access in DiVA

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

Other links

SNCNW 2011

Search in DiVA

By author/editor
Pacifici, ValentinoDán, György
By organisation
Communication Networks
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 190 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

urn-nbn

Altmetric score

urn-nbn
Total: 51 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf