The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
Published Online:19 May 2023https://doi.org/10.1287/ijoc.2022.0282
- Cited by
- 8 July 2025 | Operations Research, Vol. 74, No. 2
- 31 July 2025 | Optimization Letters, Vol. 20, No. 1
- 13 March 2024 | Mathematical Programming, Vol. 209, No. 1-2
- 22 December 2023 | Management Science, Vol. 70, No. 10
- 21 February 2024 | INFORMS Journal on Computing, Vol. 36, No. 5
- 29 March 2024 | Transportation Science, Vol. 58, No. 3
Volume 35, Issue 5
September-October 2023
Pages 909-1213, C2
Article Information
Supplemental Material
Metrics
Information
- Received:September 22, 2022
- Accepted:April 10, 2023
- Published Online:May 19, 2023
Copyright © 2023, INFORMS
Cite as
Gabriele Dragotto, Rosario Scatamacchia (2023) The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming. INFORMS Journal on Computing 35(5):1143-1160.
https://doi.org/10.1287/ijoc.2022.0282
Keywords
The authors thank Ulrich Pferschy for the valuable discussions and thank the two anonymous referees for their insightful comments on this paper. Gabriele Dragotto is thankful for the support of the Canada Excellence Research Chair in “Data Science for Real-time Decision-making” at Polytechnique Montréal.
