default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVashist Avadhanula
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Priyank Agrawal
, Theja Tulabandhula, Vashist Avadhanula:
A tractable online learning algorithm for the multinomial logit contextual bandit. Eur. J. Oper. Res. 310(2): 737-750 (2023)- [c8]Vashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi, Matteo Russo:
Fully Dynamic Online Selection through Online Contention Resolution Schemes. AAAI 2023: 6693-6700 - [c7]Amine Allouah, Christian Kroer, Xuan Zhang, Vashist Avadhanula, Nona Bohanon, Anil Dania, Caner Gocmen, Sergey Pupyrev, Parikshit Shah, Nicolás Stier Moses, Ken Rodríguez Taarup:
Fair Allocation Over Time, with Applications to Content Moderation. KDD 2023: 25-35 - [i11]Vashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi, Matteo Russo:
Fully Dynamic Online Selection through Online Contention Resolution Schemes. CoRR abs/2301.03099 (2023) - 2022
- [c6]Evrard Garcelon, Vashist Avadhanula, Alessandro Lazaric, Matteo Pirotta:
Top K Ranking for Multi-Armed Bandit with Noisy Evaluations. AISTATS 2022: 6242-6269 - [i10]Amine Allouah, Christian Kroer, Xuan Zhang, Vashist Avadhanula, Anil Dania, Caner Gocmen, Sergey Pupyrev, Parikshit Shah, Nicolás Stier Moses:
Robust and fair work allocation. CoRR abs/2202.05194 (2022) - [i9]Vashist Avadhanula, Omar Abdul Baki, Hamsa Bastani, Osbert Bastani, Caner Gocmen, Daniel Haimovich, Darren Hwang, Dima Karamshuk, Thomas J. Leeper, Jiayuan Ma, Gregory Macnamara, Jake Mullett, Christopher Palow, Sung Park, Varun S. Rajagopal, Kevin Schaeffer, Parikshit Shah, Deeksha Sinha, Nicolás Stier Moses, Peng Xu:
Bandits for Online Calibration: An Application to Content Moderation on Social Media Platforms. CoRR abs/2211.06516 (2022) - 2021
- [c5]Deeksha Sinha, Karthik Abinav Sankararaman, Abbas Kazerouni, Vashist Avadhanula:
Multi-Armed Bandits with Cost Subsidy. AISTATS 2021: 3016-3024 - [c4]Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers:
Stochastic bandits for multi-platform budget optimization in online advertising. WWW 2021: 2805-2817 - [i8]Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers:
Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising. CoRR abs/2103.10246 (2021) - [i7]Rahul Makhijani, Parikshit Shah, Vashist Avadhanula, Caner Gocmen, Nicolás E. Stier Moses, Julián Mestre:
QUEST: Queue Simulation for Content Moderation at Scale. CoRR abs/2103.16816 (2021) - [i6]Evrard Garcelon, Vashist Avadhanula, Alessandro Lazaric, Matteo Pirotta:
Top K Ranking for Multi-Armed Bandit with Noisy Evaluations. CoRR abs/2112.06517 (2021) - 2020
- [i5]Deeksha Sinha, Karthik Abinav Sankararama, Abbas Kazerouni, Vashist Avadhanula:
Multi-armed Bandits with Cost Subsidy. CoRR abs/2011.01488 (2020) - [i4]Priyank Agrawal, Vashist Avadhanula, Theja Tulabandhula:
Improved Optimistic Algorithm For The Multinomial Logit Contextual Bandit. CoRR abs/2011.14033 (2020)
2010 – 2019
- 2019
- [b1]Vashist Avadhanula:
The MNL-Bandit Problem: Theory and Applications. Columbia University, USA, 2019 - [j2]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection. Oper. Res. 67(5): 1453-1485 (2019) - [i3]Samuel Daulton, Shaun Singh, Vashist Avadhanula, Drew Dimmery, Eytan Bakshy:
Thompson Sampling for Contextual Bandit Problems with Auxiliary Safety Constraints. CoRR abs/1911.00638 (2019) - 2017
- [c3]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
Thompson Sampling for the MNL-Bandit. COLT 2017: 76-78 - [i2]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
Thompson Sampling for the MNL-Bandit. CoRR abs/1706.00977 (2017) - [i1]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection. CoRR abs/1706.03880 (2017) - 2016
- [j1]Vashist Avadhanula, Jalaj Bhandari, Vineet Goyal, Assaf Zeevi:
On the tightness of an LP relaxation for rational optimization and its applications. Oper. Res. Lett. 44(5): 612-617 (2016) - [c2]Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
A Near-Optimal Exploration-Exploitation Approach for Assortment Selection. EC 2016: 599-600 - 2014
- [c1]Gaurish Chaudhari, Vashist Avadhanula, Sunita Sarawagi:
A few good predictions: selective node labeling in a social network. WSDM 2014: 353-362
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
