Optimizing social welfare in social networks
From MaRDI portal
Publication:2290372
Recommendations
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- On social envy-freeness in multi-unit markets
- Maximizing Nash product social welfare in allocating indivisible goods
- Complexity and approximability of egalitarian Nash product social welfare optimization in multiagent resource allocation
- Distributed fair allocation of indivisible goods
Cites work
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Envy-free allocations respecting social networks
- Fair Allocation of Indivisible Goods
- Fairness and rank-weighted utilitarianism in resource allocation
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 5017566 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Reducibility among combinatorial problems
Cited in
(7)- Welfare-improving vertical separation with network externality
- Welfare maximization with friends-of-friends network externalities
- Envy-free allocations respecting social networks
- Welfare maximization with friends-of-friends network externalities
- Wellness, social networking, and algorithms
- Optimal structures for social systems
- Maximum Votes Pareto-Efficient Allocations via Swaps on a Social Network
This page was built for publication: Optimizing social welfare in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290372)