Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in [1].
The Complexity of Matching Games: A Survey
Authors: Marton Benedek, Peter Biro, Matthew Johnson, Daniel Paulusma, Xin Ye
JAIR 2023 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | This state-of-the-art survey provides an overview of matching games and extensions... In this survey we focus on computational complexity aspects of various game-theoretical solution concepts... |
| Researcher Affiliation | Academia | Marton Benedek EMAIL Peter Biro EMAIL Institute of Economics, KRTK, Toth Kalman u. 4., Budapest, Hungary Corvinus University of Budapest Fovam ter 8., Budapest, Hungary Matthew Johnson EMAIL Daniel Paulusma EMAIL Xin Ye EMAIL Department of Computer Science, Durham University, Upper Mountjoy Campus, Stockton Road, Durham, UK |
| Pseudocode | No | The paper discusses algorithms and computational complexity aspects of game-theoretical solution concepts but does not contain any structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper is a survey and does not describe new methodologies requiring code release. There are no statements about providing source code or links to repositories for the work presented in this paper. |
| Open Datasets | No | The paper is a survey focusing on computational complexity aspects of matching games. It discusses applications and references other studies that performed simulations (e.g., 'Simulations using their model have also been performed, with different parameters, by Biró et al. (2020), and for international KEPs with pairwise exchanges only, but with a larger number of countries than the two previous studies, by Benedek et al. (2022)'). However, this paper does not present its own experimental data or provide access information for any open datasets used in its analysis. |
| Dataset Splits | No | The paper is a theoretical survey and does not present experimental results that would require dataset split information. |
| Hardware Specification | No | The paper is a theoretical survey of computational complexity aspects and does not describe any experimental setups or specific hardware used for running experiments. |
| Software Dependencies | No | The paper is a theoretical survey and does not describe experimental procedures that would necessitate detailing specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is a theoretical survey and does not contain details about an experimental setup, such as hyperparameters or system-level training settings. |