Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Bribery and control in stable marriage
N Boehmer, R Bredereck, K Heeger… - Journal of Artificial …, 2021 - jair.org
We initiate the study of external manipulations in Stable Marriage by considering several
manipulative actions as well as several manipulation goals. For instance, one goal is to …
manipulative actions as well as several manipulation goals. For instance, one goal is to …
Complexity of manipulating and controlling approval-based multiwinner voting
Y Yang - arxiv preprint arxiv:2302.11291, 2023 - arxiv.org
We investigate the complexity of several manipulation and control problems under
numerous prevalent approval-based multiwinner voting rules. Particularly, the rules we …
numerous prevalent approval-based multiwinner voting rules. Particularly, the rules we …
A quantitative and qualitative analysis of the robustness of (real-world) election winners
Contributing to the toolbox for interpreting election results, we evaluate the robustness of
election winners to random noise. We compare the robustness of different voting rules and …
election winners to random noise. We compare the robustness of different voting rules and …
A refined complexity analysis of fair districting over graphs
We study the NP-hard Fair Connected Districting problem recently proposed by Stoica et
al.[AAMAS 2020]: Partition a vertex-colored graph into k connected components …
al.[AAMAS 2020]: Partition a vertex-colored graph into k connected components …
[SÁCH][B] Application-oriented collective decision making: Experimental toolbox and dynamic environments
N Böhmer - 2023 - search.proquest.com
Collective decision making problems capture situations where the preferences of agents
need to be aggregated into a compromise solution. This thesis focuses on two such …
need to be aggregated into a compromise solution. This thesis focuses on two such …
Who won? Winner determination and robustness in liquid democracy
Liquid democracy is a decision-making paradigm in which each agent can either vote
directly for some alternative or (transitively) delegate its vote to another agent. To mitigate …
directly for some alternative or (transitively) delegate its vote to another agent. To mitigate …
Controlling the spread of two secrets in diverse social networks (student abstract)
V Blažej, D Knop, Š Schierreich - … of the AAAI Conference on Artificial …, 2022 - ojs.aaai.org
Abstract Information diffusion in social networks is a well-studied concept in social choice
theory. We propose the study of the diffusion of two secrets in a heterogeneous environment …
theory. We propose the study of the diffusion of two secrets in a heterogeneous environment …
Elections in the Post-Quantum Era: Is the Complexity Shield Strong Enough?
Š Schierreich - arxiv preprint arxiv:2403.05273, 2024 - arxiv.org
The election, a cornerstone of democracy, is one of the best-recognizable symbols of
democratic governance. Voters' confidence in elections is essential, and these days, we can …
democratic governance. Voters' confidence in elections is essential, and these days, we can …
Group control for procedural rules: parameterized complexity and consecutive domains
Y Yang, D Dimitrov - Frontiers of Computer Science, 2024 - Springer
Abstract We consider GROUP CONTROL BY ADDING INDIVIDUALS (GCAI) in the setting of
group identification for two procedural rules—the consensus-start-respecting rule and the …
group identification for two procedural rules—the consensus-start-respecting rule and the …
Microbribery in group identification
This paper studies the complexity of two microbribery problems under the model of group
identification. In these problems, we are given a subset of distinguished individuals, and the …
identification. In these problems, we are given a subset of distinguished individuals, and the …