NDLI: Computing approximate pure Nash equilibria in congestion games

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

Computing approximate pure Nash equilibria in congestion games

Content Provider	ACM Digital Library
Author	Caragiannis, Ioannis Gravin, Nick Skopalik, Alexander Fanelli, Angelo
Abstract	Among other solution concepts, the notion of the pure Nash equilibrium plays a central role in Game Theory. Pure Nash equilibria in a game characterize situations with non-cooperative deterministic players in which no player has any incentive to unilaterally deviate from the current situation in order to achieve a higher payoff. Unfortunately, it is well known that there are games that do not have pure Nash equilibria. Furhermore, even in games where the existence of equilibria is guaranteed, their computation can be a computationally hard task. Such negative results significantly question the importance of pure Nash equilibria as solution concepts that characterize the behavior of rational players. Approximate pure Nash equilibria, which characterize situations where no player can significantly improve her payoff by unilaterally deviating from her current strategy, could serve as alternative solution concepts provided that they exist and can be computed efficiently. In this letter, we discuss recent positive algorithmic results for approximate pure Nash equilibria in congestion games.
Starting Page	26
Ending Page	29
Page Count	4
File Format	PDF
ISSN	15519031
DOI	10.1145/2325713.2325718
Journal	ACM SIGecom Exchanges (SECO)
Volume Number	11
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-03-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Potential games Pure nash equilibria
Content Type	Text
Resource Type	Article

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

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure

Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure

Approximate Pure Nash Equilibria in Weighted Congestion Games

Algorithms for pure Nash equilibria in weighted congestion games

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure∗ (2011)

Computing approximate nash equilibria in network congestion games (2008).

On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies

Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games

Computing approximate pure Nash equilibria in congestion games

Similar Documents

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure

Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure

Approximate Pure Nash Equilibria in Weighted Congestion Games

Algorithms for pure Nash equilibria in weighted congestion games

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure∗ (2011)

Computing approximate nash equilibria in network congestion games (2008).

On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies

Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games

Computing approximate pure Nash equilibria in congestion games