Eliciting Single-Peaked Preferences Using Comparison Queries
From MaRDI portal
Publication:3651462
DOI10.1613/jair.2606zbMath1192.68696arXiv1401.3449OpenAlexW3101083801WikidataQ129559486 ScholiaQ129559486MaRDI QIDQ3651462
Publication date: 10 December 2009
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3449
Related Items (17)
Manipulative elicitation -- a new attack on elections with incomplete preferences ⋮ A characterization of the single-peaked single-crossing domain ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ Query complexity of tournament solutions ⋮ The shield that never was: societies with single-peaked preferences are more open to manipulation and control ⋮ Structure of single-peaked preferences ⋮ Measuring nearly single-peakedness of an electorate: some new insights ⋮ Simultaneous elicitation of scoring rule and agent preferences for robust winner determination ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ The complexity of manipulative attacks in nearly single-peaked electorates ⋮ Voting Procedures, Complexity of ⋮ Predicting winner and estimating margin of victory in elections using sampling ⋮ Learning modulo theories for constructive preference elicitation ⋮ Campaign management under approval-driven voting rules ⋮ Preference elicitation and robust winner determination for single- and multi-winner social choice ⋮ Combinatorial voter control in elections ⋮ Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results
Uses Software
This page was built for publication: Eliciting Single-Peaked Preferences Using Comparison Queries