Public goods games in directed networks

DOI10.1016/j.geb.2023.02.002zbMath1519.91054arXiv2106.00718MaRDI QIDQ6102516

No author found.

Publication date: 23 June 2023

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.00718

zbMATH Keywords

algorithmspublic goodscomplexity theorygraphical gamesequilibrium computation

Mathematics Subject Classification ID

Games involving graphs (91A43) Public goods (91B18) Algorithmic game theory and complexity (91A68) Equilibrium refinements (91A11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic stability in best shot network games
• On the private provision of public goods on networks
• Public goods in networks
• On the complexity of the parity argument and other inefficient proofs of existence
• Stability in games with continua of equilibria
• Approximate Nash equilibria in anonymous games
• Pure Nash equilibria in graphical games and treewidth
• Public goods in directed networks
• On the Complexity of Nash Equilibria in Anonymous Games
• Market equilibrium under separable, piecewise-linear, concave utilities
• Network Games
• Settling the complexity of computing two-player Nash equilibria
• Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria
• Graph minors. II. Algorithmic aspects of tree-width
• Inapproximability of Nash Equilibrium
• Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
• The Complexity of Computing a Nash Equilibrium
• Constant rank bimatrix games are PPAD-hard
• Equilibrium Points of Bimatrix Games
• Exact double domination in graphs
• The complexity of non-monotone markets
• The complexity of constrained min-max optimization

This page was built for publication: Public goods games in directed networks