On the public citation graph
Public Goods Games in Directed Networks
0 signed · 57 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/978-3-642-10631-6_66openalex-snapshot
Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria
inferredcites →https://doi.org/10.1007/978-3-642-25510-6_5openalex-snapshot
Optimal Pricing in Social Networks with Incomplete Information
inferredcites →https://doi.org/10.1007/s00453-014-9923-3openalex-snapshot
Pure Nash Equilibria in Graphical Games and Treewidth
inferredcites →https://doi.org/10.1016/0047-2727(86)90024-1openalex-snapshot
On the private provision of public goods
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/j.econlet.2013.08.003openalex-snapshot
Public goods in directed networks
inferredcites →https://doi.org/10.1016/j.geb.2012.03.001openalex-snapshot
Stochastic stability in best shot network games
inferredcites →https://doi.org/10.1016/j.jet.2014.02.002openalex-snapshot
Approximate Nash equilibria in anonymous games
inferredcites →https://doi.org/10.1016/j.jet.2015.01.007openalex-snapshot
On the Private Provision of Public Goods on Networks
inferredcites →https://doi.org/10.1016/s0022-0000(05)80063-7openalex-snapshot
On the complexity of the parity argument and other inefficient proofs of existence
inferredcites →https://doi.org/10.1093/comjnl/bxm037openalex-snapshot
Combinatorial Optimization on Graphs of Bounded Treewidth
inferredcites →https://doi.org/10.1093/oxfordhb/9780199948277.013.8openalex-snapshot
Games Played on Networks
inferredcites →https://doi.org/10.1109/focs.2009.29openalex-snapshot
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
inferredcites →https://doi.org/10.1109/focs.2016.35openalex-snapshot
Settling the Complexity of Computing Approximate Two-Player Nash Equilibria
inferredcites →https://doi.org/10.1109/sfcs.2005.59openalex-snapshot
On the Complexity of Two-PlayerWin-Lose Games
inferredcites →https://doi.org/10.1111/j.1467-9779.2011.01523.xopenalex-snapshot
Optimal Equilibria of the Best Shot Game
inferredcites →https://doi.org/10.1137/070699652openalex-snapshot
The Complexity of Computing a Nash Equilibrium
inferredcites →https://doi.org/10.1137/1.9781611973068.78openalex-snapshot
On the Complexity of Nash Equilibria of Action-Graph Games
inferredcites →https://doi.org/10.1137/15m1039274openalex-snapshot
Inapproximability of Nash Equilibrium
inferredcites →https://doi.org/10.1145/1134707.1134718openalex-snapshot
Computing pure nash equilibria in graphical games via markov random fields
inferredcites →https://doi.org/10.1145/1516512.1516516openalex-snapshot
Settling the complexity of computing two-player Nash equilibria
inferredcites →https://doi.org/10.1145/1970392.1970394openalex-snapshot
Market equilibrium under separable, piecewise-linear, concave utilities
inferredcites →https://doi.org/10.1145/2482540.2482594openalex-snapshot
Pricing public goods for private sale
inferredcites →https://doi.org/10.1145/2488608.2488632openalex-snapshot
The complexity of non-monotone markets
inferredcites →https://doi.org/10.1145/2746539.2746571openalex-snapshot
On the Complexity of Nash Equilibria in Anonymous Games
inferredcites →https://doi.org/10.1145/2956583openalex-snapshot
The Complexity of Fairness Through Equilibrium
inferredcites →https://doi.org/10.1145/3406325.3451125openalex-snapshot
The complexity of constrained min-max optimization
inferredcites →https://doi.org/10.1145/3465456.3467578openalex-snapshot
The Complexity of Pacing for Second-Price Auctions
inferredcites →https://doi.org/10.1145/3465456.3467616openalex-snapshot
Public Goods Games in Directed Networks
inferredcites →https://doi.org/10.1145/3465456.3467627openalex-snapshot
On the Complexity of Equilibrium Computation in First-Price Auctions
inferredcites →https://doi.org/10.1257/aer.104.3.898openalex-snapshot
Strategic Interaction and Networks
inferredcites →https://doi.org/10.1609/aaai.v34i02.5609openalex-snapshot
Computing Equilibria in Binary Networked Public Goods Games
inferredcites →https://doi.org/10.24963/ijcai.2017/56openalex-snapshot
Why You Should Charge Your Friends for Borrowing Your Stuff
inferredcites →https://doi.org/10.5555/1283383.1283401openalex-snapshot
The approximation complexity of win-lose 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.4602754openalex-extracted
The Initiation, Diffusion, and Realization of Robustly Efficient Coordination: A Monotone Game Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_11openalex-snapshot
Discrete Versions of the KKM Lemma and Their PPAD-Completeness
inferred← citeshttps://doi.org/10.1007/978-3-031-15714-1_10openalex-snapshot
PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games
inferred← citeshttps://doi.org/10.1007/978-3-031-15714-1_9openalex-snapshot
Complexity of Public Goods Games on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-55601-2_19openalex-snapshot
On Binary Networked Public Goods Game with Altruism
inferred← citeshttps://doi.org/10.1007/s10458-025-09696-7openalex-snapshot
Solving multi-agent games on networks
inferred← citeshttps://doi.org/10.1007/s11127-025-01265-6openalex-snapshot
Costs of choice: reformulating price theory without heroic assumptions
inferred← citeshttps://doi.org/10.1098/rsos.241928openalex-snapshot
Reverse game: from Nash equilibrium to network structure, number and probability of occurrence
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00022openalex-snapshot
Pure-Circuit: Strong Inapproximability for PPAD
inferred← citeshttps://doi.org/10.1109/tnse.2024.3388519openalex-snapshot
Structured Network Games: Leveraging Relational Information in Equilibrium Analysis
inferred← citeshttps://doi.org/10.1145/3564246.3585195openalex-snapshot
Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules
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/3618260.3649645openalex-snapshot
PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization
inferred← citeshttps://doi.org/10.1145/3678166openalex-snapshot
Pure-Circuit: Tight Inapproximability for PPAD
inferred← citeshttps://doi.org/10.1145/3696410.3714869openalex-snapshot
Networked Digital Public Goods Games with Heterogeneous Players and Convex Costs
inferred← citeshttps://doi.org/10.3390/math11143037openalex-snapshot
Aspiration-Based Learning in k-Hop Best-Shot Binary Networked Public Goods Games
inferred← citeshttps://doi.org/10.48550/arxiv.2107.10923openalex-snapshot
Throttling Equilibria in Auction Markets
showing the first 18 of 19 · page through all 19
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.