Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Preference restrictions in computational social choice: A survey
Social choice becomes easier on restricted preference domains such as single-peaked,
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …
Single transferable vote: Incomplete knowledge and communication issues
Single Transferable Vote (STV) is used in large political elections around the world. It is easy
to understand and has desirable norma-tive properties such as clone-proofness. However …
to understand and has desirable norma-tive properties such as clone-proofness. However …
[PDF][PDF] Computing the Schulze Method for Large-Scale Preference Data Sets.
The Schulze method is a voting rule widely used in practice and enjoys many positive
axiomatic properties. While it is computable in polynomial time, its straight-forward …
axiomatic properties. While it is computable in polynomial time, its straight-forward …
[PDF][PDF] Improving Group Decision-Making by Artificial Intelligence.
L **a - IJCAI, 2017 - ijcai.org
Improving Group Decision-Making by Artificial Intelligence Page 1 Improving Group
Decision-Making by Artificial Intelligence Lirong **a Rensselaer Polytechnic Institute xial@cs.rpi.edu …
Decision-Making by Artificial Intelligence Lirong **a Rensselaer Polytechnic Institute xial@cs.rpi.edu …
Practical algorithms for STV and ranked pairs with parallel universes tiebreaking
STV and ranked pairs (RP) are two well-studied voting rules for group decision-making.
They proceed in multiple rounds, and are affected by how ties are broken in each round …
They proceed in multiple rounds, and are affected by how ties are broken in each round …
[ΒΙΒΛΙΟ][B] Algorithmic Game Theory: 11th International Symposium, SAGT 2018, Bei**g, China, September 11-14, 2018, Proceedings
X Deng - 2018 - books.google.com
This volume of LNCS 11059 contains the collection of the papers presented at the 11th
International Symposium on Algorithmic Game Theory (SAGT 2018), held during September …
International Symposium on Algorithmic Game Theory (SAGT 2018), held during September …
Cloud computing techniques for winner determination in computational social choice
JT Csar - 2018 - repositum.tuwien.at
This work deals with the development of cloud-computing algorithms for problems of winner
determination in computational social choice. In winner determination in computational …
determination in computational social choice. In winner determination in computational …
The communication burden of single transferable vote, in practice
We study single-winner STV from the point of view of communication. First, we assume that
voters give, in a single shot, their top-k alternatives; we define a version of STV that works for …
voters give, in a single shot, their top-k alternatives; we define a version of STV that works for …
[PDF][PDF] Blockchain Elections: Smart Contract Electoral System Design and Implementation
NP Hernandez - 2021 - core.ac.uk
Nathaniel Patrick Hernandez BS, Appalachian State University MS, Appalachian State
University Chairperson: Cindy Norris, Ph. D. Proponents of Internet-based voting systems …
University Chairperson: Cindy Norris, Ph. D. Proponents of Internet-based voting systems …