Javascript must be enabled to continue!
Eliciting Single-Peaked Preferences Using Comparison Queries
View through CrossRef
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alternatives (or at least a winning alternative) is produced. However, when there are many alternatives, it is impractical to simply ask agents to report their complete preferences. Rather, the agents' preferences, or at least the relevant parts thereof, need to be elicited. This is done by asking the agents a (hopefully small) number of simple queries about their preferences, such as comparison queries, which ask an agent to compare two of the alternatives. Prior work on preference elicitation in voting has focused on the case of unrestricted preferences. It has been shown that in this setting, it is sometimes necessary to ask each agent (almost) as many queries as would be required to determine an arbitrary ranking of the alternatives. In contrast, in this paper, we focus on single-peaked preferences. We show that such preferences can be elicited using only a linear number of comparison queries, if either the order with respect to which preferences are single-peaked is known, or at least one other agent's complete preferences are known. We show that using a sublinear number of queries does not suffice. We also consider the case of cardinally single-peaked preferences. For this case, we show that if the alternatives' cardinal positions are known, then an agent's preferences can be elicited using only a logarithmic number of queries; however, we also show that if the cardinal positions are not known, then a sublinear number of queries does not suffice. We present experimental results for all elicitation algorithms. We also consider the problem of only eliciting enough information to determine the aggregate ranking, and show that even for this more modest objective, a sublinear number of queries per agent does not suffice for known ordinal or unknown cardinal positions. Finally, we discuss whether and how these techniques can be applied when preferences are almost single-peaked.
Title: Eliciting Single-Peaked Preferences Using Comparison Queries
Description:
Voting is a general method for aggregating the preferences of multiple agents.
Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alternatives (or at least a winning alternative) is produced.
However, when there are many alternatives, it is impractical to simply ask agents to report their complete preferences.
Rather, the agents' preferences, or at least the relevant parts thereof, need to be elicited.
This is done by asking the agents a (hopefully small) number of simple queries about their preferences, such as comparison queries, which ask an agent to compare two of the alternatives.
Prior work on preference elicitation in voting has focused on the case of unrestricted preferences.
It has been shown that in this setting, it is sometimes necessary to ask each agent (almost) as many queries as would be required to determine an arbitrary ranking of the alternatives.
In contrast, in this paper, we focus on single-peaked preferences.
We show that such preferences can be elicited using only a linear number of comparison queries, if either the order with respect to which preferences are single-peaked is known, or at least one other agent's complete preferences are known.
We show that using a sublinear number of queries does not suffice.
We also consider the case of cardinally single-peaked preferences.
For this case, we show that if the alternatives' cardinal positions are known, then an agent's preferences can be elicited using only a logarithmic number of queries; however, we also show that if the cardinal positions are not known, then a sublinear number of queries does not suffice.
We present experimental results for all elicitation algorithms.
We also consider the problem of only eliciting enough information to determine the aggregate ranking, and show that even for this more modest objective, a sublinear number of queries per agent does not suffice for known ordinal or unknown cardinal positions.
Finally, we discuss whether and how these techniques can be applied when preferences are almost single-peaked.
Related Results
Graph-based interactive bibliographic information retrieval systems
Graph-based interactive bibliographic information retrieval systems
In the big data era, we have witnessed the explosion of scholarly literature. This explosion has imposed challenges to the retrieval of bibliographic information. Retrieval of inte...
Influence of Dietary Soy Lecithin Levels on Growth and Gonadal Development in Male Procambarus clarkii
Influence of Dietary Soy Lecithin Levels on Growth and Gonadal Development in Male Procambarus clarkii
Abstract: This study evaluates how graded dietary soybean lecithin levels influence growth, lipid metabolism, gonadal development, and antioxidant capacity in male red swamp crayfi...
Handling Bipolar Queries in Fuzzy Information Processing
Handling Bipolar Queries in Fuzzy Information Processing
The chapter advocates the interest of distinguishing between negative and positive preferences in the processing of flexible queries. Negative preferences express what is (more or ...
EVOLVING CONSUMER PREFERENCES ON THE FAST FASHION MARKET
EVOLVING CONSUMER PREFERENCES ON THE FAST FASHION MARKET
Eter Kharaishvili
E-mail: eter.kharaishvili@tsu.ge
Professor, Ivane Javakhishvili Tbilisi State University
Tbilisi, Georgia
https://orcid.org/0000-0003-4013-7354
Nino Lobzh...
Syndrome definitions for drug overdose: How far down the rabbit hole do we go?
Syndrome definitions for drug overdose: How far down the rabbit hole do we go?
ObjectiveTo discuss the process for developing and revising suspected drug overdose queries in syndromic surveillance (SyS) systems.IntroductionState and local jurisdictions have b...
Multivariate Mate Choice Constrains Mate Preference Evolution
Multivariate Mate Choice Constrains Mate Preference Evolution
Mate preferences are ideals or standards believed to guide our mate choices, which are crucial to an individual’s inclusive fitness. In evolutionary psychology, many specific mate ...
Dependence of Narrow-line Region Sizes on [O iii] Luminosity in Low-redshift Active Galactic Nuclei with Double-peaked Broad Balmer Emission Lines
Dependence of Narrow-line Region Sizes on [O iii] Luminosity in Low-redshift Active Galactic Nuclei with Double-peaked Broad Balmer Emission Lines
Abstract
In this paper, simple but interesting results are reported on the upper limits of narrow-line region (NLR) sizes of a small sample of 38 low-redshift (z <...
Mechanism of the Double peaked El Nino
Mechanism of the Double peaked El Nino
<p>&#160; &#160;In the past decades, our understanding of the ENSO phenomenon increased steadily. Especially, one of the most interesting topics was t...

