Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Kanoria, Yash"'
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 used. Most recommendation systems are ranking-based, where they rank a
Externí odkaz:
http://arxiv.org/abs/2405.03948
We argue that inventory management presents unique opportunities for reliably applying and evaluating deep reinforcement learning (DRL). Toward reliable application, we emphasize and test two techniques. The first is Hindsight Differentiable Policy O
Externí odkaz:
http://arxiv.org/abs/2306.11246
We study the problem of networked online convex optimization, where each agent individually decides on an action at every time step and agents cooperatively seek to minimize the total global cost over a finite horizon. The global cost is made up of t
Externí odkaz:
http://arxiv.org/abs/2207.05950
Dynamic resource allocation problems are ubiquitous, arising in inventory management, order fulfillment, online advertising, and other applications. We initially focus on one of the simplest models of online resource allocation: the multisecretary pr
Externí odkaz:
http://arxiv.org/abs/2205.09078
Autor:
Kanoria, Yash
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 unit. The goal is to minimize the expected average distance between m
Externí odkaz:
http://arxiv.org/abs/2105.07329
We study the competition for partners in two-sided matching markets with heterogeneous agent preferences, with a focus on how the equilibrium outcomes depend on the connectivity in the market. We model random partially connected markets, with each ag
Externí odkaz:
http://arxiv.org/abs/2006.14653
Autor:
Kanoria, Yash, Nazerzadeh, Hamid
A large fraction of online advertisement is sold via repeated second price auctions. In these auctions, the reserve price is the main tool for the auctioneer to boost revenues. In this work, we investigate the following question: Can changing the res
Externí odkaz:
http://arxiv.org/abs/2002.07331
Autor:
Kanoria, Yash, Qian, Pengyu
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 in the system. Demand arrives stochastically, and serving a demand un
Externí odkaz:
http://arxiv.org/abs/1903.02764
Autor:
Kanoria, Yash1 (AUTHOR) ykanoria@columbia.edu, Qian, Pengyu2 (AUTHOR) qianp@purdue.edu
Publikováno v:
Management Science. Aug2024, Vol. 70 Issue 8, p5445-5462. 18p.
We study the design of dynamic scheduling controls in closed queueing networks with a fixed number of jobs. Each time a server becomes available, the controller has (limited) flexibility in choosing the buffer from which to serve a job. If no jobs ar
Externí odkaz:
http://arxiv.org/abs/1803.04959