@inproceedings{6bfeb8495bd7427ca5be22b8777ecaec,
title = "Being negative makes life NP-hard (for product sellers)",
abstract = "We study a product pricing model in social networks where the value a possible buyer (vertex) assigns to a product is influenced by the previous buyers and buying proceeds in discrete, synchronous rounds. Each arc in the social network is weighted with the amount by which the value that the end node of the arc assigns to the product is changed in the following rounds when the starting node buys the product. We show that computing the price generating the maximum revenue for the product seller in this setting is possible in strongly polynomial time if all arc weights are non-negative, but the problem becomes NP-hard when negative arc weights are allowed. Moreover, we show that the optimization version of the problem exhibits the interesting property that it is solvable in pseudopolynomial time but not approximable within any constant factor unless P = NP.",
keywords = "computational complexity, product pricing, social networks",
author = "Krumke, {Sven O.} and Schwahn, {Florian D.} and Clemens Thielen",
year = "2014",
doi = "10.1007/978-3-319-07890-8_24",
language = "English",
isbn = "9783319078892",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "277--288",
booktitle = "Fun with Algorithms - 7th International Conference, FUN 2014, Proceedings",
note = "7th International Conference on Fun with Algorithms, FUN 2014 ; Conference date: 01-07-2014 Through 03-07-2014",
}