mlsanityData to 14 Oct 2026

Improving Social Welfare While Preserving Autonomy via a Pareto Mediator

arXiv 2106.03927 ↗First posted 7 Jun 2021cs.GT cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Machine learning algorithms often make decisions on behalf of agents with varied and sometimes conflicting interests. In domains where agents can choose to take their own action or delegate their action to a central mediator, an open question is how mediators should take actions on behalf of delegating agents. The main existing approach uses delegating agents to punish non-delegating agents in an attempt to get all agents to delegate, which tends to be costly for all. We introduce a Pareto Mediator which aims to improve outcomes for delegating agents without making any of them worse off. Our experiments in random normal form games, a restaurant recommendation game, and a reinforcement learning sequential social dilemma show that the Pareto Mediator greatly increases social welfare. Also, even when the Pareto Mediator is based on an incorrect model of agent utility, performance gracefully degrades to the pre-intervention level, due to the individual autonomy preserved by the voluntary mediator.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 16 of its 55 references that are in the map. First posted on arXiv 7 Jun 2021.

Builds on

16 of 55 references.

References · 16

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Proximal Policy Optimization Algorithmscited by 15,215
  3. 2017DeepStack: Expert-Level Artificial Intelligence in No-Limit Pokercited by 233
  4. 2017Learning with Opponent-Learning Awarenesscited by 222
  5. 2017Multi-agent Reinforcement Learning in Sequential Social Dilemmascited by 209
  6. 2020Open Problems in Cooperative AIcited by 168
  7. 2018Inequity aversion improves cooperation in intertemporal social dilemmascited by 106
  8. 2016Delay and Cooperation in Nonstochastic Banditscited by 71
  9. 2017A multi-agent reinforcement learning model of common-pool resource appropriationcited by 69
  10. 2019Competing Bandits in Matching Marketscited by 56
  11. 2018Stable Opponent Shaping in Differentiable Gamescited by 49
  12. 2020Pipeline PSRO: A Scalable Approach for Finding Approximate Nash Equilibria in Large Gamescited by 47
4 more
  1. 2021XDO: A Double Oracle Algorithm for Extensive-Form Gamescited by 34
  2. 2016Matching while Learningcited by 19
  3. 2019Evolutionary Reinforcement Learning for Sample-Efficient Multiagent Coordinationcited by 14
  4. 2021Accumulating Risk Capital Through Investing in Cooperationcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.

3 papers.