Inequity aversion pricing over social networks: approximation algorithms and hardness results

DOI10.1016/j.tcs.2021.04.012zbMath1480.91167OpenAlexW3157465583MaRDI QIDQ2031049

Peter Fulla, Evangelos Markakis, Georgios Amanatidis, Krzysztof Sornat

Publication date: 8 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6425/

zbMATH Keywords

social networksapproximation algorithmspricingrevenue maximizationinequity aversion

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Mathematical economics and fuzziness (91B86)

Related Items (1)

Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for pricing with negative network externalities
• Geometric algorithms and combinatorial optimization
• On approximation scheme preserving reducibility and its applications
• On social envy-freeness in multi-unit markets
• On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities
• Competitive auctions
• On Syntactic versus Computational Views of Approximability
• A Theory of Fairness, Competition, and Cooperation
• The Complexity of Multiterminal Cuts
• Multiway cuts in node weighted graphs

This page was built for publication: Inequity aversion pricing over social networks: approximation algorithms and hardness results