Schedules for marketing products with negative externalities

DOI10.1016/J.TCS.2014.01.008MaRDI QIDQ744100zbMATHOpenAlexFDO

Authors Zhigang Cao, Changjun Wang, Xujin Chen

Publication date 6 October 2014

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

Full work available at URL https://doi.org/10.1016/j.tcs.2014.01.008

zbMATH Keywords

social networkefficient algorithmnegative externalitymarketing scheduleregret-proof schedule

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Applications of game theory (91A80) Social networks; opinion dynamics (91D30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Marketing, advertising (90B60)

Recommendations

• How to schedule the marketing of products with negative externalities
• Approximation algorithms for pricing with negative network externalities
• NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities
• On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities
• Optimal online pricing with network externalities

Cites work

• scientific article; zbMATH DE number 5485445 (Why is no real title available?)
• A note on anti-coordination and social interactions
• Anti-coordination and social interactions
• Competitive contagion in networks
• Diffusion in social networks with competing products
• On the approximability of influence in social networks
• Optimization, approximation, and complexity classes
• Recent developments in the economics of price discrimination
• Social and economic networks.

Cited in

(1)

• How to schedule the marketing of products with negative externalities

This page was built for publication: Schedules for marketing products with negative externalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744100)