Optimizing social welfare in social networks
From MaRDI portal
Publication:2290372
DOI10.1007/978-3-030-31489-7_6zbMath1431.91306OpenAlexW2979953235MaRDI QIDQ2290372
Publication date: 27 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-31489-7_6
Social networks; opinion dynamics (91D30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Welfare economics (91B15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Envy-free allocations respecting social networks
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Fairness and Rank-Weighted Utilitarianism in Resource Allocation
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Reducibility among Combinatorial Problems
- Fair Allocation of Indivisible Goods
This page was built for publication: Optimizing social welfare in social networks