Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Computational social choice
Social choice theory concerns the design and formal analysis of methods for aggregating
the preferences of multiple agents. Examples of such methods include voting procedures …
the preferences of multiple agents. Examples of such methods include voting procedures …
[كتاب][B] Economics and computation
J Rothe - 2024 - Springer
1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …
supporting her as a junior professor for Computational Social Choice and by the project …
A local-dominance theory of voting equilibria
We suggest a new model for strategic voting based on local dominance, where voters
consider a set of possible outcomes without assigning probabilities to them. We prove that …
consider a set of possible outcomes without assigning probabilities to them. We prove that …
Strategic behavior in judgment aggregation
Collective decision making is concerned with aggregating information reported by a number
of individuals into a collective decision appropriately capturing the individual views as a …
of individuals into a collective decision appropriately capturing the individual views as a …
[كتاب][B] Strategic voting
R Meir - 2018 - books.google.com
Social choice theory deals with aggregating the preferences of multiple individuals
regarding several available alternatives, a situation colloquially known as voting. There are …
regarding several available alternatives, a situation colloquially known as voting. There are …
Optimal bounds for the no-show paradox via SAT solving
One of the most important desirable properties in social choice theory is Condorcet-
consistency, which requires that a voting rule should return an alternative that is preferred to …
consistency, which requires that a voting rule should return an alternative that is preferred to …
On the convergence of iterative voting: how restrictive should restricted dynamics be?
We study convergence properties of iterative voting procedures. Such procedures are
defined by a voting rule and a (restricted) iterative process, where at each step one agent …
defined by a voting rule and a (restricted) iterative process, where at each step one agent …
Strategic voting behavior in doodle polls
Finding a common time slot for a group event is a daily conundrum and illustrates key
features of group decision-making. It is a complex interplay of individual incentives and …
features of group decision-making. It is a complex interplay of individual incentives and …
Computational social choice: The first ten years and beyond
Computational social choice is a research area at the intersection of computer science,
mathematics, and economics that is concerned with aggregation of preferences of multiple …
mathematics, and economics that is concerned with aggregation of preferences of multiple …
Stackelberg voting games: Computational aspects and paradoxes
We consider settings in which voters vote in sequence, each voter knows the votes of the
earlier voters and the preferences of the later voters, and voters are strategic. This can be …
earlier voters and the preferences of the later voters, and voters are strategic. This can be …