Coalition Formation in Multi-defender Security Games
Authors: Dolev Mutzari, Jiarui Gan, Sarit Kraus5603-5610
AAAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our main contribution is a number of algorithmic results for the computation problems that arise in this model. We provide a poly-time algorithm for computing a solution in the core of the game and show that all of the elements in the core are Pareto efficient. We show that the problem of computing the entire core is NP-hard and then delve into a special setting where the size of a coalition is limited up to some threshold. |
| Researcher Affiliation | Academia | Dolev Mutzari,1 Jiarui Gan,2 Sarit Kraus1 1Department of Computer Science, Bar-Ilan University 2Max Planck Institute for Software Systems dolevmu@gmail.com, jrgan@mpi-sws.org, sarit@cs.biu.ac.il |
| Pseudocode | Yes | Algorithm 1: Construct a coalition structure in the 0+-core. Algorithm 2: Solve (5). |
| Open Source Code | No | The paper does not provide any explicit statements about releasing source code or links to a code repository for the methodology described. |
| Open Datasets | No | The paper is theoretical and focuses on algorithmic and complexity results within game theory. It does not use or mention any specific datasets for training or evaluation, nor does it provide access information for any dataset. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments with data. Therefore, there is no mention of training, validation, or test dataset splits. |
| Hardware Specification | No | The paper is theoretical and does not describe any experiments that would require specific hardware. Therefore, no hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and focuses on algorithmic descriptions and proofs. It does not list any specific software dependencies with version numbers (e.g., programming languages, libraries, or solvers) required for implementation or replication. |
| Experiment Setup | No | The paper is theoretical, presenting algorithms and complexity analysis rather than empirical experiments. Consequently, it does not include details on experimental setup, hyperparameters, or training configurations. |