Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sanjog Misra

dblp:32/6955 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0002-9491-3454ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 50% Computational finance and economics · 50%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities › marketing
targeted marketing
0.812024
Coarse Personalization · EC 2024

Methods — techniques the papers use, named apart from their topics

optimal transport · 0.8machine learning for treatment effect estimation · 0.8
YearPublicationVenuePosition
2024 Coarse Personalization
abstract
Advances in estimating heterogeneous treatment effects enable firms to personalize marketing mix elements and target individuals at an unmatched level of granularity, but feasibility constraints limit such personalization. In practice, firms choose which unique treatments to offer and which individuals to offer these treatments with the goal of maximizing profits: we call this the coarse personalization problem. We propose a two-step solution that makes segmentation and targeting decisions in concert. First, the firm personalizes by estimating conditional average treatment effects. Second, the firm discretizes by utilizing treatment effects to choose which unique treatments to offer and who to assign to these treatments. We show that a combination of available machine learning tools for estimating heterogeneous treatment effects and a novel application of optimal transport methods provides a viable and efficient solution. With data from a large-scale field experiment for promotions management, we find that our methodology outperforms extant approaches that segment on consumer characteristics or preferences and those that only search over a prespecified grid. Using our procedure, the firm recoups over 99.5% of its expected incremental profits under fully granular personalization while offering only five unique treatments. We conclude by discussing how coarse personalization arises in other domains.
Walter Zhang, Sanjog Misra
EC2
2000 An empirical investigation into the validity of transitivity and non-satiety assumptions in partial order structures: a note
abstract
Research in the area of information acquisition has been based on two key assumptions, namely, nonsatiety (implying more is preferable to less) and transitivity (implying that if A is preferred to B and B to C then A will be preferred to C). While at first glance these assumptions do not seem altogether unjustifiable, they do, in practice, constrain the empirical application of the research models. The primary purpose of the paper is to test the validity of these two key assumptions underlying most theoretical research in information acquisition and resource allocation. We begin by introducing four partial order structures and highlight the assumptions upon which they have been based. We then discuss how these structures could be used in estimating consumer preferences. We also provide a statistical methodology to implement such estimation. In later sections, we implement the empirical model on two data sets and discuss the results and propose generalizations.
Sanjog Misra, H. Raghav Rao, S. Divakar
IEEE Trans. Syst. Man Cybern. Part A1