Jon Schneider

is this you? claim profile

0 followers
Google ∙ Princeton University

Contextual Recommendations and Low-Regret Cutting-Plane Algorithms

We consider the following variant of contextual linear bandits motivated...
06/09/2021 ∙ by Sreenivas Gollapudi, et al. ∙ 0 ∙ share

read it
Prior-free Dynamic Mechanism Design With Limited Liability

We study the problem of repeatedly auctioning off an item to one of k bi...
03/02/2021 ∙ by Mark Braverman, et al. ∙ 0 ∙ share

read it
Combinatorial Bernoulli Factories: Matchings, Flows and Other Polytopes

A Bernoulli factory is an algorithmic procedure for exact sampling of ce...
11/07/2020 ∙ by Rad Niazadeh, et al. ∙ 0 ∙ share

read it
Contracts under Moral Hazard and Adverse Selection

In the classical principal-agent problem, a principal must design a cont...
10/14/2020 ∙ by Guru Guruganesh, et al. ∙ 0 ∙ share

read it
Learning Product Rankings Robust to Fake Users

In many online platforms, customers' decisions are substantially influen...
09/10/2020 ∙ by Negin Golrezaei, et al. ∙ 4 ∙ share

read it
Reserve Price Optimization for First Price Auctions

The display advertising industry has recently transitioned from second- ...
06/11/2020 ∙ by Zhe Feng, et al. ∙ 0 ∙ share

read it
Competing Optimally Against An Imperfect Prophet

Consider a gambler who observes the realizations of n independent, non-n...
04/21/2020 ∙ by Allen Liu, et al. ∙ 0 ∙ share

read it
Contextual Search for General Hypothesis Classes

We study a general version of the problem of online learning under binar...
03/03/2020 ∙ by Allen Liu, et al. ∙ 0 ∙ share

read it
Strategizing against No-regret Learners

How should a player who repeatedly plays a game against a no-regret lear...
09/30/2019 ∙ by Yuan Deng, et al. ∙ 0 ∙ share

read it
Contextual Bandits with Cross-learning

In the classical contextual bandits problem, in each round t, a learner ...
09/25/2018 ∙ by Santiago Balseiro, et al. ∙ 0 ∙ share

read it
Contextual Search via Intrinsic Volumes

We study the problem of contextual search, a multidimensional generaliza...
04/09/2018 ∙ by Renato Paes Leme, et al. ∙ 0 ∙ share

read it
Selling to a No-Regret Buyer

We consider the problem of a single seller repeatedly selling a single i...
11/25/2017 ∙ by Mark Braverman, et al. ∙ 0 ∙ share

read it
The space complexity of mirror games

We consider a simple streaming game between two players Alice and Bob, w...
10/08/2017 ∙ by Sumegha Garg, et al. ∙ 0 ∙ share

read it
Multi-armed Bandit Problems with Strategic Arms

We study a strategic version of the multi-armed bandit problem, where ea...
06/27/2017 ∙ by Mark Braverman, et al. ∙ 0 ∙ share

read it
Competitive analysis of the top-K ranking problem

Motivated by applications in recommender systems, web search, social cho...
05/12/2016 ∙ by Xi Chen, et al. ∙ 0 ∙ share

read it

Jon Schneider

Featured Co-authors

Xi Chen

Vahab Mirrokni

Pasin Manurangsi

S. Matthew Weinberg

Jieming Mao

Renato Paes Leme

Zhe Feng

Mark Braverman

Rad Niazadeh

Sivakanth Gopi

Mohammad Mahdian

Contextual Recommendations and Low-Regret Cutting-Plane Algorithms

Prior-free Dynamic Mechanism Design With Limited Liability

Combinatorial Bernoulli Factories: Matchings, Flows and Other Polytopes

Contracts under Moral Hazard and Adverse Selection

Learning Product Rankings Robust to Fake Users

Reserve Price Optimization for First Price Auctions

Competing Optimally Against An Imperfect Prophet

Contextual Search for General Hypothesis Classes

Strategizing against No-regret Learners

Contextual Bandits with Cross-learning

Contextual Search via Intrinsic Volumes

Selling to a No-Regret Buyer

The space complexity of mirror games

Multi-armed Bandit Problems with Strategic Arms

Competitive analysis of the top-K ranking problem