Single-peakedness Based on the Net Preference Matrix : Characterization and Algorithms

Abstract

In this paper, we propose a new relaxation of the single-peaked property by constraining the net preference matrix instead of the preference profile. More precisely, this new domain restriction holds for a given profile P if there exists a single-peaked profile P ′ with the same net preference matrix as P. We provide a characterization of net preference… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics