Computational Complexity of Proper Equilibrium-Reference-Cited by-同舟云学术

Computational Complexity of Proper Equilibrium

Published:2018-06-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Hansen Kristoffer Arnsfelt¹,Lund Troels Bjerre²

Affiliation:

1. Aarhus University, Aarhus, Denmark

2. IT-University of Copenhagen, Copenhagen, Denmark

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3219166.3219199

Reference27 articles.

1. Near;Anderson R. M.;Trans. Amer. Math. Soc.,1986

2. S. Basu R. Pollack and M. Roy. 2008. Algorithms in Real Algebraic Geometry (second ed.). Springer. S. Basu R. Pollack and M. Roy. 2008. Algorithms in Real Algebraic Geometry (second ed.). Springer.

3. Settling the Complexity of Two-Player Nash Equilibrium

4. New complexity results about Nash equilibria

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Optimal resource allocation strategies of competing new online delivery platforms using the Bass diffusion model;Annals of Operations Research;2023-06-05

3. A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna;Mathematics of Operations Research;2022-09-26

4. FIXP-membership via Convex Optimization: Games, Cakes, and Markets;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game;Games and Economic Behavior;2021-01