NDLI: Bounded-Distance Network Creation Games

Please wait, while we are loading the content...

Bounded-Distance Network Creation Games

Content Provider	ACM Digital Library
Author	Gualà, Luciano Bilò, Davide Proietti, Guido
Copyright Year	2015
Abstract	A network creation game simulates a decentralized and noncooperative construction of a communication network. Informally, there are $\textit{n}$ players sitting on the network nodes, which attempt to establish a reciprocal communication by activating, thereby incurring a certain cost, any of their incident links. The goal of each player is to have all the other nodes as close as possible in the resulting network, while buying as few links as possible. According to this intuition, any model of the game must then appropriately address a balance between these two conflicting objectives. Motivated by the fact that a player might have a strong requirement about her centrality in the network, we introduce a new setting in which a player who maintains her (maximum or average) distance to the other nodes within a given bound incurs a cost equal to the number of activated edges; otherwise her cost is unbounded. We study the problem of understanding the structure of pure Nash equilibria of the resulting games, which we call MaxBD and SumBD, respectively. For both games, we show that when distance bounds associated with players are nonuniform, then equilibria can be arbitrarily bad. On the other hand, for MaxBD, we show that when nodes have a uniform bound $\textit{D}$ ≥ 3 on the maximum distance, then the price of anarchy (PoA) is lower and upper bounded by 2 and $O(n^{1/⌊log_{3}$ $\textit{D}$ ⌋+1), respectively (i.e., PoA is constant as soon as $\textit{D}$ is $Ω(n^{ε}),$ for any ε > 0), while for the interesting case $\textit{D}=2,$ we are able to prove that the PoA is $Ω(&sqrt;\textit{n})$ and $\textit{O}(&sqrt;\textit{n}$ log $\textit{n}).$ For the uniform SumBD, we obtain similar (asymptotically) results and moreover show that PoA becomes constant as soon as the bound on the average distance is $2\textit{ω}(&sqrt;log$ $\textit{n}).$
Starting Page	1
Ending Page	20
Page Count	20
File Format	PDF
ISSN	21678375
e-ISSN	21678383
DOI	10.1145/2770639
Volume Number	3
Issue Number	3
Journal	ACM Transactions on Economics and Computation (TEAC)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-06-23
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Degree-diameter problem Game theory Network creation games Price of anarchy Pure Nash equilibrium
Content Type	Text
Resource Type	Article
Subject	Economics and Econometrics Marketing Computational Mathematics Statistics and Probability Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On Nash Equilibria for a Network Creation Game

A Bounded Budget Network Creation Game

The Price of Anarchy in Games of Incomplete Information

Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness

Do Capacity Constraints Constrain Coalitions?

The price of anarchy in network creation games

Restoring Pure Equilibria to Weighted Congestion Games

Near-Optimality in Covering Games by Exposing Global Information

Price of Stability in Polynomial Congestion Games

Bounded-Distance Network Creation Games

Similar Documents

On Nash Equilibria for a Network Creation Game

A Bounded Budget Network Creation Game

The Price of Anarchy in Games of Incomplete Information

Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness

Do Capacity Constraints Constrain Coalitions?

The price of anarchy in network creation games

Restoring Pure Equilibria to Weighted Congestion Games

Near-Optimality in Covering Games by Exposing Global Information

Price of Stability in Polynomial Congestion Games

Bounded-Distance Network Creation Games