Fast Algorithms for Rank-1 Bimatrix Games-Reference-Cited by-同舟云学术

Fast Algorithms for Rank-1 Bimatrix Games

Published:2021-03 Issue:2 Volume:69 Page:613-631
ISSN:0030-364X
Container-title:Operations Research
language:en
Short-container-title:Operations Research

Author:

Adsul Bharat¹,Garg Jugal²,Mehta Ruta³,Sohoni Milind¹,von Stengel Bernhard⁴^ORCID

Affiliation:

1. Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400 076, India;

2. Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801;

3. Department of Computer Science, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801;

4. Department of Mathematics, London School of Economics, London WC2A 2AE, United Kingdom

Abstract

Games with multiplicative payoffs

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

Reference43 articles.

1. A geometric view of parametric linear programming

2. Adsul B, Garg J, Mehta R, Sohoni M (2011) Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm. Proc. 43rd Annual ACM Sympos. Theory Comput. (STOC) (Association for Computing Machinery, New York), 195–204.

3. Avis D (2000) lrs: A revised implementation of the reverse search vertex enumeration algorithm. Kalai G, Ziegler G, eds. Polytopes–Combinatorics and Computation (Birkhäuser Verlag, Basel, Switzerland), 177–198.

4. Enumeration of Nash equilibria for two-player games

5. Matching and Price Competition

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

1. Semidefinite games;International Journal of Game Theory;2024-06-20

2. Best-response Algorithms for Integer Convex Quadratic Simultaneous Games;SSRN Electronic Journal;2024

3. Rank Reduction in Bimatrix Games;International Game Theory Review;2022-07-04