English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In marketing products with negative externalities, a schedule which specifiesan order of consumer purchase decisions is crucial, since in the social networkof consumers, the decision of each consumer is negatively affected by thechoices of her neighbors. In this paper, we study the problems of finding amarketing schedule for two asymmetric products with negative externalites. Thegoals are two-fold: maximizing the sale of one product and ensuring regret-freepurchase decisions. We show that the maximization is NP-hard, and provideefficient algorithms with satisfactory performance guarantees. Two of thesealgorithms give regret-proof schedules, i.e. they reach Nash equilibria whereno consumers regret their previous decisions. Our work is the first attempt toaddress these marketing problems from an algorithmic point of view.

How to Schedule the Marketing of Products with Negative Externalities