English
Related papers

Related papers: Weak Strategyproofness in Randomized Social Choice

200 papers

We study the efficiency (in terms of social welfare) of truthful and symmetric mechanisms in one-sided matching problems with {\em dichotomous preferences} and {\em normalized von Neumann-Morgenstern preferences}. We are particularly…

Computer Science and Game Theory · Computer Science 2014-09-18 Marek Adamczyk , Piotr Sankowski , Qiang Zhang

We present a new strategic voting model where we use uncertainty representation to model preferences. Specifically, we use probability sets as uncertainty representations, together with lower and upper expected utility gains to take…

Computer Science and Game Theory · Computer Science 2026-05-18 Henri Surugue , Sébastien Destercke

Two characterizations of the whole class of strategy-proof aggregation rules on rich domains of locally unimodal preorders in finite median join-semilattices are provided. In particular, it is shown that such a class consists precisely of…

Theoretical Economics · Economics 2022-08-29 Ernesto Savaglio , Stefano Vannucci

In their seminal paper that initiated the field of algorithmic mechanism design, \citet{NR99} studied the problem of designing strategyproof mechanisms for scheduling jobs on unrelated machines aiming to minimize the makespan. They provided…

Computer Science and Game Theory · Computer Science 2022-09-12 Eric Balkanski , Vasilis Gkatzelis , Xizhi Tan

This paper is dedicated to a cautious learning methodology for predicting preferences between alternatives characterized by binary attributes (formally, each alternative is seen as a subset of attributes). By "cautious", we mean that the…

Artificial Intelligence · Computer Science 2022-06-16 Hugo Gilbert , Mohamed Ouaguenouni , Meltem Ozturk , Olivier Spanjaard

Distributed reinforcement learning trains on data from stale, buggy, or mismatched actors, producing actions with high surprisal (negative log-probability) under the learner's policy. The core difficulty is not surprising data per se, but…

Machine Learning · Computer Science 2026-05-14 Ian Osband

Election control considers the problem of an adversary who attempts to tamper with a voting process, in order to either ensure that their favored candidate wins (constructive control) or another candidate loses (destructive control). As…

Multiagent Systems · Computer Science 2017-11-27 Bryan Wilder , Yevgeniy Vorobeychik

Minimizing empirical risk subject to a set of constraints can be a useful strategy for learning restricted classes of functions, such as monotonic functions, submodular functions, classifiers that guarantee a certain class label for some…

Machine Learning · Computer Science 2016-10-26 Andrew Cotter , Maya Gupta , Jan Pfeifer

We study the plausibility of sub-optimal Nash equilibria of the direct revelation mechanism associated with a strategy-proof social choice function. By using the recently introduced empirical equilibrium analysis (Velez and Brown, 2019,…

Theoretical Economics · Economics 2020-07-08 Rodrigo A. Velez , Alexander L. Brown

Much work has been devoted, during the past twenty years, to using complexity to protect elections from manipulation and control. Many results have been obtained showing NP-hardness shields, and recently there has been much focus on whether…

Computer Science and Game Theory · Computer Science 2010-06-22 P. Faliszewski , E. Hemaspaandra , L. A. Hemaspaandra , J. Rothe

When allocating indivisible items to agents, it is known that the only strategyproof mechanisms that satisfy a set of rather mild conditions are constrained serial dictatorships: given a fixed order over agents, at each step the designated…

Computer Science and Game Theory · Computer Science 2025-02-28 Sylvain Bouveret , Hugo Gilbert , Jérôme Lang , Guillaume Méroué

Autonomous systems are increasingly expected to operate in the presence of adversaries, though adversaries may infer sensitive information simply by observing a system. Therefore, present a deceptive sequential decision-making framework…

Recent advances in the study of voting classification algorithms have brought empirical and theoretical results clearly showing the discrimination power of ensemble classifiers. It has been previously argued that the search of this…

Artificial Intelligence · Computer Science 2011-06-10 R. Nock

We develop a framework that leverages the smoothed complexity analysis by Spielman and Teng to circumvent paradoxes and impossibility theorems in social choice, motivated by modern applications of social choice powered by AI and ML. For…

Computer Science and Game Theory · Computer Science 2021-01-11 Lirong Xia

The method of multivariable Mendelian randomization uses genetic variants to instrument multiple exposures, to estimate the effect that a given exposure has on an outcome conditional on all other exposures included in a linear model.…

Methodology · Statistics 2024-08-20 Ashish Patel , James Lane , Stephen Burgess

Weak selection, which means a phenotype is slightly advantageous over another, is an important limiting case in evolutionary biology. Recently it has been introduced into evolutionary game theory. In evolutionary game dynamics, the…

Populations and Evolution · Quantitative Biology 2010-10-15 Bin Wu , Philipp M. Altrock , Long Wang , Arne Traulsen

Stochastic dominance is a preference relation of uncertain prospect defined over a class of utility functions. While this utility class represents basic properties of risk aversion, it includes some extreme utility functions rarely…

Optimization and Control · Mathematics 2015-12-29 Jian Hu , Gevorg Stepanyan

As data-driven predictive models are increasingly used to inform decisions, it has been argued that decision makers should provide explanations that help individuals understand what would have to change for these decisions to be beneficial…

Machine Learning · Computer Science 2020-10-15 Stratis Tsirtsis , Manuel Gomez-Rodriguez

This work contributes to a foundational question in economic theory: how do individual-level cognitive biases interact with collective choice mechanisms? We study a setting where voters hold intrinsic preference rankings over a set of…

Theoretical Economics · Economics 2026-02-24 Federico Fioravanti , Zoi Terzopoulou

We study a finite time horizon Markov decision process (MDP) consisting of several groups of multi-action finite-state restless bandit processes, which are identical within each group. The bandit processes into different groups can be…

Optimization and Control · Mathematics 2026-04-20 Jing Fu , Bill Moran , Jose Nino-Mora