English
Related papers

Related papers: Anonymous and Strategy-Proof Voting under Subjecti…

200 papers

When does society eventually learn the truth, or take the correct action, via observational learning? In a general model of sequential learning over social networks, we identify a simple condition for learning dubbed excludability.…

Theoretical Economics · Economics 2024-04-05 Navin Kartik , SangMok Lee , Tianhao Liu , Daniel Rappoport

We give a structure theorem for all coalitionally strategy-proof social choice functions whose range is a subset of cardinality two of a given larger set of alternatives. We provide this in the case where the voters/agents are allowed to…

Theoretical Economics · Economics 2020-07-06 Achille Basile , Surekha Rao , K. P. S. Bhaskara Rao

Our aim is to design mechanisms that motivate all agents to reveal their predictions truthfully and promptly. For myopic agents, proper scoring rules induce truthfulness. However, as has been described in the literature, when agents take…

Computer Science and Game Theory · Computer Science 2019-12-05 Amir Ban

Revealed preference theory studies the possibility of modeling an agent's revealed preferences and the construction of a consistent utility function. However, modeling agent's choices over preference orderings is not always practical and…

Machine Learning · Statistics 2018-02-21 Venkata Sriram Siddhardh Nadendla , Cedric Langbort

We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the…

Computer Science and Game Theory · Computer Science 2014-02-03 Andreas Darmann , Edith Elkind , Sascha Kurz , Jérôme Lang , Joachim Schauer , Gerhard Woeginger

We study the problem of mechanism design for allocating a set of indivisible items among agents with private preferences on items. We are interested in such a mechanism that is strategyproof (where agents' best strategy is to report their…

Computer Science and Game Theory · Computer Science 2024-08-05 Ankang Sun , Bo Chen

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

We show that social learning is not useful in a model of team binary decision making by voting, where each vote carries equal weight. Specifically, we consider Bayesian binary hypothesis testing where agents have any…

Information Theory · Computer Science 2026-03-12 Joong Bum Rhim , Vivek K. Goyal

We provide novel simple representations of strategy-proof voting rules when voters have uni-dimensional single-peaked preferences (as well as multi-dimensional separable preferences). The analysis recovers, links and unifies existing…

Computer Science and Game Theory · Computer Science 2022-06-17 Andrew Jennings , Rida Laraki , Clemens Puppe , Estelle Varloot

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

Complexity of the problem of choosing among uncertain acts is a salient feature of many of the environments in which departures from expected utility theory are observed. I propose and axiomatize a model of choice under uncertainty in which…

Theoretical Economics · Economics 2022-10-17 Quitzé Valenzuela-Stookey

A fundamental principle of individual rational choice is Sen's $\gamma$ axiom, also known as expansion consistency, stating that any alternative chosen from each of two menus must be chosen from the union of the menus. Expansion consistency…

Theoretical Economics · Economics 2023-03-28 Wesley H. Holliday , Chase Norman , Eric Pacuit , Saam Zahedian

Much of the theoretical work on strategic voting makes strong assumptions about what voters know about the voting situation. A strategizing voter is typically assumed to know how other voters will vote and to know the rules of the voting…

Multiagent Systems · Computer Science 2019-07-23 Wesley H. Holliday , Eric Pacuit

Consider an arbitrary set $S$ and an arbitrary function $f : \mathbb{R} \to S$. We think of the domain of $f$ as representing time, and for each $x \in \mathbb{R}$, we think of $f(x)$ as the state of some system at time $x$. Imagine that,…

Logic · Mathematics 2015-08-28 Dvij Bajpai , Daniel J. Velleman

We study the ability of different classes of voting rules to induce agents to report their preferences truthfully, if agents want to avoid regret. First, we show that regret-free truth-telling is equivalent to strategy-proofness among…

Theoretical Economics · Economics 2025-03-21 R. Pablo Arribillaga , Agustin G. Bonifacio , Marcelo Ariel Fernandez

May's classical theorem states that in a single-winner choose-one voting system with just two candidates, majority rule is the only social choice function satisfying anonimity, neutrality and positive responsiveness axiom. Anonimity and…

Theoretical Economics · Economics 2023-10-23 Mateusz Krukowski

We consider a non stationary multi-armed bandit in which the population preferences are positively and negatively reinforced by the observed rewards. The objective of the algorithm is to shape the population preferences to maximize the…

Machine Learning · Computer Science 2024-03-04 Viraj Nadkarni , D. Manjunath , Sharayu Moharir

In a strategy-proof mechanism, the influence of an agent may be measured as the set of outcomes an agent can bring about by varying her (reported) type. More specifically, we refer to an agent's influence on her own relevant outcomes as her…

Theoretical Economics · Economics 2025-12-12 Christian Basteck , Ulysse Lojkine

We study a stochastic model of anonymous influence with conformist and anti-conformist individuals. Each agent with a `yes' or `no' initial opinion on a certain issue can change his opinion due to social influence. We consider anonymous…

Social and Information Networks · Computer Science 2019-06-17 Michel Grabisch , Alexis Poindron , Agnieszka Rusinowska

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