On the public citation graph
On the Impact of Combinatorial Structure on Congestion Games
0 signed · 240 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.1007/11944874_6openalex-snapshot
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games
inferredcites →https://doi.org/10.1007/bf01737559openalex-snapshot
A class of games possessing pure-strategy Nash equilibria
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/s0304-3975(96)00017-5openalex-snapshot
Computing with truly asynchronous threshold logic 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/tnet.2004.826279openalex-snapshot
Internet Indirection Infrastructure
inferredcites →https://doi.org/10.1137/0220004openalex-snapshot
Simple Local Search Problems that are Hard to Solve
inferredcites →https://doi.org/10.1137/s0097539793245350openalex-snapshot
Integer Linear Programs and Local Search for Max-Cut
inferredcites →https://doi.org/10.1145/1007352.1007445openalex-snapshot
The complexity of pure Nash equilibria
inferredcites →https://doi.org/10.1145/1064009.1064015openalex-snapshot
Fairness and optimality in congestion games
inferredcites →https://doi.org/10.1145/351827.384253openalex-snapshot
Finding minimum congestion spanning trees
inferredcites →https://doi.org/10.1145/780542.780617openalex-snapshot
Near-optimal network design with selfish agents
inferredcites →https://doi.org/10.1145/989459.989467openalex-snapshot
Market sharing games applied to content distribution in ad-hoc networks
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.1002/9780470175668.ch10openalex-snapshot
Algorithmic Game Theory and Applications
inferred← citeshttps://doi.org/10.1002/net.20444openalex-snapshot
Computing approximate Nash equilibria in network congestion games
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/11944874_7openalex-snapshot
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_2openalex-snapshot
Algorithmic Game Theory: Some Greatest Hits and Future Directions
inferred← citeshttps://doi.org/10.1007/978-3-030-04612-5_28openalex-snapshot
Cost-Sharing Games in Real-Time Scheduling Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_37openalex-snapshot
Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function
inferred← citeshttps://doi.org/10.1007/978-3-030-57980-7_6openalex-snapshot
Equilibrium Inefficiency in Resource Buying Games with Load-Dependent Costs
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_14openalex-snapshot
Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-64946-3_20openalex-snapshot
Improving Approximate Pure Nash Equilibria in Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-030-85947-3_13openalex-snapshot
Pure Nash Equilibria in a Generalization of Congestion Games Allowing Resource Failures
inferred← citeshttps://doi.org/10.1007/978-3-031-15714-1_18openalex-snapshot
On the Impact of Player Capability on Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-031-71033-9_20openalex-snapshot
Price of Anarchy in Paving Matroid Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-031-71033-9_21openalex-snapshot
Price of Anarchy for Graphic Matroid Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-319-07001-8_34openalex-snapshot
Competition for Resources
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_44openalex-snapshot
On the Performance of Mildly Greedy Players in Cut Games
inferred← citeshttps://doi.org/10.1007/978-3-319-13129-0_3openalex-snapshot
Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_14openalex-snapshot
A Selective Tour Through Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_9openalex-snapshot
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_47openalex-snapshot
Congestion Games with Mixed Objectives
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_19openalex-snapshot
Congestion Games with Complementarities
inferred← citeshttps://doi.org/10.1007/978-3-319-59250-3_36openalex-snapshot
Equilibrium Computation in Atomic Splittable Singleton Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-319-71924-5_14openalex-snapshot
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_18openalex-snapshot
Computing Approximate Nash Equilibria in Network Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_65openalex-snapshot
The Speed of Convergence in Congestion Games under Best-Response Dynamics
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_56openalex-snapshot
Congestion Games with Player-Specific Constants
inferred← citeshttps://doi.org/10.1007/978-3-540-74871-7_6openalex-snapshot
A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_6openalex-snapshot
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
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-77105-0_7openalex-snapshot
A Unified Approach to Congestion Games and Two-Sided Markets
inferred← citeshttps://doi.org/10.1007/978-3-540-79309-0_12openalex-snapshot
Atomic Congestion Games: Fast, Myopic and Concurrent
inferred← citeshttps://doi.org/10.1007/978-3-540-79309-0_5openalex-snapshot
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
inferred← citeshttps://doi.org/10.1007/978-3-540-92185-1_18openalex-snapshot
On the Road to $\mathcal{PLS}$ -Completeness: 8 Agents in a Singleton Congestion Game
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-642-02011-7_17openalex-snapshot
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_13openalex-snapshot
Management of Variable Data Streams in Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_16openalex-snapshot
Altruism in Atomic Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_31openalex-snapshot
Dynamics in Network Interaction Games
inferred← citeshttps://doi.org/10.1007/978-3-642-04645-2_18openalex-snapshot
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-04645-2_28openalex-snapshot
Performances of One-Round Walks in Linear Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_29openalex-snapshot
The Impact of Social Ignorance on Weighted Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_33openalex-snapshot
Nash Dynamics in Congestion Games with Similar Resources
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_4openalex-snapshot
Competitive Routing over Time
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_61openalex-snapshot
On the Impact of Strategy and Utility Structures on Congestion-Averse Games
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_7openalex-snapshot
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays
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.1007/978-3-642-14165-2_1openalex-snapshot
Local Search: Simple, Successful, But Sometimes Sluggish
inferred← citeshttps://doi.org/10.1007/978-3-642-15781-3_3openalex-snapshot
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-16170-4_27openalex-snapshot
On the Complexity of Pareto-optimal Nash and Strong Equilibria
inferred← citeshttps://doi.org/10.1007/978-3-642-17572-5_30openalex-snapshot
The Complexity of Equilibria in Cost Sharing Games
inferred← citeshttps://doi.org/10.1007/978-3-642-17572-5_36openalex-snapshot
The Good, The Bad and The Cautious: Safety Level Cooperative Games
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_14openalex-snapshot
Pairwise-Interaction Games
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_15openalex-snapshot
Settling the Complexity of Local Max-Cut (Almost) Completely
inferred← citeshttps://doi.org/10.1007/978-3-642-25510-6_23openalex-snapshot
The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays
inferred← citeshttps://doi.org/10.1007/978-3-642-30373-9_20openalex-snapshot
Convergence Dynamics of Resource-Homogeneous Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_14openalex-snapshot
Mobile Network Creation Games
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_33openalex-snapshot
On the Impact of Fair Best Response Dynamics
inferred← citeshttps://doi.org/10.1007/978-3-642-33996-7_12openalex-snapshot
Capacitated Network Design Games
inferred← citeshttps://doi.org/10.1007/978-3-642-33996-7_18openalex-snapshot
Congestion Games with Capacitated Resources
inferred← citeshttps://doi.org/10.1007/978-3-642-33996-7_22openalex-snapshot
A Theoretical Examination of Practical Game Playing: Lookahead Search
inferred← citeshttps://doi.org/10.1007/978-3-642-35311-6_38openalex-snapshot
Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects
inferred← citeshttps://doi.org/10.1007/978-3-642-35582-0_3openalex-snapshot
Convergence Dynamics of Graphical Congestion Games
inferred← citeshttps://doi.org/10.1007/978-3-642-41392-6_8openalex-snapshot
Stochastic Congestion Games with Risk-Averse Players
inferred← citeshttps://doi.org/10.1007/978-3-662-48995-6_9openalex-snapshot
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-53354-3_4openalex-snapshot
Complexity and Optimality of the Best Response Algorithm in Random Potential Games
inferred← citeshttps://doi.org/10.1007/978-3-662-53354-3_9openalex-snapshot
Efficiency of Equilibria in Uniform Matroid Congestion Games
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_17openalex-snapshot
Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design
inferred← citeshttps://doi.org/10.1007/978-981-96-2845-2_23openalex-snapshot
A Unified Model of Congestion Games with Priorities
inferred← citeshttps://doi.org/10.1007/s00182-022-00819-yopenalex-snapshot
Cost-sharing games in real-time scheduling systems
inferred← citeshttps://doi.org/10.1007/s00199-009-0448-yopenalex-snapshot
Computing equilibria: a computational complexity perspective
inferred← citeshttps://doi.org/10.1007/s00224-009-9198-2openalex-snapshot
Atomic Congestion Games: Fast, Myopic and Concurrent
inferred← citeshttps://doi.org/10.1007/s00224-009-9205-7openalex-snapshot
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
inferred← citeshttps://doi.org/10.1007/s00224-011-9355-2openalex-snapshot
The Impact of Social Ignorance on Weighted Congestion Games
inferred← citeshttps://doi.org/10.1007/s00224-012-9433-0openalex-snapshot
On the Complexity of Pareto-Optimal Nash and Strong Equilibria
inferred← citeshttps://doi.org/10.1007/s00224-014-9540-1openalex-snapshot
Capacitated Network Design Games
inferred← citeshttps://doi.org/10.1007/s00224-014-9541-0openalex-snapshot
Congestion Games with Capacitated Resources
inferred← citeshttps://doi.org/10.1007/s00287-010-0462-2openalex-snapshot
Berechnung von Nash-Gleichgewichten
inferred← citeshttps://doi.org/10.1007/s00446-011-0145-5openalex-snapshot
On best response dynamics in weighted congestion games with polynomial delays
inferred← citeshttps://doi.org/10.1007/s00446-012-0171-yopenalex-snapshot
Dynamics in network interaction games
inferred← citeshttps://doi.org/10.1007/s00446-014-0223-6openalex-snapshot
Concurrent imitation dynamics in congestion games
inferred← citeshttps://doi.org/10.1007/s00446-020-00381-4openalex-snapshot
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
inferred← citeshttps://doi.org/10.1007/s00453-010-9482-1openalex-snapshot
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
inferred← citeshttps://doi.org/10.1007/s00453-012-9650-6openalex-snapshot
Efficient Coordination Mechanisms for Unrelated Machine Scheduling
inferred← citeshttps://doi.org/10.1007/s10107-012-0521-3openalex-snapshot
Computing pure Nash and strong equilibria in bottleneck congestion games
inferred← citeshttps://doi.org/10.1007/s10107-020-01546-6openalex-snapshot
Computation and efficiency of potential function minimizers of combinatorial congestion games
inferred← citeshttps://doi.org/10.1007/s10107-020-01604-zopenalex-snapshot
Equilibrium computation in resource allocation games
inferred← citeshttps://doi.org/10.1007/s10107-021-01625-2openalex-snapshot
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
inferred← citeshttps://doi.org/10.1007/s10107-022-01803-wopenalex-snapshot
The price of Anarchy in series-parallel network congestion games
inferred← citeshttps://doi.org/10.1007/s10114-014-3055-1openalex-snapshot
Stability vs. optimality in selfish ring routing
inferred← citeshttps://doi.org/10.1007/s10479-019-03246-7openalex-snapshot
Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms
inferred← citeshttps://doi.org/10.1007/s10878-015-9898-2openalex-snapshot
On the performance of mildly greedy players in cut games
inferred← citeshttps://doi.org/10.1007/s10878-017-0189-yopenalex-snapshot
Congestion games with mixed objectives
inferred← citeshttps://doi.org/10.1007/s10878-019-00435-9openalex-snapshot
Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
inferred← citeshttps://doi.org/10.1007/s11225-014-9549-0openalex-snapshot
Subgames within Large Games and the Heuristic of Imitation
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103177openalex-snapshot
Leadership in singleton congestion games: What is hard and what is easy
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104241openalex-snapshot
The complexity of optimizing atomic congestion
inferred← citeshttps://doi.org/10.1016/j.automatica.2016.10.002openalex-snapshot
Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
inferred← citeshttps://doi.org/10.1016/j.cosrev.2009.03.004openalex-snapshot
Equilibria, fixed points, and complexity classes
inferred← citeshttps://doi.org/10.1016/j.disopt.2019.03.004openalex-snapshot
Combinatorial optimization with interaction costs: Complexity and solvable cases
inferred← citeshttps://doi.org/10.1016/j.econlet.2013.10.005openalex-snapshot
Greediness and equilibrium in congestion games
inferred← citeshttps://doi.org/10.1016/j.fmre.2025.11.014openalex-snapshot
Computing approximate pure Nash equilibria for weighted congestion games
inferred← citeshttps://doi.org/10.1016/j.geb.2009.05.004openalex-snapshot
Convergence to approximate Nash equilibria in congestion games
inferred← citeshttps://doi.org/10.1016/j.geb.2020.09.006openalex-snapshot
Best-response dynamics in combinatorial auctions with item bidding
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.07.012openalex-snapshot
Convergence of best-response dynamics in games with conflicting congestion effects
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.07.012openalex-snapshot
The complexity of pure equilibria in mix-weighted congestion games on parallel links
inferred← citeshttps://doi.org/10.1016/j.jet.2014.02.002openalex-snapshot
Approximate Nash equilibria in anonymous games
inferred← citeshttps://doi.org/10.1016/j.orl.2015.04.002openalex-snapshot
Congestion games viewed from M-convexity
inferred← citeshttps://doi.org/10.1016/j.orl.2016.09.001openalex-snapshot
A logarithmic approximation for polymatroid congestion games
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.004openalex-snapshot
The structure and complexity of Nash equilibria for a selfish routing game
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.1016/j.tcs.2011.05.055openalex-snapshot
Competitive routing over time
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113933openalex-snapshot
Pure Nash equilibria in a generalization of congestion games allowing resource failures
inferred← citeshttps://doi.org/10.1057/s41302-016-0012-yopenalex-snapshot
The Complexity of Coordination
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.1080/15427951.2008.10129171openalex-snapshot
A Unified Approach to Congestion Games and Two-Sided Markets
inferred← citeshttps://doi.org/10.1080/15427951.2013.830164openalex-snapshot
Dynamics of Profit-Sharing Games
inferred← citeshttps://doi.org/10.1109/access.2025.3564718openalex-snapshot
Centralised Decision Support in Maritime Vessel Traffic Services: A Polymatrix Game Solution
inferred← citeshttps://doi.org/10.1109/cdc.2015.7402771openalex-snapshot
An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798943openalex-snapshot
A random tree search algorithm for Nash equilibrium in capacitated selfish replication games
inferred← citeshttps://doi.org/10.1109/eucnc.2016.7561037openalex-snapshot
Multi-user computation offloading as Multiple Knapsack Problem for 5G Mobile Edge Computing
inferred← citeshttps://doi.org/10.1109/focs.2011.50openalex-snapshot
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00137openalex-snapshot
Communication complexity of Nash equilibrium in potential games (extended abstract)
inferred← citeshttps://doi.org/10.1109/gamenets.2009.5137458openalex-snapshot
Congestion games: Equilibria, convergence and complexity
inferred← citeshttps://doi.org/10.1109/hicss.2009.317openalex-snapshot
MultiProcessor Scheduling is PLS-Complete
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00121openalex-snapshot
On Sharding Open Blockchains with Smart Contracts
inferred← citeshttps://doi.org/10.1109/infocom.2019.8737480openalex-snapshot
Wireless and Computing Resource Allocation for Selfish Computation Offloading in Edge Computing
inferred← citeshttps://doi.org/10.1109/tac.2021.3052497openalex-snapshot
Utility Design for Distributed Resource Allocation—Part II: Applications to Submodular, Covering, and Supermodular Problems
inferred← citeshttps://doi.org/10.1109/tcc.2019.2923768openalex-snapshot
Joint Management of Wireless and Computing Resources for Computation Offloading in Mobile Edge Clouds
inferred← citeshttps://doi.org/10.1109/tmc.2012.207openalex-snapshot
Network Selection and Resource Allocation Games for Wireless Access Networks
inferred← citeshttps://doi.org/10.1109/tmc.2024.3350886openalex-snapshot
Joint Task Offloading and Resource Allocation in Aerial-Terrestrial UAV Networks With Edge and Fog Computing for Post-Disaster Rescue
inferred← citeshttps://doi.org/10.1109/tnet.2011.2173948openalex-snapshot
On a Noncooperative Model for Wavelength Assignment in Multifiber Optical Networks
inferred← citeshttps://doi.org/10.1137/1.9781611973068.89openalex-snapshot
Efficient Coordination Mechanisms for Unrelated Machine Scheduling
inferred← citeshttps://doi.org/10.1137/1.9781611974782.33openalex-snapshot
Best-Response Dynamics in Combinatorial Auctions with Item Bidding
inferred← citeshttps://doi.org/10.1137/1.9781611974782.37openalex-snapshot
Totally Unimodular Congestion Games
inferred← citeshttps://doi.org/10.1137/1.9781611975994.166openalex-snapshot
Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch149openalex-snapshot
Sampling Equilibria: Fast No-Regret Learning in Structured Games
inferred← citeshttps://doi.org/10.1137/110821317openalex-snapshot
Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior
inferred← citeshttps://doi.org/10.1137/18m1207880openalex-snapshot
The Price of Stability of Weighted Congestion Games
inferred← citeshttps://doi.org/10.1137/19m1242525openalex-snapshot
Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks
inferred← citeshttps://doi.org/10.1137/20m1312678openalex-snapshot
The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
inferred← citeshttps://doi.org/10.1137/20m1361523openalex-snapshot
Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians
inferred← citeshttps://doi.org/10.1142/s0129626412500144openalex-snapshot
COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE
inferred← citeshttps://doi.org/10.1145/1073970.1074000openalex-snapshot
Selfish routing with incomplete information
inferred← citeshttps://doi.org/10.1145/1374376.1374428openalex-snapshot
Inapproximability of pure nash equilibria
inferred← citeshttps://doi.org/10.1145/1386790.1386832openalex-snapshot
Fast convergence to nearly optimal solutions in potential games
inferred← citeshttps://doi.org/10.1145/1536414.1536485openalex-snapshot
Intrinsic robustness of the price of anarchy
inferred← citeshttps://doi.org/10.1145/1582716.1582732openalex-snapshot
Concurrent imitation dynamics in congestion games
inferred← citeshttps://doi.org/10.1145/1807342.1807353openalex-snapshot
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
inferred← citeshttps://doi.org/10.1145/2000378.2000392openalex-snapshot
Neighbourhood structure in large games
inferred← citeshttps://doi.org/10.1145/2229012.2229036openalex-snapshot
Approximate pure nash equilibria in weighted congestion games
inferred← citeshttps://doi.org/10.1145/2229163.2229169openalex-snapshot
The speed of convergence in congestion games under best-response dynamics
inferred← citeshttps://doi.org/10.1145/2325713.2325718openalex-snapshot
Computing approximate pure Nash equilibria in congestion games
inferred← citeshttps://doi.org/10.1145/2542174.2542177openalex-snapshot
Altruism in Atomic Congestion Games
inferred← citeshttps://doi.org/10.1145/2614687openalex-snapshot
Approximate Pure Nash Equilibria in Weighted Congestion Games
inferred← citeshttps://doi.org/10.1145/2629671openalex-snapshot
Distributed Selfish Load Balancing on Networks
inferred← citeshttps://doi.org/10.1145/2746539.2746571openalex-snapshot
On the Complexity of Nash Equilibria in Anonymous Games
inferred← citeshttps://doi.org/10.1145/2806883openalex-snapshot
Intrinsic Robustness of the Price of Anarchy
inferred← citeshttps://doi.org/10.1145/2940716.2940750openalex-snapshot
Dynamic Taxes for Polynomial Congestion Games
inferred← citeshttps://doi.org/10.1145/3011870openalex-snapshot
Smoothed Analysis of Local Search for the Maximum-Cut Problem
inferred← citeshttps://doi.org/10.1145/3033274.3085149openalex-snapshot
Potential Function Minimizers of Combinatorial Congestion Games
inferred← citeshttps://doi.org/10.1145/3355946openalex-snapshot
Dynamic Taxes for Polynomial Congestion Games
inferred← citeshttps://doi.org/10.1145/3406325.3451039openalex-snapshot
Settling the Complexity of Nash Equilibrium in Congestion Games
inferred← citeshttps://doi.org/10.1145/3544978openalex-snapshot
Nash Social Welfare in Selfish and Online Load Balancing
inferred← citeshttps://doi.org/10.1145/3564246.3585236openalex-snapshot
Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming
inferred← citeshttps://doi.org/10.1145/3580507.3597780openalex-snapshot
Complexity of equilibria in binary public goods games on undirected graphs
inferred← citeshttps://doi.org/10.1145/3670865.3673615openalex-snapshot
A Smoothed FPTAS for Equilibria in Congestion Games
inferred← citeshttps://doi.org/10.1145/3787968openalex-snapshot
Price of Anarchy in Paving Matroid Congestion Games
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.1287/moor.1120.0567openalex-snapshot
Optimal Cost Sharing for Resource Selection Games
inferred← citeshttps://doi.org/10.1287/moor.2016.0825openalex-snapshot
Matroids Are Immune to Braess’ Paradox
inferred← citeshttps://doi.org/10.1287/moor.2021.1144openalex-snapshot
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
inferred← citeshttps://doi.org/10.1287/moor.2021.1159openalex-snapshot
Coordination Games on Weighted Directed Graphs
inferred← citeshttps://doi.org/10.1287/moor.2021.1223openalex-snapshot
Equilibria in Multiclass and Multidimensional Atomic Congestion Games
inferred← citeshttps://doi.org/10.1287/moor.2022.1322openalex-snapshot
Sampling from the Gibbs Distribution in Congestion Games
inferred← citeshttps://doi.org/10.1287/moor.2024.0610openalex-snapshot
On the Smoothed Complexity of Combinatorial Local Search
inferred← citeshttps://doi.org/10.1287/trsc.2021.1041openalex-snapshot
The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems
inferred← citeshttps://doi.org/10.14279/depositonce-3388openalex-snapshot
Competition for Resources: The Equilibrium Existence Problem in Congestion Games
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.29982openalex-snapshot
The Complexity of Optimizing Atomic Congestion
inferred← citeshttps://doi.org/10.1613/jair.1.12668openalex-snapshot
Pure Nash Equilibria in Resource Graph Games
inferred← citeshttps://doi.org/10.23919/acc.2019.8815011openalex-snapshot
Optimal Price of Anarchy in Cost-Sharing Games
inferred← citeshttps://doi.org/10.24963/ijcai.2018/62openalex-snapshot
Leadership in Singleton Congestion Games
inferred← citeshttps://doi.org/10.24963/ijcai.2019/69openalex-snapshot
Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions
inferred← citeshttps://doi.org/10.26481/dis.20180119toopenalex-snapshot
Approximation Algorithms in Allocation, Scheduling and Pricing
inferred← citeshttps://doi.org/10.3390/g15020007openalex-snapshot
Nash Equilibria in Two-Resource Congestion Games with Player-Specific Payoff Functions
showing the first 199 of 226 · page through all 226
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.