A Network Approach to Public Goods: A Short Summary

07/09/2021
by   Matthew Elliott, et al.
0

Suppose agents can exert costly effort that creates nonrival, heterogeneous benefits for each other. At each possible outcome, a weighted, directed network describing marginal externalities is defined. We show that Pareto efficient outcomes are those at which the largest eigenvalue of the network is 1. An important set of efficient solutions, Lindahl outcomes, are characterized by contributions being proportional to agents' eigenvector centralities in the network. The outcomes we focus on are motivated by negotiations. We apply the results to identify who is essential for Pareto improvements, how to efficiently subdivide negotiations, and whom to optimally add to a team.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/03/2016

Can we reach Pareto optimal outcomes using bottom-up approaches?

Traditionally, researchers in decision making have focused on attempting...
research
06/07/2021

Improving Social Welfare While Preserving Autonomy via a Pareto Mediator

Machine learning algorithms often make decisions on behalf of agents wit...
research
01/26/2021

Liberalism, rationality, and Pareto optimality

Rational players in game theory are neoliberal in the sense that they ca...
research
12/07/2017

Fair mixing: the case of dichotomous preferences

Agents vote to choose a fair mixture of public outcomes; each agent like...
research
06/23/2023

Achieving Diversity in Objective Space for Sample-efficient Search of Multiobjective Optimization Problems

Efficiently solving multi-objective optimization problems for simulation...
research
10/19/2021

Learning Pareto-Efficient Decisions with Confidence

The paper considers the problem of multi-objective decision support when...

Please sign up or login with your details

Forgot password? Click here to reset