Probability Bounds for Overlapping Coalition Formation
Authors: Michail Mamakos, Georgios Chalkiadakis
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We evaluate our methods by conducting experiments over both a 300 nodes Erd os-Renyi random graph and a real social network which is a 4039 nodes snapshot from Facebook [Leskovec and Krevl, 2014]. |
| Researcher Affiliation | Academia | Michail Mamakos Electrical and Computer Engineering Technical University of Crete Chania, Greece mamakos@intelligence.tuc.gr Georgios Chalkiadakis Electrical and Computer Engineering Technical University of Crete Chania, Greece gehalk@intelligence.tuc.gr |
| Pseudocode | Yes | Algorithm 1: Selecting a coalition that meets an agent s required confidence level |
| Open Source Code | No | The paper does not include an explicit statement about releasing its source code or a link to a code repository for the methodology described. |
| Open Datasets | Yes | We conducted experiments on both an Erd os-Renyi random graph [Bollob as, 2001] of 300 nodes-agents and a real social network a snapshot of a part of Facebook with 4039 agents [Leskovec and Krevl, 2014]. |
| Dataset Splits | No | The paper mentions using specific graphs for experiments but does not provide details on how these were split into training, validation, or test sets. |
| Hardware Specification | Yes | The implementation was in Python 3 and experiments were run on a PC with an i3 3.3GHz processor and 4GB of RAM. |
| Software Dependencies | No | The paper states 'The implementation was in Python 3' but does not specify version numbers for any other software dependencies, libraries, or solvers used. |
| Experiment Setup | Yes | In the experiments on both graphs, qmax was set to 30 and the resource weight wi of each agent was a (rounded to integer) sample from N(15, 52). The hyperparameters of each agent s Beta were initialized to aij = 1 and bij = 1; and the αij r of the Dirichlets to αij r = wj/(D(i, j) (|r wj| + 1)). The value of K, the number of groups that a proposer i samples, was set to 30. The number of samples taken from αij, for defining the requested quantity q of i s proposal q, π to j, was set to 20. The number of rounds I and the number of tasks per round S were set to 200 and 16, respectively. |