Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating together preferences of multiple agents. We study here the complexity of determining when we can terminate eliciting preferences, and prove that the complexity depends on the elicitation strategy. We show, for instance, that it may be better from a computational perspective to elicit all preferences from one agent at a time than to elicit individual preferences from multiple agents. We also study the connection between the strategic manipulation of an election and preference elicitation. We show that what we can manipulate affects the computational complexity of manipulation. In particular, we prove that there are voting rules which are easy to manipulate if we can change all of an agent's vote, but computationally intractable if we can change only some of their preferences. This suggests that, as with preference elicitation, a fine-grained view of manipulation may be informative. Finally, we study the connection between predicting the winner of an election and preference elicitation. Based on this connection, we identify a voting rule where it is computationally difficult to decide the probability of a candidate winning given a probability distribution over the votes.
Mind the Gap: How Elicitation Protocols Shape the Stated-Revealed Preference Gap in Language Models
University of Oxford(牛津大学);Max Planck Institute for Biological Cybernetics(生物信息学Max Planck研究所);University of Tuebingen(图宾根大学);Cardiff University(卡迪夫大学);Cambridge–Boston Alignment Initiative (CBAI)(剑桥-波士顿对齐倡议)
Information efficient learning of complexly structured preferences: Elicitation procedures and their application to decision making under uncertainty
LMU Munich(慕尼黑大学)
在本文中,我们提出了有效的方法,复杂结构的偏好,并利用这些问题的决策(严重)的不确定性。基于Jansen,Schollmeyer和Augustin(2018,Int. J. Approx.现在,我们设计启发程序和算法,使决策者能够揭示他们潜在的偏好系统(即两个关系,一个编码序数,另一个编码偏好的基数部分),同时必须回答尽可能少的简单排名问题。这里,遵循两种不同的方法。第一种方法直接利用收集的排名数据获得的顺序部分的偏好,而他们的基数部分构建隐含的测量Meta数据的决策者的考虑时间。与此相反,第二种方法也明确elancies的决策者的偏好系统的主要部分,但是,只有一个近似版本。这种近似是通过额外的收集标签的偏好强度在启发过程中获得。对于这两种方法,我们给出的条件下,他们产生的决策者的真实偏好系统,并探讨如何提高其效率。对于后一个目的,除了无数据的方法,我们还讨论了如何有效地指导启发程序,如果以前的启发轮的数据是可用的。最后,我们展示了如何建议的启发式方法可以利用在(严重)不确定性的决策问题。准确地说,我们表明,在某些条件下,最优决策可以找到没有充分指定的偏好系统。
An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting
Dalian University of Technology(大连理工大学);University of Alberta(阿尔伯塔大学);Systems Research Institute, Polish Academy of Sciences(波兰科学院系统研究所);Istinye University(伊斯提涅大学)
Preference-Guided Planning: An Active Elicitation Approach
University of Texas, Dallas(得克萨斯大学达拉斯分校);Indiana University, Bloomington(印第安纳大学伯明顿分校);Washington State University(华盛顿州立大学);University of Pennsylvania(宾夕法尼亚大学)
Ordered Preference Elicitation Strategies for Supporting Multi-Objective Decision Making
Vrije Universiteit Brussel(布鲁塞尔自由大学);University of Oxford(牛津大学);Vrije Universiteit Amsterdam(阿姆斯特丹自由大学);City of Amsterdam, Signal Control Design and Analysis(阿姆斯特丹市信号控制设计与分析部门);Delft University of Technology(代尔夫特理工大学)
FARPLS: A Feature-Augmented Robot Trajectory Preference Labeling System to Assist Human Labelers' Preference Elicitation
Hong Kong University of Science and Technology(香港科技大学);Carnegie Mellon University(卡内基梅隆大学);Tongji University(同济大学);Southeast University(东南大学);Hong Kong Productivity Council(香港生产力促进局);Hong Kong Industrial Artificial Intelligence and Robotics Centre (FLAIR)(香港工业人工智能及机器人中心(FLAIR));University of Manchester(曼彻斯特大学)
Preference Elicitation for Offline Reinforcement Learning
ETH AI Center(ETH人工智能中心);ETH Zürich(苏黎世联邦理工学院);MPI for Intelligent Systems(智能系统马克斯·普朗克研究所);ELLIS Institute Tübingen(图宾根ELLIS研究所);University of Zürich(苏黎世大学)
The Tournament Tree Method for preference elicitation in Multi-criteria decision-making
Department of Mathematics, Universidad de Ja \'e n, 23071 Ja \'e n, Spain;Department of Computer Science, Universidad de Ja \'e n, 23071 Ja \'e n, Spain
Bayesian preference elicitation for decision support in multiobjective optimization
Institute of Applied Analysis(应用分析研究所);Numerical Simulation , University of Stuttgart, Germany(数值模拟,斯图加特大学,德国);Institute for Parallel(并行系统研究所);Distributed Systems , University of Stuttgart, Germany(分布式系统,斯图加特大学,德国);Surrogate Modeling Lab , Ghent University - imec, Belgium(替代建模实验室,根特大学-imec,比利时);Department of Computing(计算部门);Mathematical Sciences , California Institute of Technology, USA(数学科学,加州理工学院,美国)
Preference Elicitation for Policy Optimization and Application to Aligning Heart Transplantation with Human Values
Carnegie Mellon University(卡内基梅隆大学);Medical University of South Carolina(南卡罗来纳医科大学);Strategy Robot, Inc.(策略机器人公司);Strategic Machine, Inc.(战略机器公司);Optimized Markets, Inc.(优化市场公司)