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.

Justin Rao

dblp:50/9598 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Artificial intelligence and machine learning · 2Theory of computation · 2Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 100%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 94% Information retrieval · 6%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › collaborative filtering › matrix factorization
feature-based matrix factorization
0.312017
Modeling Consumer Preferences and Price Sensitivities from Large-Scale Grocery Shopping Transaction Logs · WWW 2017
Recommender systems › collaborative filtering
matrix factorization
0.312017
Modeling Consumer Preferences and Price Sensitivities from Large-Scale Grocery Shopping Transaction Logs · WWW 2017
Recommender systems › user modeling
user preference modeling
0.312017
Modeling Consumer Preferences and Price Sensitivities from Large-Scale Grocery Shopping Transaction Logs · WWW 2017
Algorithmic game theory and mechanism design
mechanism design
0.212014
Whole page optimization: how page elements interact with the position auction · EC 2014
Algorithmic game theory and mechanism design › mechanism design › auction design › ad auction
position auction
0.212014
Whole page optimization: how page elements interact with the position auction · EC 2014
Algorithmic game theory and mechanism design › auction theory › advertising auctions
sponsored search
0.212014
Whole page optimization: how page elements interact with the position auction · EC 2014
Algorithmic game theory and mechanism design › mechanism design
information design
0.112018
The A/B Testing Problem · EC 2018
Algorithmic game theory and mechanism design › information economics
value of information
0.112018
The A/B Testing Problem · EC 2018
Computational social science and digital humanities › marketing
consumer behavior
0.112017
Modeling Consumer Preferences and Price Sensitivities from Large-Scale Grocery Shopping Transaction Logs · WWW 2017
Information retrieval
search engines
0.112014
Whole page optimization: how page elements interact with the position auction · EC 2014

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

nested feature-based model · 0.6matrix factorization · 0.6randomized experiment · 0.4equilibrium analysis · 0.4optimization · 0.3bayesian decision theory · 0.3
YearPublicationVenuePosition
2018 The A/B Testing Problem
abstract
"Randomized experiments are increasingly central to innovation in many fields. In the tech sector, major platforms run thousands of experiments (called A/B tests) each year on tens of millions of users at any given time and use the results to screen most product innovations. In the policy and academic circles, governments, nonprofit organizations, and academics use randomized control trials to evaluate social programs and shape public policy. Experiments are not only prevalent, but also highly heterogeneous in design. Policy makers and tech giants typically focus on a "go big" approach, obtaining large sample sizes for a small number of experiments to ensure they that can detect even small benefits of a policy intervention. In contrast, many start-ups and entrepreneurs take a different "go lean" approach, running many small tests and discarding any innovation without outstanding success. The idea is to quickly and cheaply experiment with many ideas, abandon or pivot from ideas that do not work, and scale up ideas that do work. In this paper, we study when each of these approaches is appropriate. To do so, we propose a new framework for optimal experimentation that we call the A/B testing problem. The frameworks also yields an optimal strategy of what innovations to implement and methods to calculate the value of data and experimentation. The key insight is that the optimal experimentation strategy depends crucially on the tails of the distribution of innovation quality, and whether these tails have "black swan" outliers, of innovations with a very large positive or negative impact. The A/B testing problem is as follows. A firm has a set of potential innovations i=1,-,I to implement. The quality ..._i of innovation i is unknown and comes from a distribution G. Quality is independently distributed across innovations. The firm selects a number of users n_i to allocate to an A/B test evaluating innovation i. This yields a signal with mean equal to the true quality of idea i and variance a^2/n_i. The firm is subject to the constraint that the total number of users assigned to experiments is no greater than the number N of users available for experimentation. After seeing the realization of the signals, the firm selects a subset S of ideas to implement. The firm's objective is to maximize the expected sum of the true quality of the ideas that are implemented.
Eduardo M. Azevedo, Alex Deng, José Luis Montiel Olea, Justin Rao, E. Glen Weyl
EC4
2017 Modeling Consumer Preferences and Price Sensitivities from Large-Scale Grocery Shopping Transaction Logs
abstract
In order to match shoppers with desired products and provide personalized promotions, whether in online or offline shopping worlds, it is critical to model both consumer preferences and price sensitivities simultaneously. Personalized preferences have been thoroughly studied in the field of recommender systems, though price (and price sensitivity) has received relatively little attention. At the same time, price sensitivity has been richly explored in the area of economics, though typically not in the context of developing scalable, working systems to generate recommendations. In this study, we seek to bridge the gap between large-scale recommender systems and established consumer theories from economics, and propose a nested feature-based matrix factorization framework to model both preferences and price sensitivities. Quantitative and qualitative results indicate the proposed personalized, interpretable and scalable framework is capable of providing satisfying recommendations (on two datasets of grocery transactions) and can be applied to obtain economic insights into consumer behavior.
Mengting Wan, Di Wang 0003, Matthew Taddy, Justin Rao, Jie Liu 0001, Dimitrios Lymberopoulos, Julian J. McAuley
WWW5
2014 Whole page optimization: how page elements interact with the position auction
abstract
We study the trade-off between layout elements of the search results page and revenue in the real-time sponsored search auction. Using data from a randomized experiment on a major search engine, we find that having images present among the search results tends to simultaneously raise the ad click-through rate and flatten the ad click curve, reducing the premium for occupying the top slot and thus impacting bidding incentives. Theoretical analysis shows that this type of change creates an ambiguous impact on revenue in equilibrium: a steeper curve with lower total click-through rate is preferable only if the expected revenue distribution is skewed enough towards the top bidder. Empirically, we show that this is a relatively rare phenomenon, and we also find that whole page satisfaction causally raises the click-through rate of the ad block. This means search engines have a short-run incentive to boost search result quality, not just a long-run incentive based on competition between providers.
Pavel Metrikov, Fernando Diaz 0001, Sébastien Lahaie, Justin Rao
EC4