default search action
Rajan Udwani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j7]Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan, Rajan Udwani:
Online Bipartite Matching with Reusable Resources. Math. Oper. Res. 49(3): 1825-1854 (2024) - [j6]Thorben Tröbst, Rajan Udwani:
Almost tight bounds for online hypergraph matching. Oper. Res. Lett. 55: 107143 (2024) - 2023
- [j5]Vineet Goyal, Rajan Udwani:
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation. Oper. Res. 71(2): 563-580 (2023) - [j4]Selena Li, Rajan Udwani:
The non-Markovian nature of nested logit choice. Oper. Res. Lett. 51(4): 461-467 (2023) - 2022
- [j3]Xiao-Yue Gong, Vineet Goyal, Garud N. Iyengar, David Simchi-Levi, Rajan Udwani, Shuangyu Wang:
Online Assortment Optimization with Reusable Resources. Manag. Sci. 68(7): 4772-4785 (2022) - 2021
- [j2]Rajan Udwani:
Multiobjective Maximization of Monotone Submodular Functions with Cardinality Constraint. INFORMS J. Optim. 3(1): 74-88 (2021) - 2018
- [j1]James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust monotone submodular function maximization. Math. Program. 172(1-2): 505-537 (2018)
Conference and Workshop Papers
- 2024
- [c12]Rajan Udwani:
When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching. SOSA 2024: 321-330 - 2023
- [c11]Rajan Udwani:
Submodular Order Functions and Assortment Optimization. ICML 2023: 34584-34614 - [c10]Hyun-Jun Choi, Rajan Udwani, Min-hwan Oh:
Cascading Contextual Assortment Bandits. NeurIPS 2023 - [c9]Rajan Udwani:
Adwords with Unknown Budgets and Beyond. EC 2023: 1128 - 2022
- [c8]Rajan Udwani:
Periodic Reranking for Online Matching of Reusable Resources. EC 2022: 966 - 2021
- [c7]Vineet Goyal, Garud Iyengar, Rajan Udwani:
Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources. WINE 2021: 543 - 2020
- [c6]Vineet Goyal, Rajan Udwani:
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation. EC 2020: 791 - 2019
- [c5]Andreas S. Schulz, Rajan Udwani:
Robust Appointment Scheduling with Heterogeneous Costs. APPROX-RANDOM 2019: 25:1-25:17 - 2018
- [c4]Rajan Udwani:
Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint. NeurIPS 2018: 9513-9524 - 2016
- [c3]James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust Monotone Submodular Function Maximization. IPCO 2016: 312-324 - 2015
- [c2]Mohsen Ghaffari, Rajan Udwani:
Brief Announcement: Distributed Single-Source Reachability. PODC 2015: 163-165 - 2013
- [c1]Siddhant Agrawal, Prasanna Chaporkar, Rajan Udwani:
Call admission control for real-time applications in wireless network. INFOCOM 2013: 330-334
Informal and Other Publications
- 2024
- [i13]Thorben Tröbst, Rajan Udwani:
Almost Tight Bounds for Online Hypergraph Matching. CoRR abs/2402.08775 (2024) - [i12]Rajan Udwani:
Online Submodular Welfare Maximization Meets Post-Allocation Stochasticity and Reusability. CoRR abs/2403.18059 (2024) - [i11]Shuo Sun, Rajan Udwani, Zuo-Jun Max Shen:
A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice. CoRR abs/2404.03604 (2024) - 2023
- [i10]Rajan Udwani:
When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching. CoRR abs/2308.09767 (2023) - [i9]Omar El Housni, Rajan Udwani:
Placement Optimization of Substitutable Products. CoRR abs/2310.08568 (2023) - 2021
- [i8]Rajan Udwani:
Submodular Order Functions and Assortment Optimization. CoRR abs/2107.02743 (2021) - [i7]Rajan Udwani:
Adwords with Unknown Budgets. CoRR abs/2110.00504 (2021) - [i6]Rajan Udwani:
Periodic Reranking for Online Matching of Reusable Resources. CoRR abs/2110.02400 (2021) - 2020
- [i5]Vineet Goyal, Garud Iyengar, Rajan Udwani:
Online Allocation of Reusable Resources: Achieving Optimal Competitive Ratio. CoRR abs/2002.02430 (2020) - [i4]Vineet Goyal, Garud Iyengar, Rajan Udwani:
Online Allocation of Reusable Resources via Algorithms Guided by Fluid Approximations. CoRR abs/2010.03983 (2020) - 2019
- [i3]Vineet Goyal, Rajan Udwani:
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation. CoRR abs/1905.12778 (2019) - 2017
- [i2]Rajan Udwani:
Multi-Objective Maximization of Monotone Submodular Functions with Cardinality Constraint. CoRR abs/1711.06428 (2017) - 2015
- [i1]James B. Orlin, Andreas S. Schulz, Rajan Udwani:
Robust Monotone Submodular Function Maximization. CoRR abs/1507.06616 (2015)
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-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint