Distributing Coalition Value Calculations to Coalition Members

Authors: Luke Riley, Katie Atkinson, Paul Dunne, Terry Payne

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

Reproducibility Variable Result LLM Response
Research Type Theoretical The DCG algorithm is presented and illustrated by means of an example. We formally prove that our approach allocates all of the coalitions to the agents, and that each coalition is assigned once and only once. The algorithm has been evaluated theoretically, resulting in the proofs that: (a) all coalitions are assigned; and (b) each coalition is assigned once and only once.
Researcher Affiliation Academia Luke Riley, Katie Atkinson, Paul E. Dunne and Terry R. Payne Department of Computer Science University of Liverpool Liverpool, UK {L.J.Riley, K.M.Atkinson, P.E.Dunne, T.R.Payne}@liverpool.ac.uk
Pseudocode Yes Algorithm 1: The Distributed Coalition Generation (DCG) Algorithm; Algorithm 2: One possible method to find representative IAs from equivalence classes of .
Open Source Code No The paper does not provide any information or links regarding the availability of open-source code for the methodology described.
Open Datasets No The paper is theoretical and does not conduct experiments using a dataset for training or evaluation. It includes an example in Table 1 but this is illustrative, not a dataset used for empirical validation.
Dataset Splits No The paper is theoretical and does not involve experimental validation with dataset splits (training, validation, test).
Hardware Specification No The paper is theoretical and does not describe any experiments that would require specific hardware specifications.
Software Dependencies No The paper is theoretical and does not list any specific software dependencies with version numbers.
Experiment Setup No The paper is theoretical and focuses on algorithm design and proofs, thus it does not include details about an experimental setup or hyperparameters.