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...
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 ...
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 ...
Justifications of emotional responses to eliciting situations: A narratological approach to the CAD hypothesis
Justifications of emotional responses to eliciting situations: A narratological approach to the CAD hypothesis
The CAD hypothesis holds that there is mapping between the three moral emotions (contempt, anger and disgust) and the three moral codes of community, autonomy and divinity. Differe...
MARS-seq2.0: an experimental and analytical pipeline for indexed sorting combined with single-cell RNA sequencing v1
MARS-seq2.0: an experimental and analytical pipeline for indexed sorting combined with single-cell RNA sequencing v1
Human tissues comprise trillions of cells that populate a complex space of molecular phenotypes and functions and that vary in abundance by 4–9 orders of magnitude. Relying solely ...
Skyline Queries in SPARQL: An Overview
Skyline Queries in SPARQL: An Overview
The growth of RDF (Resource Description Framework) datasets and the expansion of their use in conjunction with the definition of SPARQL, a declarative query language, have made RDF...
Autonomy on Trial
Autonomy on Trial
Photo by CHUTTERSNAP on Unsplash
Abstract
This paper critically examines how US bioethics and health law conceptualize patient autonomy, contrasting the rights-based, individualist...
Farthest-Point Voronoi Region Sensitive Processing for Further Precise Maximum Query Results
Farthest-Point Voronoi Region Sensitive Processing for Further Precise Maximum Query Results
Regular Polygon based Search Algorithm (RPSA) was developed for approximately processing aggregate queries on remote spatial databases. However, Precision regarding maximum queries...


