Disarmament Games With Resource

Authors: Yuan Deng, Vincent Conitzer

AAAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We prove NP-completeness of several formulations of the problem of achieving desirable outcomes via disarmament. We then study the case where resources can be fractionally removed, and prove a result analogous to the folk theorem that all desirable outcomes can be achieved. We show that we can approximately achieve any desirable outcome in a polynomial number of rounds, though determining whether a given outcome can be obtained in a given number of rounds remains NP-complete.
Researcher Affiliation Academia Yuan Deng, Vincent Conitzer Department of Computer Science Duke University Durham, NC 27708, USA {ericdy,conitzer}@cs.duke.edu
Pseudocode Yes Algorithm 1: Generate on-path strategy for feasible utilities that exceed security levels
Open Source Code No The paper does not provide any statement or link indicating the availability of open-source code for the described methodology.
Open Datasets No The paper is theoretical and does not use or mention any datasets for training or evaluation. Therefore, no information on publicly available datasets is provided.
Dataset Splits No The paper is theoretical and does not involve data splits for training, validation, or testing. Therefore, no specific data split information is provided.
Hardware Specification No The paper is theoretical and does not describe any experimental setup that would require specific hardware. Therefore, no hardware specifications are provided.
Software Dependencies No The paper is theoretical and does not describe any implementation details that would require specific software dependencies with version numbers.
Experiment Setup No The paper is theoretical and does not describe an experimental setup with hyperparameters or specific training configurations.