A natural adaptive process for collective decision-making
From MaRDI portal
Publication:6565779
DOI10.3982/TE5380MaRDI QIDQ6565779FDOQ6565779
Authors: Florian Brandl, Felix Brandt
Publication date: 2 July 2024
Published in: Theoretical Economics (Search for Journal in Brave)
Markov processesevolutionary game theoryprobabilistic social choicemaximal lotteriesequilibrium learning
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Elements of Information Theory
- Social choice and individual values
- Voting schemes for which it can be difficult to tell who won the election
- Evolutionarily stable strategies and game dynamics
- Learning mixed equilibria
- Evolutionary Games and Population Dynamics
- The Nonstochastic Multiarmed Bandit Problem
- The logic of animal conflict
- Computation in networks of passively mobile finite-state sensors
- Deterministic evolutionary game dynamics
- A Consistent Extension of Condorcet’s Election Principle
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- Reaching a Consensus
- Deterministic Approximation of Stochastic Evolution in Games
- Solutions of ordinary differential equations as limits of pure jump markov processes
- Title not available (Why is that?)
- Handbook of social choice and welfare. Vol. 1.
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Ergodic theorems for weakly interacting infinite systems and the voter model
- Adaptive game playing using multiplicative weights
- Voting over income taxation
- The multiplicative weights update method: a meta-algorithm and applications
- Manipulation of Voting Schemes: A General Result
- Voting paradoxes and group coherence. The Condorcet efficiency of voting rules.
- An iterative method of solving a game
- Monotone imitation dynamics in large populations
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- On the Global Convergence of Stochastic Fictitious Play
- Regret in the on-line decision problem
- Handbook of Computational Social Choice
- Computing the minimal covering set
- Majority and Positional Voting in a Probabilistic Framework
- Manipulation of Schemes that Mix Voting with Chance
- A theorem on symmetric two-player zero-sum games
- Aggregation of preferences with a variable set of alternatives
- Simple adaptive strategies. From regret-matching to uncoupled dynamics. With the collaboration of Yakov Babichenko, Amotz Cahn, Yishay Mansour and David Schmeidler
- Probabilistic Social Choice Based on Simple Voting Comparisons
- Introduction to multi-armed bandits
- Interpretation of electoral mixed strategies
- Strategy-proofness of the randomized Condorcet voting system
- Consistent probabilistic social choice
- Reinforcement learning from comparisons: three alternatives are enough, two are not
- Arrovian aggregation of convex preferences
- Probabilistic Borda rule voting
- An analytical and experimental comparison of maximal lottery schemes
This page was built for publication: A natural adaptive process for collective decision-making
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565779)