The complexity of fully proportional representation for single-crossing electorates (Q2513672): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2110060186 / rank | |||
Normal rank | |||
Revision as of 02:23, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of fully proportional representation for single-crossing electorates |
scientific article |
Statements
The complexity of fully proportional representation for single-crossing electorates (English)
0 references
28 January 2015
0 references
This paper investigates the complexity of winner determination under Chamberlin-Courant's and Monroe's rules. A polynomial-time algorithm for Chamberlin-Courant's rule for single-crossing elections is presented. This algorithm can be modified to work for elections that are close to being single-crossing in the sense of having bounded single-crossing width. An NP-hardness proof for Monroe's rule for the same setting is added. Under single-peaked single-crossing preferences, an efficient algorithm for the egalitarian variant of this last rule is provided. See also [Zbl 1319.91074] for a previous version of this article.
0 references
complexity
0 references
single-crossing
0 references
winner determination
0 references
Chamberlin-Courant's rule
0 references
Monroe's rule
0 references
