By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to …
R Meir, K Gal, M Tal - Autonomous Agents and Multi-Agent Systems, 2020 - Springer
Plurality voting is perhaps the most commonly used way to aggregate the preferences of multiple voters. Yet, there is no consensus on how people vote strategically, even in very …
N Mattei - Proceedings of the twenty-ninth international …, 2021 - ijcai.org
Research in both computational social choice and preference reasoning uses tools and techniques from computer science, generally algorithms and complexity analysis, to …
In classical elections, voters only submit their ballot once, whereas in iterative voting, the ballots may be changed iteratively. Following the work by Wilczynski [2019], we consider the …
We consider a set of voters making a collective decision via simultaneous vote on two binary issues. Voters' preferences are captured by payoffs assigned to combinations of outcomes …
J Wagner, R Meir - International Symposium on Algorithmic Game Theory, 2023 - Springer
We present a strategy-proof public goods budgeting mechanism where agents determine both the total volume of expenses and specific allocation. It is constructed as a modification …
Computational Social Choice (COMSOC) investigates computational issues surrounding the aggregation of individual preferences and collective decision making [7]. Much of this work …
In many real world situations, collective decisions are made using voting and, in scenarios such as committee or board elections, employing voting rules that return multiple winners. In …
In many real world situations, collective decisions are made using voting. Moreover, scenarios such as committee or board elections require voting rules that return multiple …