Principal-Agent Boolean Games

Authors: David Hyland, Julian Gutierrez, Michael Wooldridge

IJCAI 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical In this paper, we formally define this problem and completely characterise the computational complexity of the most relevant decision problems associated with it.
Researcher Affiliation Academia 1University of Oxford, UK 2Monash University, Australia {david.hyland, mjw}@cs.ox.ac.uk, julian.gutierrez@monash.edu
Pseudocode No The paper contains formal definitions, propositions, and theorems, but no explicitly labeled 'Pseudocode' or 'Algorithm' blocks, nor structured code-like procedures.
Open Source Code No The paper does not provide an explicit statement about releasing source code or a link to a code repository for the methodology described.
Open Datasets No As a theoretical paper, it does not involve training models on datasets, so there is no mention of publicly available or open datasets.
Dataset Splits No This theoretical paper does not conduct empirical experiments, and therefore, no training/test/validation dataset splits are mentioned.
Hardware Specification No The paper does not mention any specific hardware specifications such as GPU or CPU models used for computational tasks.
Software Dependencies No The paper does not list specific software dependencies with version numbers, such as programming languages, libraries, or solvers.
Experiment Setup No This is a theoretical paper and does not describe an experimental setup with hyperparameter values or training configurations.