English
Related papers

Related papers: On the Indecisiveness of Kelly-Strategyproof Socia…

200 papers

Gibbard and Satterthwaite have shown that the only single-valued social choice functions (SCFs) that satisfy non-imposition (i.e., the function's range coincides with its codomain) and strategyproofness (i.e., voters are never better off by…

Theoretical Economics · Economics 2023-06-21 Felix Brandt , Patrick Lederer

An important -- but very demanding -- property in collective decision-making is strategyproofness, which requires that voters cannot benefit from submitting insincere preferences. Gibbard (1977) has shown that only rather unattractive rules…

Computer Science and Game Theory · Computer Science 2024-12-17 Felix Brandt , Patrick Lederer

Social decision schemes (SDSs) map the voters' preferences over multiple alternatives to a probability distribution over these alternatives. In a seminal result, Gibbard (1977) has characterized the set of SDSs that are strategyproof with…

Computer Science and Game Theory · Computer Science 2025-08-25 Patrick Lederer

The Gibbard-Satterthwaite Impossibility Theorem holds that dictatorship is the only Pareto optimal and strategyproof social choice function on the full domain of preferences. Much of the work in mechanism design aims at getting around this…

Computer Science and Game Theory · Computer Science 2017-03-21 Sophie Bade , Yannai A. Gonczarowski

The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. In \cite{McL11}, McLennan showed that a similar impossibility result holds even if we consider…

Computer Science and Game Theory · Computer Science 2015-04-13 Samantha Leung , Edward Lui , Rafael Pass

The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. Similar impossibility results hold even if we consider a weaker notion of strategy-proofness…

Computer Science and Game Theory · Computer Science 2015-01-08 Samantha Leung , Edward Lui , Rafael Pass

This paper studies a general class of social choice problems in which agents' payoff functions (or types) are privately observable random variables, and monetary transfers are not available. We consider cardinal social choice functions…

Theoretical Economics · Economics 2024-08-20 Kazuya Kikuchi , Yukio Koriyama

We consider the problem of locating a single facility on a vertex in a given graph based on agents' preferences, where the domain of the preferences is either single-peaked or single-dipped. Our main interest is the existence of…

Computer Science and Game Theory · Computer Science 2019-11-20 Taiki Todo , Nodoka Okada , Makoto Yokoo

Social decision schemes (SDSs) map the preferences of a group of voters over some set of $m$ alternatives to a probability distribution over the alternatives. A seminal characterization of strategyproof SDSs by Gibbard implies that there…

Theoretical Economics · Economics 2022-01-26 Felix Brandt , Patrick Lederer , René Romen

One of the central economic paradigms in multi-agent systems is that agents should not be better off by acting dishonestly. In the context of collective decision-making, this axiom is known as strategyproofness and turns out to be rather…

Computer Science and Game Theory · Computer Science 2023-02-24 Felix Brand , Patrick Lederer , Sascha Tausch

We analyze the problem of locating a public facility in a domain of single-peaked and single-dipped preferences when the social planner knows the type of preference (single-peaked or single-dipped) of each agent. Our main result…

Theoretical Economics · Economics 2024-04-02 Jorge Alcalde-Unzu , Oihane Gallo , Marc Vorsatz

This paper studies the strategic manipulation of set-valued social choice functions according to Kelly's preference extension, which prescribes that one set of alternatives is preferred to another if and only if all elements of the former…

Multiagent Systems · Computer Science 2015-02-06 Felix Brandt

In rank aggregation, the goal is to combine multiple input rankings into a single output ranking. In this paper, we analyze rank aggregation methods, so-called social welfare functions (SWFs), with respect to strategyproofness, which…

Computer Science and Game Theory · Computer Science 2026-02-09 Manuel Eberl , Patrick Lederer

Multi-winner approval-based voting has received considerable attention recently. A voting rule in this setting takes as input ballots in which each agent approves a subset of the available alternatives and outputs a committee of…

Computer Science and Game Theory · Computer Science 2024-02-15 Ioannis Caragiannis , Rob LeGrand , Evangelos Markakis , Emmanouil Pountourakis

The purpose of this note is to prove the existence of a randomized mechanism, a social decision scheme (SDS), with desirable fairness, efficiency, and strategyproofness properties unmatched by all known SDSs. In particular, we disprove a…

Computer Science and Game Theory · Computer Science 2014-11-27 Florian Brandl

In the problem of fully allocating a social endowment of perfectly divisible commodities among a group of agents with multidimensional single-peaked preferences, we study strategy-proof rules that are not Pareto-dominated by other…

Theoretical Economics · Economics 2025-02-26 Agustin G. Bonifacio

Let g be a strategy-proof rule on the domain NP of profiles where no alternative Pareto-dominates any other. Then we establish a result with a Gibbard-Satterthwaite flavor: g is dictatorial if its range contains at least three alternatives.

Combinatorics · Mathematics 2015-03-02 Donald E. Campbell , Jerry S. Kelly

Social choice theory is a theoretical framework for analysis of combining individual preferences, interests, or welfare to reach a collective decision or social welfare in some sense. We introduce a new criterion for social choice protocols…

Multiagent Systems · Computer Science 2019-08-19 Mohammad Ali Javidian , Rasoul Ramezanian

The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam

Social decision schemes (SDSs) map the ordinal preferences of individual voters over multiple alternatives to a probability distribution over the alternatives. In order to study the axiomatic properties of SDSs, we lift preferences over…

Computer Science and Game Theory · Computer Science 2024-08-27 Felix Brandt , Patrick Lederer , Warut Suksompong
‹ Prev 1 2 3 10 Next ›