Double Auction on Diffusion Network
Authors: Miao Li, Yuhan Cao, Dengji Zhao
AAAI 2024 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | In the enlarged market, our experiments demonstrate that the social welfare of the solution is almost optimal (although in theory, optimal social welfare is not achievable with the other properties). |
| Researcher Affiliation | Academia | Miao Li, Yuhan Cao and Dengji Zhao School of Information Science and Technology, Shanghai Tech University, Shanghai, China {limiao2022, caoyh1, zhaodj}@shanghaitech.edu.cn |
| Pseudocode | Yes | Algorithm 1: Mc Afee’s Trade Reduction (MTR), Algorithm 2: Trade Reduction with Reserve Price (TRP), Algorithm 3: Dynamic Trade Reduction (DTR), Algorithm 4: Dynamic Trade Reduction for Multi-unit Auction (DTR4MA) |
| Open Source Code | No | The paper does not provide any explicit statements about the availability of its source code, nor does it include a link to a code repository. |
| Open Datasets | Yes | We adopt the small-world network structure (Watts and Strogatz 1998) as the foundation of our experiments, known for its ability to effectively model real-world social networks. [...] The valuations of all traders are randomly selected (independently and uniformly) from the set {0, 1, 2, . . . , 10000}. |
| Dataset Splits | No | The paper describes generating '1000 small-world graphs' for experiments but does not specify explicit training, validation, or test splits of a single dataset, nor does it mention a dedicated validation set. |
| Hardware Specification | No | The paper does not provide any specific hardware details such as GPU/CPU models, memory, or cloud instance types used for running the experiments. |
| Software Dependencies | No | The paper does not specify any software dependencies with version numbers, such as programming languages, libraries, or specialized solvers. |
| Experiment Setup | Yes | In this experiment, we study the impact of the connectivity, denoted as c = k |N|, where the parameter k indicates the expected number of neighbors for each agent in Wattz and Strogatz’s model. We maintain fixed values of |N0| = 300, |S| = |N| / 2 = 500 and fixed rewiring probability pr = 0.3. The valuations of all traders are randomly selected (independently and uniformly) from the set {0, 1, 2, . . . , 10000}. |