Network creation games with traceroute-based strategies (Contributo in atti di convegno)

Type
Label
  • Network creation games with traceroute-based strategies (Contributo in atti di convegno) (literal)
Anno
  • 2014-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/978-3-319-09620-9-17 (literal)
Alternative label
  • Bilo D.; Guala L.; Leucci S.; Proietti G. (2014)
    Network creation games with traceroute-based strategies
    in 21th International Colloqium on Structural Information and Communication Complexity (SIROCCO'14), Japan, July 23-25, 2014
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Bilo D.; Guala L.; Leucci S.; Proietti G. (literal)
Pagina inizio
  • 210 (literal)
Pagina fine
  • 223 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.scopus.com/inward/record.url?eid=2-s2.0-84905379476&partnerID=q2rCbXpz (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 8576 LNCS (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#volumeInCollana
  • 8576 LNCS (literal)
Rivista
Note
  • Scopu (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Dipartimento di Scienze Umanistiche e Sociali, Università di Sassari, Italy; Dipartimento di Ingegneria dell'Impresa, Università di Roma Tor Vergata, Italy; Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica, Università Degli Studi dell'Aquila, Italy; Istituto di Analisi Dei Sistemi Ed Informatica, CNR, Rome, Italy (literal)
Titolo
  • Network creation games with traceroute-based strategies (literal)
Abstract
  • Network creation games model the autonomous formation of an interconnected system of selfish users. In particular, when the network will serve as a digital communication infrastructure, each user is identified by a node of the network, and contributes to the build-up process by strategically balancing between her building cost (i.e., the number of links she personally activates in the network) and her usage cost (i.e., some function of the distance in the sought network to the other players). When the corresponding game is analyzed, the generally adopted assumption is that players have a common and complete information about the evolving network topology, which is quite unrealistic though, due to the massive size this may have in practice. In this paper, we thus relax this assumption, by instead letting the players have only a partial knowledge of the network. To this respect, we make use of three popular traceroute-based knowledge models used in network discovering (i.e., the activity of reconstructing the topology of an unknown network through queries at its nodes), namely: (i) distance vector, (ii) shortest-path tree view, and (iii) layered view. For all these models, we provide exhaustive answers to the canonical algorithmic game theoretic questions: convergence, computational complexity for a player of selecting a best response, and tight bounds to the price of anarchy, all of them computed w.r.t. a suitable (and unifying) equilibrium concept. © 2014 Springer International Publishing Switzerland. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it