On the public citation graph

Approximate Nash Equilibria Algorithms for Weighted Congestion Games and Their Runtimes

0 signed · 43 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/game.1996.0044openalex-extracted
Potential Games
inferredcites →https://doi.org/10.1007/11786986_45openalex-extracted
The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
inferredcites →https://doi.org/10.1007/11944874_7openalex-extracted
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
inferredcites →https://doi.org/10.1007/978-3-319-71924-5_14openalex-extracted
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_51openalex-extracted
Selfish Unsplittable Flows
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_8openalex-extracted
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
inferredcites →https://doi.org/10.1007/bf01737559openalex-extracted
A class of games possessing pure-strategy Nash equilibria
inferredcites →https://doi.org/10.1007/s00224-008-9128-8openalex-extracted
Network Design with Weighted Players
inferredcites →https://doi.org/10.1007/s00224-011-9315-xopenalex-extracted
Characterizing the Existence of Potential Functions in Weighted Congestion Games
inferredcites →https://doi.org/10.1007/s10107-022-01853-0openalex-extracted
A convergence analysis of the price of anarchy in atomic congestion games
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-extracted
How easy is local search?
inferredcites →https://doi.org/10.1016/j.geb.2009.05.004openalex-extracted
Convergence to approximate Nash equilibria in congestion games
inferredcites →https://doi.org/10.1016/j.trb.2014.05.003openalex-extracted
Distributed coordinated in-vehicle online routing using mixed-strategy congestion game
inferredcites →https://doi.org/10.1016/j.trb.2018.11.010openalex-extracted
Network congestion games are robust to variable demand
inferredcites →https://doi.org/10.1016/j.tre.2010.07.005openalex-extracted
Analysis of traffic congestion costs in a competitive supply chain
inferredcites →https://doi.org/10.1016/j.tre.2022.102887openalex-extracted
Coordinating supply and demand in ride-sourcing markets with pre-assigned pooling service and traffic congestion externality
inferredcites →https://doi.org/10.1016/s0965-8564(00)00008-2openalex-extracted
Impacts of highway congestion on freight operations: perceptions of trucking industry managers
inferredcites →https://doi.org/10.1017/cbo9780511800481openalex-extracted
Algorithmic Game Theory
inferredcites →https://doi.org/10.1017/cbo9781316779309openalex-extracted
Twenty Lectures on Algorithmic Game Theory
inferredcites →https://doi.org/10.1073/pnas.36.1.48openalex-extracted
Equilibrium points in n -person games
inferredcites →https://doi.org/10.1080/13675560903181519openalex-extracted
Traffic congestion, reliability and logistical performance: a multi-sectoral assessment
inferredcites →https://doi.org/10.1109/focs.2006.55openalex-extracted
On the Impact of Combinatorial Structure on Congestion Games
inferredcites →https://doi.org/10.1109/focs.2011.50openalex-extracted
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
inferredcites →https://doi.org/10.1109/sfcs.2005.68openalex-extracted
Sink Equilibria and Convergence
inferredcites →https://doi.org/10.1137/1.9781611973068.89openalex-extracted
Efficient Coordination Mechanisms for Unrelated Machine Scheduling
inferredcites →https://doi.org/10.1137/18m1207880openalex-extracted
The Price of Stability of Weighted Congestion Games
inferredcites →https://doi.org/10.1137/21m1430042openalex-extracted
Settling the Complexity of Nash Equilibrium in Congestion Games
inferredcites →https://doi.org/10.1145/1007352.1007445openalex-extracted
The complexity of pure Nash equilibria
inferredcites →https://doi.org/10.1145/1060590.1060600openalex-extracted
The price of anarchy of finite congestion games
inferredcites →https://doi.org/10.1145/1187436.1216584openalex-extracted
Algorithms for pure Nash equilibria in weighted congestion games
inferredcites →https://doi.org/10.1145/1374376.1374428openalex-extracted
Inapproximability of pure nash equilibria
inferredcites →https://doi.org/10.1145/1516512.1516516openalex-extracted
Settling the complexity of computing two-player Nash equilibria
inferredcites →https://doi.org/10.1145/1785414.1785439openalex-extracted
Algorithmic game theory
inferredcites →https://doi.org/10.1145/2614687openalex-extracted
Approximate Pure Nash Equilibria in Weighted Congestion Games
inferredcites →https://doi.org/10.1145/3544585.3544600openalex-extracted
A Note on Two Problems in Connexion with Graphs
inferredcites →https://doi.org/10.1287/moor.1080.0322openalex-extracted
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
inferredcites →https://doi.org/10.1287/moor.1120.0543openalex-extracted
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
inferredcites →https://doi.org/10.1287/moor.2021.1144openalex-extracted
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
inferredcites →https://doi.org/10.1287/moor.2022.1292openalex-extracted
A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games
inferredcites →https://doi.org/10.1287/opre.2020.2036openalex-extracted
Selfishness Need Not Be Bad
inferredcites →https://doi.org/10.48550/arxiv.1107.2248openalex-extracted
Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure
inferredcites →https://doi.org/10.5555/1496770.1496859openalex-extracted
Efficient coordination mechanisms for unrelated machine scheduling
inferredcites →https://doi.org/10.6028/jres.073b.010openalex-extracted
Traffic assignment problem for a general network
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.