English
Related papers

Related papers: A Near-Optimal Mechanism for Impartial Selection

200 papers

We give new bounds for the single-nomination model of impartial selection, a problem proposed by Holzman and Moulin (Econometrica, 2013). A selection mechanism, which may be randomized, selects one individual from a group of $n$ based on…

Computer Science and Game Theory · Computer Science 2023-05-18 Javier Cembrano , Felix Fischer , Max Klimm

We study the selection of agents based on mutual nominations, a theoretical problem with many applications from committee selection to AI alignment. As agents both select and are selected, they may be incentivized to misrepresent their true…

Computer Science and Game Theory · Computer Science 2025-10-23 Javier Cembrano , Felix Fischer , Max Klimm

We study the problem of selecting a member of a set of agents based on impartial nominations by agents from that set. The problem was studied previously by Alon et al. and Holzman and Moulin and has important applications in situations…

Computer Science and Game Theory · Computer Science 2013-11-01 Felix Fischer , Max Klimm

In the impartial selection problem, a subset of agents up to a fixed size $k$ among a group of $n$ is to be chosen based on votes cast by the agents themselves. A selection mechanism is impartial if no agent can influence its own chance of…

Computer Science and Game Theory · Computer Science 2024-08-06 Javier Cembrano , Svenja M. Griesbach , Maximilian J. Stahlberg

Impartial selection has recently received much attention within the multi-agent systems community. The task is, given a directed graph representing nominations to the members of a community by other members, to select the member with the…

Computer Science and Game Theory · Computer Science 2022-05-25 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

Impartial selection problems are concerned with the selection of one or more agents from a set based on mutual nominations from within the set. To avoid strategic nominations of the agents, the axiom of impartiality requires that the…

Computer Science and Game Theory · Computer Science 2024-10-01 Javier Cembrano , Max Klimm , Arturo Merino

We study the problem of {\em impartial selection}, a topic that lies at the intersection of computational social choice and mechanism design. The goal is to select the most popular individual among a set of community members. The input can…

Computer Science and Game Theory · Computer Science 2021-02-19 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

We study truthful mechanisms for approximating the Maximin-Share (MMS) allocation of agents with additive valuations for indivisible goods. Algorithmically, constant factor approximations exist for the problem for any number of agents. When…

Computer Science and Game Theory · Computer Science 2024-06-12 Ilan Reuven Cohen , Alon Eden , Talya Eden , Arsen Vasilyan

We study the model of metric voting proposed by Feldman et al. [2020]. In this model, experts and candidates are located in a metric space, and each candidate possesses a quality that is independent of her location. An expert evaluates each…

Computer Science and Game Theory · Computer Science 2023-06-26 Yang Cai , Eric Xue

Impartial selection is the selection of an individual from a group based on nominations by other members of the group, in such a way that individuals cannot influence their own chance of selection. For this problem, we give a deterministic…

Computer Science and Game Theory · Computer Science 2024-10-07 Javier Cembrano , Felix Fischer , David Hannon , Max Klimm

In social choice theory, anonymity (all agents being treated equally) and neutrality (all alternatives being treated equally) are widely regarded as ``minimal demands'' and ``uncontroversial'' axioms of equity and fairness. However, the ANR…

Computer Science and Game Theory · Computer Science 2023-07-14 Lirong Xia

We consider a principal agent project selection problem with asymmetric information. There are $N$ projects and the principal must select exactly one of them. Each project provides some profit to the principal and some payoff to the agent…

Theoretical Economics · Economics 2025-04-15 Sumit Goel , Wade Hann-Caruthers

Persuasion studies how an informed principal may influence the behavior of agents by the strategic provision of payoff-relevant information. We focus on the fundamental multi-receiver model by Arieli and Babichenko (2019), in which there…

Computer Science and Game Theory · Computer Science 2020-04-01 Matteo Castiglioni , Andrea Celli , Nicola Gatti

We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…

Computer Science and Game Theory · Computer Science 2019-07-23 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

In peer selection agents must choose a subset of themselves for an award or a prize. As agents are self-interested, we want to design algorithms that are impartial, so that an individual agent cannot affect their own chance of being…

Computer Science and Game Theory · Computer Science 2020-05-01 Nicholas Mattei , Paolo Turrini , Stanislav Zhydkov

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

Selecting influentials in networks against strategic manipulations has attracted many researchers' attention and it also has many practical applications. Here, we aim to select one or two influentials in terms of progeny (the influential…

Computer Science and Game Theory · Computer Science 2023-06-14 Yuxin Zhao , Yao Zhang , Dengji Zhao

The role of an expert in the decision-making process is crucial, as the final recommendation depends on his disposition, clarity of mind, experience, and knowledge of the problem. However, the recommendation also depends on their honesty.…

Artificial Intelligence · Computer Science 2024-05-28 Jacek Szybowski , Konrad Kułakowski , Sebastian Ernst

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…

Computer Science and Game Theory · Computer Science 2017-03-01 Palash Dey , Nimrod Talmon , Otniel van Handel

The maximin share (MMS) guarantee is a desirable fairness notion for allocating indivisible goods. While MMS allocations do not always exist, several approximation techniques have been developed to ensure that all agents receive a fraction…

Computer Science and Game Theory · Computer Science 2021-05-21 Hadi Hosseini , Andrew Searns
‹ Prev 1 2 3 10 Next ›