Discrete Budget Aggregation: Truthfulness and Proportionality
Authors: Ulrike Schmidt-Kraepelin, Warut Suksompong, Markus Utke
IJCAI 2025 | Venue PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We study a budget aggregation setting where voters express their preferred allocation of a fixed budget over a set of alternatives, and a mechanism aggregates these preferences into a single output allocation. ... we demonstrate that the Gibbard Satterthwaite theorem can be extended to our setting. In contrast, when voters are restricted to integral ballots, we identify a class of truthful mechanisms by adapting moving-phantom mechanisms to our context. Moreover, we show that while a weak form of proportionality can be achieved alongside truthfulness, (stronger) proportionality notions derived from approval-based committee voting are incompatible with truthfulness. |
| Researcher Affiliation | Academia | 1TU Eindhoven, The Netherlands 2National University of Singapore, Singapore EMAIL, EMAIL |
| Pseudocode | No | The paper describes methods and mechanisms (e.g., "Integral Moving-Phantom Mechanisms") conceptually and mathematically, but it does not include any distinct, structured pseudocode blocks or algorithms labeled as such. |
| Open Source Code | No | The paper does not contain any statements about releasing code, nor does it provide links to any code repositories for the methodology described. |
| Open Datasets | No | The paper is theoretical and focuses on mechanism design and properties of budget aggregation. It does not conduct experiments on specific datasets and therefore does not provide any access information for publicly available or open datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve experiments on datasets, thus no dataset splits are provided or discussed. |
| Hardware Specification | No | The paper describes a "computer-aided approach" that uses a "SAT-solver" for proofs, but it does not specify any particular hardware (e.g., GPU/CPU models, memory details) used for this or any other computational task. |
| Software Dependencies | No | The paper mentions using a "SAT-solver" for a computer-aided proof, but it does not specify the name or version number of the SAT-solver or any other software dependencies. |
| Experiment Setup | No | The paper is theoretical and focuses on proving properties of mechanisms. It does not describe any experiments that would require specific hyperparameters, training configurations, or system-level settings. |