2022
DOI: 10.1111/1756-2171.12401
|View full text |Cite
|
Sign up to set email alerts
|

Compromising on compromise rules

Abstract: We propose three mechanisms to reach compromise between two opposing parties. They are based on the use of Rules of k Names, whereby one of the parties proposes a shortlist and the other chooses from it. Methods of this class are used in practice to appoint Supreme Court justices and have been recently proposed for arbitration selection processes. Those we suggest are flexible and allow the parties to participate in the endogenous determination of the role of proposer and the shortlist size. They involve few s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 24 publications
0
6
0
Order By: Relevance
“…Looking at the sequential mechanisms in the literature, we can start with the Rule of k names proposed by Barberà and Coelho (2010). In the Rule of k names, one of the parties proposes a shortlist, and the other chooses from it (Barberà and Coelho 2022). Then a single individual from outside the committee selects one of the listed names for the office.…”
Section: Literature Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…Looking at the sequential mechanisms in the literature, we can start with the Rule of k names proposed by Barberà and Coelho (2010). In the Rule of k names, one of the parties proposes a shortlist, and the other chooses from it (Barberà and Coelho 2022). Then a single individual from outside the committee selects one of the listed names for the office.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Then a single individual from outside the committee selects one of the listed names for the office. Later, Barberà and Coelho (2022) proposed three mechanisms based on the Rule of k names. The characteristics of these mechanisms are that they contain few steps, weakly implement the Unanimity Compromise Set, and are robust to the strategic inclusion of candidates.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Given that we can compute the veto core in polynomial time, however, one could suggest any number of neutral and anonymous core selection algorithms -first compute the veto core, throw away all other candidates, and use your favourite voting rule to select a winner from what is left. Unfortunately, the veto core is vulnerable to a very simple form of agenda manipulation -padding the profile at the bottom with universally reviled candidates (Kondratev, Ianovski, and Nesterov 2019;Barberà and Coelho 2020). Indeed, suppose we add (n − 1)m spoiler candidates at the bottom of every voter's preference order.…”
Section: Selecting From the Veto Corementioning
confidence: 99%
“…Arbitration rules are thoroughly discussed by Barberà and Coelho (2020). As prominent examples, we have fallback bargaining proposed by Brams and Kilgour (2001), the veto-rank and short listing procedures analysed by de Clippel et al (2014) and the Pareto-and-veto rules analysed by Laslier et al (2020).…”
Section: Introductionmentioning
confidence: 99%