13 citations · 21 across the 7 of their papers we have counts for
8 papers
The Generalized Excursion Coupling as the Limit of Concave Optimal Transport
Yash Kanoria
The Monge-Kantorovich problem with the Euclidean distance cost is degenerate, typically admitting infinitely many optimal plans. A unique optimal plan is selected by perturbing the…
Right-Sizing Communication and Recommendation Set Size in AI-Assisted Search
Jing Dong, Prakirt Raj Jhunjhunwala, Yash Kanoria
We model the interaction between a user and an AI driven recommendation system. The user initiates the process by conveying preference information through a costly and noisy messag…
What Is Your AI Agent Buying? Evaluation, Biases, Model Dependence, & Emerging Implications for Agentic E-Commerce
Amine Allouah, Omar Besbes, Josué D Figueroa +2
Online marketplaces will be transformed by autonomous AI agents acting on behalf of consumers. Rather than humans browsing and clicking, AI agents can parse webpages or leverage AP…
Impact of Rankings and Personalized Recommendations in Marketplaces
Omar Besbes, Yash Kanoria, Akshit Kumar
Decision-making often requires individuals to navigate large sets of options with incomplete information and imperfectly formed preferences. Information provisioning tools, such as…
The Fault in Our Recommendations: On the Perils of Optimizing the Measurable
Omar Besbes, Yash Kanoria, Akshit Kumar
Recommendation systems are widespread, and through customized recommendations, promise to match users with options they will like. To that end, data on engagement is collected and…
Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
Omar Besbes, Yash Kanoria, Akshit Kumar
Dynamic resource allocation problems are ubiquitous, arising in inventory management, order fulfillment, online advertising, and other applications. We initially focus on one of th…
Dynamic Spatial Matching
Yash Kanoria
Motivated by a variety of online matching platforms, we consider demand and supply units which are located i.i.d. in [0,1]^d, and each demand unit needs to be matched with a supply…
Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure
Yash Kanoria, Pengyu Qian
We study the problem of maximizing payoff generated over a period of time in a general class of closed queueing networks with a finite, fixed number of supply units which circulate…