Results 151 to 160 of about 94,619 (177)

Strategy-proofness of the randomized Condorcet voting system

Social Choice and Welfare, 2017
In this paper, we study the strategy-proofness properties of the randomized Condorcet voting system (RCVS). Discovered at several occasions independently, the RCVS is arguably the natural extension of the Condorcet method to cases where a deterministic ...
Le Nguyen Hoang
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

When ties are possible: Weak Condorcet winners and Arrovian rationality

Mathematical Social Sciences, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mostapha Diss, Keith Dougherty, Jac C. Heckelman   +2 more
openaire   +2 more sources

Approval Voting, Borda Winners, and Condorcet Winners: Evidence from Seven Elections

Management Science, 1998
We analyze 10 three-candidate elections (and mock elections) conducted under approval voting (AV) using a method developed by Falmagne and Regenwetter (1996) that allows us to construct a distribution of rank orders from subset choice data. The elections were held by the Institute of Management Science, the Mathematical Association of America, several
Michel Regenwetter, Bernard Grofman
openaire   +1 more source

A note on the query complexity of the Condorcet winner problem

Information Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Strong equilibrium outcomes of voting games �are the generalized Condorcet winners

Social Choice and Welfare, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sertel, MR, Sanver, MR
openaire   +3 more sources

Condorcet Winners on Bounded and Distributive Lattices

2019
Aggregating preferences for finding a consensus between several agents is an important topic in social choice theory. We obtain several axiomatic characterizations of some significant subclasses of voting rules defined on bounded and distributive lattices.
openaire   +1 more source

Candidate nomination for Condorcet-consistent voting rules

Adaptive Agents and Multi-Agent Systems
Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The Possible President problem asks whether some candidate of a given party can become the winner of the election for some ...
Ildikó Schlotter, Katar'ina Cechl'arov'a   +1 more
semanticscholar   +1 more source

Axiomatizations of a simple Condorcet voting method for Final Four and Final Five elections

arXiv.org
Proponents of Condorcet voting face the question of what to do in the rare case when no Condorcet winner exists. Recent work provides compelling arguments for the rule that should be applied in three-candidate elections, but already with four candidates,
Wesley H. Holliday
semanticscholar   +1 more source

Downsian competition in the absence of a condorcet winner [PDF]

, 2003
This paper studies studies two-party electoral competition in a setting where no policy is unbeatable. It is shown that if parties take turns in choosing platforms and observe each other's choises, altering one's platform so as to win is pointless since the other party never accepts an outcome where it is sure to loose. If there is any cost to changing
openaire   +1 more source

Global independence of irrelevant alternatives, state-salient decision rules and the strict Condorcet choice function

Control and Cybernetics
We present a simple proof of a well-known axiomatic characterization of state-salient decision rules, using Weak Dominance Criterion and Global Independence of Irrelevant Alternatives.
Somdeb Lahiri
semanticscholar   +1 more source