Split: Inferring Unobserved Event Probabilities for Disentangling Brand-Customer Interactions

no code implementations • 8 Dec 2020 • Ayush Chauhan, Aditya Anand, Shaddy Garg, Sunny Dhamnani, Shiv Kumar Saini

This paper takes a direct approach whereby an event of interest is identified based on information on the composite event and aggregate data on composite events (e. g. total number of search ads shown).

Marketing

Distance Restricted Manipulation in Voting

no code implementations • 7 Sep 2019 • Aditya Anand, Palash Dey

We show that {\em Distance Restricted Strong Manipulation} admits polynomial-time algorithms for every scoring rule, maximin, Bucklin, and simplified Bucklin voting rules for a single manipulator, and for the $k$-approval rule for any number of manipulators, but becomes intractable for the Copeland$^\alpha$ voting rule for every $\alpha\in[0, 1]$ even for a single manipulator.