Polynomial-Time Computation of Exact $\Phi$-Equilibria in Polyhedral Games
Authors: Gabriele Farina, Charilaos Pipis
NeurIPS 2024 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Since this is a purely theoretical paper, exploring the tractability of computing high-precision equilibria in games (and giving a polynomial-time algorithm of rather high complexity), it does not include any experiments. |
| Researcher Affiliation | Academia | Gabriele Farina MIT gfarina@mit.edu Charilaos Pipis MIT chpipis@mit.edu |
| Pseudocode | Yes | Algorithm 1: Ellipsoid Against Hope for bilinear zero-sum games |
| Open Source Code | No | The paper does not include experiments requiring code. |
| Open Datasets | No | Since this is a purely theoretical paper, exploring the tractability of computing high-precision equilibria in games (and giving a polynomial-time algorithm of rather high complexity), it does not include any experiments. |
| Dataset Splits | No | The paper does not include experiments. |
| Hardware Specification | No | The paper does not include experiments. |
| Software Dependencies | No | The paper does not include experiments. Therefore, it does not specify any software dependencies for experimental execution. |
| Experiment Setup | No | The paper does not include experiments. |