Welfare maximization with friends-of-friends network externalities
From MaRDI portal
Publication:1693985
DOI10.1007/s00224-017-9759-8zbMath1387.68130OpenAlexW2258864103WikidataQ59604266 ScholiaQ59604266MaRDI QIDQ1693985
Sayan Bhattacharya, Wolfgang Dvořák, Martin Starnberger, Monika R. Henzinger
Publication date: 1 February 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-017-9759-8
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- A comment on pure-strategy Nash equilibria in competitive diffusion games
- A note on competitive diffusion through social networks
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- The budgeted maximum coverage problem
- Equilibrium pricing with positive externalities
- On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities
- Friend of My Friend: Network Formation with Two-Hop Benefit
- Limiting Price Discrimination when Selling Products with Positive Network Externalities
- Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions
- Welfare Maximization with Friends-of-Friends Network Externalities
- A threshold of ln n for approximating set cover
- Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
- Complexity of automaton identification from given data
- On Maximizing Welfare When Utility Functions Are Subadditive
- Competitive contagion in networks
- Some optimal inapproximability results
This page was built for publication: Welfare maximization with friends-of-friends network externalities
