2 citations · 6 across the 12 of their papers we have counts for
8 papers · 1 filter
Online Generalized-Mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
Zongjun Yang, Rachitesh Kumar, Christian Kroer
We study online fair allocation of sequentially arriving items among agents with heterogeneous preferences, with the objective of maximizing generalized-mean welfare, defin…
Prior-Independent Bidding Strategies for First-Price Auctions
Rachitesh Kumar, Omar Mouchtaki
First-price auctions are one of the most popular mechanisms for selling goods and services, with applications ranging from display advertising to timber sales. Unlike their close c…
Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
Rachitesh Kumar, Jon Schneider, Balasubramanian Sivan
Learning to bid in repeated first-price auctions is a fundamental problem at the interface of game theory and machine learning, which has seen a recent surge in interest due to the…
Single-Leg Revenue Management with Advice
Santiago Balseiro, Christian Kroer, Rachitesh Kumar
Single-leg revenue management is a foundational problem of revenue management that has been particularly impactful in the airline and hotel industry: Given units of a resource,…
Throttling Equilibria in Auction Markets
Xi Chen, Christian Kroer, Rachitesh Kumar
Throttling is a popular method of budget management for online ad auctions in which the platform modulates the participation probability of an advertiser in order to smoothly spend…
The Complexity of Pacing for Second-Price Auctions
Xi Chen, Christian Kroer, Rachitesh Kumar
Budget constraints are ubiquitous in online advertisement auctions. To manage these constraints and smooth out the expenditure across auctions, the bidders (or the platform on beha…
Contextual Standard Auctions with Budgets: Revenue Equivalence and Efficiency Guarantees
Santiago Balseiro, Christian Kroer, Rachitesh Kumar
The internet advertising market is a multi-billion dollar industry, in which advertisers buy thousands of ad placements every day by repeatedly participating in auctions. An import…
Fair and Efficient Cake Division with Connected Pieces
Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar +1
The classic cake-cutting problem provides a model for addressing fair and efficient allocation of a divisible, heterogeneous resource (metaphorically, the cake) among agents with d…