Finding strategyproof social choice functions via SAT solving
نویسندگان
چکیده
G./Endriss, 2011: Automated theorem search (through a universal reduction step) for ranking sets of objects B./G./Seedig, 2014: Finding preference profiles for k-majority digraphs G., 2014: Finding preference profiles of given Condorcet dimension • In this paper Method: more evolved technique to also treat strategyproofness for irresolute social choice functions Results: e.g., efficiency and strategyproofness are incompatible for a natural set extension Closes gaps in the existing (axiomatic) literature on strategyproofness for irresolute social choice functions, e.g., Kelly (1977), Barberá (1977), Gärdenfors (1979), Ching and Zhou (2002), Brandt (2011), Brandt and Brill (2011), Sanver and Zwicker (2012)
منابع مشابه
Division of the Humanities and Social Sciences California Institute of Technology Pasadena, California 91125 Strategyproof and Nonbossy Assignments
We consider the assignment of heterogeneous and indivisible objects to agents without using monetary transfers, where each agent may be assigned more than one object, and the valuation of the objects to an agent may depend on what other objects the agent is assigned. The set of strategyproof, nonbossy, and Pareto-optimal social choice functions is characterized as dictatorial sequential choice ...
متن کاملDivision of the Humanities and Social Sciences California Institute of Technology Pasadena, California 91125 Strategyproof Allocation of a Single Object
The problem of allocating a single indivisible object to one of several selfish agents is considered, where monetary payments are not allowed, and the object is not necessarily desirable to each agent. It is shown that ordinality and positive responsiveness together are necessary and sufficient conditions for strategyproofness, which implies that efficient social choice functions are not strate...
متن کاملGroup-Strategyproof Irresolute Social Choice Functions
We axiomatically characterize the class of pairwise irresolute social choice functions that are group-strategyproof according to Kelly’s preference extension. The class is narrow but contains a number of appealing Condorcet extensions such as the minimal covering set and the bipartisan set, thereby answering a question raised independently by Barberà (1977a) and Kelly (1977). These functions fu...
متن کاملCoalitionally strategyproof functions depend only on the most-preferred alternatives
In a framework allowing infinitely many individuals, I prove that coalitionally strategyproof social choice functions satisfy “tops only.” That is, they depend only on which alternative each individual prefers the most, not on which alternative she prefers the second most, the third, . . . , or the least. The functions are defined on the domain of profiles measurable with respect to a Boolean a...
متن کاملOn domains that admit well-behaved strategy-proof social choice functions
In this paper, we investigate domains which admit “well-behaved”, strategy-proof social choice functions. We show that if the number of voters is even, then every domain that satisfies a richness condition and admits an anonymous, tops-only, unanimous and strategy-proof social choice function, must be semi-single-peaked. Conversely every semi-single-peaked domain admits an anonymous, tops-only,...
متن کامل