Pessimistic Leader-Follower Equilibria with Multiple Followers
Authors: Stefano Coniglio, Nicola Gatti, Alberto Marchesi
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Preliminary results (omitted for reasons of space) on three-player GAMUT instances [Nudelman et al., 2004] show that, with our branch-and-bound algorithm, we can solve games with up to 30 actions within 1000 seconds. |
| Researcher Affiliation | Academia | Stefano Coniglio University of Southampton University Road, SO17 1BJ Southampton, United Kingdom s.coniglio@soton.ac.uk Nicola Gatti and Alberto Marchesi Politecnico di Milano Piazza Leonardo da Vinci, 32 Milano, Italy {nicola.gatti, alberto.marchesi}@polimi.it |
| Pseudocode | No | The paper describes algorithms but does not provide them in a structured pseudocode block or algorithm environment. |
| Open Source Code | No | The paper does not provide any explicit statements or links indicating that source code for the described methodology is available. |
| Open Datasets | Yes | Preliminary results (omitted for reasons of space) on three-player GAMUT instances [Nudelman et al., 2004] show that, with our branch-and-bound algorithm, we can solve games with up to 30 actions within 1000 seconds. |
| Dataset Splits | No | The paper does not specify exact dataset split percentages, sample counts, or refer to predefined splits for training, validation, or test sets. |
| Hardware Specification | No | The paper does not provide specific details about the hardware used to run the experiments. |
| Software Dependencies | No | The paper does not list specific software dependencies with version numbers. |
| Experiment Setup | No | The paper mentions solving games 'within 1000 seconds' but does not provide specific hyperparameters, training configurations, or system-level settings. |