ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1307.1252
  4. Cited By
The Complexity of Fully Proportional Representation for Single-Crossing
  Electorates

The Complexity of Fully Proportional Representation for Single-Crossing Electorates

4 July 2013
P. Skowron
Lan Yu
Piotr Faliszewski
Edith Elkind
ArXivPDFHTML

Papers citing "The Complexity of Fully Proportional Representation for Single-Crossing Electorates"

3 / 3 papers shown
Title
On the Computation of Fully Proportional Representation
On the Computation of Fully Proportional Representation
Nadja Betzler
A. Slinko
Johannes Uhlmann
59
199
0
04 Feb 2014
Achieving Fully Proportional Representation is Easy in Practice
Achieving Fully Proportional Representation is Easy in Practice
P. Skowron
Piotr Faliszewski
A. Slinko
53
33
0
27 Jan 2013
The Complexity of Manipulative Attacks in Nearly Single-Peaked
  Electorates
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates
Piotr Faliszewski
E. Hemaspaandra
L. Hemaspaandra
95
91
0
25 May 2011
1