Strategic Coalitions With Perfect Recall
Authors: Pavel Naumov, Jia Tao
AAAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | The paper proposes a bimodal logic that describes an interplay between distributed knowledge modality and coalition know-how modality. Unlike other similar systems, the one proposed here assumes perfect recall by all agents. Perfect recall is captured in the system by a single axiom. The main technical results are the soundness and the completeness theorems for the proposed logical system. |
| Researcher Affiliation | Academia | Pavel Naumov Department of Computer Science Vassar College Poughkeepsie, New York 12604 pnaumov@vassar.edu Jia Tao Department of Computer Science Lafayette College Easton, Pennsylvania 18042 taoj@lafayette.edu |
| Pseudocode | No | The paper does not contain any pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any information about open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not use or reference any datasets for training. |
| Dataset Splits | No | The paper is theoretical and does not discuss validation splits or data. |
| Hardware Specification | No | The paper is theoretical and does not mention any hardware specifications for running experiments. |
| Software Dependencies | No | The paper is theoretical and does not mention any specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details such as hyperparameters or training configurations. |