Inequity aversion pricing over social networks: approximation algorithms and hardness results
type: Item
instance of: scholarly article
title: Inequity aversion pricing over social networks: approximation algorithms and hardness results
zbMATH Open document ID: 1480.91167
author: Georgios Amanatidis
author: Peter Fulla
author: Evangelos Markakis
author: Krzysztof Sornat
published in: Theoretical Computer Science
publication date: 2021-06-08T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6425/
Mathematics Subject Classification ID: 91D30
Mathematics Subject Classification ID: 91B86
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7356473
zbMATH Keywords: revenue maximization
zbMATH Keywords: inequity aversion
zbMATH Keywords: social networks
zbMATH Keywords: pricing
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
OpenAlex ID: W3157465583
cites work: Q4608566
cites work: Q4258216
cites work: Q5005149
cites work: Approximation algorithms for pricing with negative network externalities
cites work: On approximation scheme preserving reducibility and its applications
cites work: Q4035360
cites work: The Complexity of Multiterminal Cuts
cites work: A Theory of Fairness, Competition, and Cooperation
cites work: On social envy-freeness in multi-unit markets
cites work: On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities
cites work: Multiway cuts in node weighted graphs
cites work: Competitive auctions
cites work: Geometric algorithms and combinatorial optimization
cites work: Q2941641
cites work: On Syntactic versus Computational Views of Approximability
cites work: Q3524733
cites work: Q4770411
DOI: 10.1016/J.TCS.2021.04.012
description: scientific article; zbMATH DE number 7356473