The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Convex Optimization
Optimal marketing strategies over social networks
Proceedings of the 17th international conference on World Wide Web
Spiteful bidding in sealed-bid auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Optimal auctions with positive network externalities
Proceedings of the 12th ACM conference on Electronic commerce
| Hi-index | 0.00 |
We introduce and study the algorithmic problem of maximizing revenue in a network using differential pricing, where the prices offered to neighboring vertices cannot be substantially different. Our most surprising result is that the optimal pricing can be computed efficiently, even for arbitrary revenue functions. In contrast, we show that if one is allowed to introduce discontinuities (by deleting vertices) the optimization problem becomes computationally hard, and we exhibit algorithms for special classes of graphs. We also study a stochastic model, and show that a similar contrast exists there: For pricing without discontinuities the benefit of differential pricing over a single price is negligible, while for differential pricing with discontinuities the difference is substantial.