NDLI: Complexity of equilibrium in diffusion games on social networks

Content Provider	IEEE Xplore Digital Library
Author	Etesami, S.R. Basar, T.
Copyright Year	2014
Description	Author affiliation: Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA (Etesami, S.R.; Basar, T.)
Abstract	We revisit the competitive diffusion game on undirected connected graphs and study the complexity of the existence of pure-strategy Nash equilibrium for such games. We first characterize the utility of each player based on the location of its initial seed placements. Using this characterization, we show that the utility of each player is a sub-modular function of its initial seed set. Following this, a simple greedy algorithm provides an initial seed placement within a constant factor of the optimal solution. We show NP-completeness of the decision on the existence of pure-strategy Nash equilibrium for general networks. Finally we provide some necessary conditions for a given profile to be a Nash equilibrium and obtain a lower bound for the maximum social welfare of the game with two players.
Starting Page	2065
Ending Page	2070
File Size	344825
Page Count	6
File Format	PDF
ISBN	9781479932726
ISSN	07431619
e-ISBN	9781479932740
DOI	10.1109/ACC.2014.6859194
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-06-04
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	American Automatic Control Council(AACC)
Subject Keyword	Games Nash equilibrium Diffusion processes Greedy algorithms Complexity theory Social network services Three-dimensional displays social welfare Competitive diffusion game pure Nash equilibrium sub-modular function greedy algorithm NP-hardness
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering

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

NP-hardness of pure Nash equilibrium in Scheduling and Connection GamesI

Community Detection in Social Networks Using Information Diffusion

An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game

The Strategic Formation of Multi-Layer Networks

New Complexity Results about Nash Equilibria

4.2 Congestion Games 4.2.1 Example (2010)

New complexity results about.

Computational complexity of correlated equilibria for extensive games (2001)

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost (2005)

Complexity of equilibrium in diffusion games on social networks

Similar Documents

NP-hardness of pure Nash equilibrium in Scheduling and Connection GamesI

Community Detection in Social Networks Using Information Diffusion

An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game

The Strategic Formation of Multi-Layer Networks

New Complexity Results about Nash Equilibria

4.2 Congestion Games 4.2.1 Example (2010)

New complexity results about.

Computational complexity of correlated equilibria for extensive games (2001)

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost (2005)

Complexity of equilibrium in diffusion games on social networks