English
Related papers

Related papers: Eliciting Single-Peaked Preferences Using Comparis…

200 papers

Various voting rules are based on ranking the candidates by scores induced by aggregating voter preferences. A winner (respectively, unique winner) is a candidate who receives a score not smaller than (respectively, strictly greater than)…

Computer Science and Game Theory · Computer Science 2021-02-01 Aviram Imber , Benny Kimelfeld

In economic theory, an agent chooses from available alternatives -- modeled as a set. In decisions in the field or in the lab, however, agents do not have access to the set of alternatives at once. Instead, alternatives are represented by…

Computer Science and Game Theory · Computer Science 2021-11-09 Paulo Oliva , Philipp Zahn

Direct alignment methods are increasingly used for aligning large language models (LLMs) with human preferences. However, these methods suffer from the issues of verbosity and likelihood displacement, which can be driven by the noisy…

Computation and Language · Computer Science 2025-10-28 Peter Chen , Xi Chen , Wotao Yin , Tianyi Lin

Query expansion is a well known method to improve the performance of information retrieval systems. In this work we have tested different approaches to extract the candidate query terms from the top ranked documents returned by the…

Information Retrieval · Computer Science 2008-12-18 José R. Pérez-Agüera , Lourdes Araujo

Traditionally, recommender systems operate by returning a user a set of items, ranked in order of estimated relevance to that user. In recent years, methods relying on stochastic ordering have been developed to create "fairer" rankings that…

Information Retrieval · Computer Science 2022-09-13 Amanda Bower , Kristian Lum , Tomo Lazovich , Kyra Yee , Luca Belli

This paper considers the scenario in which there are multiple institutions, each with a limited capacity for candidates, and candidates, each with preferences over the institutions. A central entity evaluates the utility of each candidate…

Data Structures and Algorithms · Computer Science 2024-09-10 L. Elisa Celis , Amit Kumar , Nisheeth K. Vishnoi , Andrew Xu

The ultimate goal of any software developer seeking a competitive edge is to meet stakeholders needs and expectations. To achieve this, it is necessary to effectively and accurately manage stakeholders system requirements. The paper…

Software Engineering · Computer Science 2018-03-19 Anupama Prasanth , Sandhia Valsala , Safeeullah Soomro

This paper considers the ranking problem of candidates for a certain position based on ballot papers filled by voters. We suggest a ranking procedure of alternatives using cooperative game theory methods. For this, it is necessary to…

Computer Science and Game Theory · Computer Science 2022-09-09 Aleksei Kondratev , Vladimir Mazalov

We study how a principal should optimally choose between implementing a new policy and maintaining the status quo when information relevant for the decision is privately held by agents. Agents are strategic in revealing their information;…

Theoretical Economics · Economics 2020-02-21 Albin Erlanson , Andreas Kleiner

Traditionally the probabilistic ranking principle is used to rank the search results while the ranking based on expected profits is used for paid placement of ads. These rankings try to maximize the expected utilities based on the user…

Computer Science and Game Theory · Computer Science 2015-03-19 Raju Balakrishnan , Subbarao Kambhampati

Argumentation is a process of evaluating and comparing a set of arguments. A way to compare them consists in using a ranking-based semantics which rank-order arguments from the most to the least acceptable ones. Recently, a number of such…

Artificial Intelligence · Computer Science 2016-02-03 Elise Bonzon , Jérôme Delobelle , Sébastien Konieczny , Nicolas Maudet

Recent advances in multi-task peer prediction have greatly expanded our knowledge about the power of multi-task peer prediction mechanisms. Various mechanisms have been proposed in different settings to elicit different types of…

Computer Science and Game Theory · Computer Science 2021-06-08 Shuran Zheng , Fang-Yi Yu , Yiling Chen

How to optimally persuade an agent who has a private type? When elicitation is feasible, this amounts to a fairly standard principal-agent-style mechanism design problem, where the persuader employs a mechanism to first elicit the agent's…

Computer Science and Game Theory · Computer Science 2024-11-01 Jiarui Gan , Abheek Ghosh , Nicholas Teh

Value-based argumentation enhances a classical abstract argumentation graph - in which arguments are modelled as nodes connected by directed arrows called attacks - with labels on arguments, called values, and an ordering on values, called…

Multiagent Systems · Computer Science 2019-07-23 Grzegorz Lisowski , Sylvie Doutre , Umberto Grandi

Assessors make preference judgments faster and more consistently than graded judgments. Preference judgments can also recognize distinctions between items that appear equivalent under graded judgments. Unfortunately, preference judgments…

Information Retrieval · Computer Science 2021-02-15 Charles L. A. Clarke , Alexandra Vtyurina , Mark D. Smucker

Recently, the problem of allocating one resource per agent with initial endowments (house markets) has seen a renewed interest: indeed, while in the domain of strict preferences the Top Trading Cycle algorithm is known to be the only…

Computer Science and Game Theory · Computer Science 2020-02-27 Aurélie Beynier , Nicolas Maudet , Simon Rey , Parham Shams

Individuals often navigate several options with incomplete knowledge of their own preferences. Information provisioning tools such as public rankings and personalized recommendations have become central to helping individuals make choices,…

Theoretical Economics · Economics 2025-06-05 Omar Besbes , Yash Kanoria , Akshit Kumar

We study fairness in social choice settings under single-peaked preferences. Construction and characterization of social choice rules in the single-peaked domain has been extensively studied in prior works. In fact, in the single-peaked…

Computer Science and Game Theory · Computer Science 2022-07-19 Gogulapati Sreedurga , Soumyarup Sadhukhan , Souvik Roy , Yadati Narahari

Social choice becomes easier on restricted preference domains such as single-peaked, single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the structure makes it easier to reason about preferences, and…

Computer Science and Game Theory · Computer Science 2025-03-25 Edith Elkind , Martin Lackner , Dominik Peters

Rating elicitation is a success element for recommender systems to perform well at cold-starting, in which the systems need to recommend items to a newly arrived user with no prior knowledge about the user's preference. Existing elicitation…

Information Retrieval · Computer Science 2024-06-04 Hieu Trung Nguyen , Duy Nguyen , Khoa Doan , Viet Anh Nguyen