Are there any nicely structured preference profiles nearby?
In: Mathematical social sciences, Band 79, S. 61-73
8 Ergebnisse
Sortierung:
In: Mathematical social sciences, Band 79, S. 61-73
In: Foundations of computing 6
In: ISSN:1007-0214
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context. This work is dedicated to Jianer Chen, one of the strongest problem solvers in the history of parameterized algorithmics, on the occasion of his 60th birthday. Keywords: NP-hard problems; parameterized complexity; fixed-parameter tractability; kernelization; exact algorithms; voting; decision making; cake cutting
BASE
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context.
BASE
In: ISSN:0895-4801
We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios, such as gerrymandering in political districting or work balancing in an online situation. The central aspect of our model is the deletion of certain vertices and the redistribution of their load to neighboring vertices in a completely balanced way. We investigate how the underlying graph structure, the knowledge of which vertices should be deleted, and the relation between old and new vertex loads influence the computational complexity of the underlying graph problems. Our results establish a clear borderline between tractable and intractable cases.
BASE
In: Environmental science and pollution research: ESPR, Band 29, Heft 38, S. 57318-57329
ISSN: 1614-7499
In: Environmental science and pollution research: ESPR, Band 29, Heft 25, S. 37543-37555
ISSN: 1614-7499
In: Ecotoxicology and environmental safety: EES ; official journal of the International Society of Ecotoxicology and Environmental safety, Band 272, S. 116054
ISSN: 1090-2414