Computing a Profit-Maximizing Sequence of Offers to Agents in a Social Network
暂无分享,去创建一个
[1] Prasad Raghavendra,et al. Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[2] Rajeev Motwani,et al. Pricing Strategies for Viral Marketing on Social Networks , 2009, WINE.
[3] Matthew Richardson,et al. Mining the network value of customers , 2001, KDD '01.
[4] Vincent Conitzer,et al. Computing Slater Rankings Using Similarities among Candidates , 2006, AAAI.
[5] Noga Alon,et al. Ranking Tournaments , 2006, SIAM J. Discret. Math..
[6] Nir Ailon,et al. Aggregating inconsistent information: Ranking and clustering , 2008 .
[7] Baharan Mirzasoleiman,et al. Revenue maximization in social networks through discounting , 2012, Social Network Analysis and Mining.
[8] Nima Haghpanah,et al. Optimal Auctions with Positive Network Externalities , 2013, TEAC.
[9] Vahab S. Mirrokni,et al. Optimal marketing strategies over social networks , 2008, WWW.
[10] Anders Yeo,et al. The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.
[11] Fan Chung Graham,et al. Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.