Vashist Avadhanula

Orcid: 0000-0002-3045-691X

According to our database1, Vashist Avadhanula authored at least 18 papers between 2014 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A tractable online learning algorithm for the multinomial logit contextual bandit.
Eur. J. Oper. Res., October, 2023

Fair Allocation Over Time, with Applications to Content Moderation.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Fully Dynamic Online Selection through Online Contention Resolution Schemes.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Bandits for Online Calibration: An Application to Content Moderation on Social Media Platforms.
CoRR, 2022

Robust and fair work allocation.
CoRR, 2022

Top K Ranking for Multi-Armed Bandit with Noisy Evaluations.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
QUEST: Queue Simulation for Content Moderation at Scale.
CoRR, 2021

Stochastic bandits for multi-platform budget optimization in online advertising.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Multi-Armed Bandits with Cost Subsidy.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Improved Optimistic Algorithm For The Multinomial Logit Contextual Bandit.
CoRR, 2020

Multi-armed Bandits with Cost Subsidy.
CoRR, 2020

2019
The MNL-Bandit Problem: Theory and Applications.
PhD thesis, 2019

MNL-Bandit: A Dynamic Learning Approach to Assortment Selection.
Oper. Res., 2019

Thompson Sampling for Contextual Bandit Problems with Auxiliary Safety Constraints.
CoRR, 2019

2017
Thompson Sampling for the MNL-Bandit.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
On the tightness of an LP relaxation for rational optimization and its applications.
Oper. Res. Lett., 2016

A Near-Optimal Exploration-Exploitation Approach for Assortment Selection.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2014
A few good predictions: selective node labeling in a social network.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014


  Loading...