On the public citation graph
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
0 signed · 42 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230030104openalex-snapshot
The network equilibrium problem in integers
inferredcites →https://doi.org/10.1006/game.1996.0027openalex-snapshot
Congestion Games with Player-Specific Payoff Functions
inferredcites →https://doi.org/10.1007/11549345_10openalex-snapshot
Pure Nash Equilibria in Games with a Large Number of Actions
inferredcites →https://doi.org/10.1007/11672142_17openalex-snapshot
Exact Price of Anarchy for Polynomial Congestion Games
inferredcites →https://doi.org/10.1007/11786986_44openalex-snapshot
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
inferredcites →https://doi.org/10.1007/11944874_6openalex-snapshot
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games
inferredcites →https://doi.org/10.1007/11944874_9openalex-snapshot
The Equilibrium Existence Problem in Finite Network Congestion Games
inferredcites →https://doi.org/10.1007/978-3-540-70918-3_19openalex-snapshot
Symmetries and the Complexity of Pure Nash Equilibrium
inferredcites →https://doi.org/10.1007/bf01737559openalex-snapshot
A class of games possessing pure-strategy Nash equilibria
inferredcites →https://doi.org/10.1016/0020-0190(94)00184-zopenalex-snapshot
A note on the complexity of local search problems
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/j.ipl.2006.03.010openalex-snapshot
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
inferredcites →https://doi.org/10.1023/a:1016770831869openalex-snapshot
Atomic Resource Sharing in Noncooperative Networks
inferredcites →https://doi.org/10.1109/focs.2004.68openalex-snapshot
The Price of Stability for Network Design with Fair Cost Allocation
inferredcites →https://doi.org/10.1109/focs.2006.55openalex-snapshot
On the Impact of Combinatorial Structure on Congestion Games
inferredcites →https://doi.org/10.1109/focs.2006.69openalex-snapshot
Settling the Complexity of Two-Player Nash Equilibrium
inferredcites →https://doi.org/10.1137/0220004openalex-snapshot
Simple Local Search Problems that are Hard to Solve
inferredcites →https://doi.org/10.1145/1007352.1007445openalex-snapshot
The complexity of pure Nash equilibria
inferredcites →https://doi.org/10.1145/1060590.1060599openalex-snapshot
The Price of Routing Unsplittable Flow
inferredcites →https://doi.org/10.1145/1132516.1132526openalex-snapshot
Reducibility among equilibrium problems
inferredcites →https://doi.org/10.1145/1132516.1132527openalex-snapshot
The complexity of computing a Nash equilibrium
inferredcites →https://doi.org/10.1613/jair.1683openalex-snapshot
Pure Nash Equilibria: Hard and Easy Games
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4655155openalex-extracted
Approximate Nash Equilibria Algorithms for Weighted Congestion Games and Their Runtimes
inferred← citeshttps://doi.org/10.1007/11944874_6openalex-snapshot
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-540-77105-0_47openalex-snapshot
On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_10openalex-snapshot
Malicious Bayesian Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_38openalex-snapshot
$\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_24openalex-snapshot
On the Power of Nodes of Degree Four in the Local Max-Cut Problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.035openalex-snapshot
Pure Nash equilibria in player-specific and weighted congestion games
inferred← citeshttps://doi.org/10.1080/15427951.2008.10129170openalex-snapshot
Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
inferred← citeshttps://doi.org/10.1137/1.9781611973068.78openalex-snapshot
On the Complexity of Nash Equilibria of Action-Graph Games
inferred← citeshttps://doi.org/10.1145/1073970.1074000openalex-snapshot
Selfish routing with incomplete information
inferred← citeshttps://doi.org/10.1145/1566374.1566376openalex-snapshot
On the complexity of nash dynamics and sink equilibria
inferred← citeshttps://doi.org/10.1287/moor.1080.0322openalex-snapshot
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
inferred← citeshttps://doi.org/10.1613/jair.1.12668openalex-snapshot
Pure Nash Equilibria in Resource Graph Games
inferred← citeshttps://doi.org/10.3990/1.9789036541275openalex-snapshot
Quality of equilibria in resource allocation games
inferred← citeshttps://doi.org/10.48550/arxiv.1206.3713openalex-snapshot
Learning the Structure and Parameters of Large-Population Graphical Games from Behavioral Data
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.