default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshwinkumar Badanidiyuru
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-Bidding and Auctions in Online Advertising: A Survey. SIGecom Exch. 22(1): 159-183 (2024)- [c29]Adel Javanmard, Lin Chen, Vahab Mirrokni, Ashwinkumar Badanidiyuru, Gang Fu:
Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions. ICLR 2024 - [c28]Gagan Aggarwal
, Ashwinkumar Badanidiyuru, Paul Duetting, Federico Fusco:
Selling Joint Ads: A Regret Minimization Perspective. EC 2024: 164-194 - [i22]Adel Javanmard, Lin Chen, Vahab Mirrokni, Ashwinkumar Badanidiyuru, Gang Fu:
Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions. CoRR abs/2401.11081 (2024) - [i21]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-bidding and Auctions in Online Advertising: A Survey. CoRR abs/2408.07685 (2024) - [i20]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Paul Dütting, Federico Fusco:
Selling Joint Ads: A Regret Minimization Perspective. CoRR abs/2409.07819 (2024) - 2023
- [j5]Rad Niazadeh, Negin Golrezaei, Joshua R. Wang, Fransisca Susan, Ashwinkumar Badanidiyuru:
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization. Manag. Sci. 69(7): 3797-3817 (2023) - [c27]Ashwinkumar Badanidiyuru Varadaraja, Badih Ghazi, Pritish Kamath, Ravi Kumar, Ethan Leeman, Pasin Manurangsi, Avinash V. Varadarajan, Chiyuan Zhang:
Optimal Unbiased Randomizers for Regression with Label Differential Privacy. NeurIPS 2023 - [c26]Chaoqi Wang, Ziyu Ye, Zhe Feng, Ashwinkumar Badanidiyuru Varadaraja, Haifeng Xu:
Follow-ups Also Matter: Improving Contextual Bandits via Post-serving Contexts. NeurIPS 2023 - [c25]Ashwinkumar Badanidiyuru, Zhe Feng, Guru Guruganesh:
Learning to Bid in Contextual First Price Auctions✱. WWW 2023: 3489-3497 - [i19]Chaoqi Wang, Ziyu Ye, Zhe Feng, Ashwinkumar Badanidiyuru, Haifeng Xu:
Follow-ups Also Matter: Improving Contextual Bandits via Post-serving Contexts. CoRR abs/2309.13896 (2023) - [i18]Ashwinkumar Badanidiyuru, Badih Ghazi, Pritish Kamath, Ravi Kumar, Ethan Leeman, Pasin Manurangsi, Avinash V. Varadarajan, Chiyuan Zhang:
Optimal Unbiased Randomizers for Regression with Label Differential Privacy. CoRR abs/2312.05659 (2023) - 2022
- [c24]Ashwinkumar Badanidiyuru Varadaraja, Zhe Feng, Tianxi Li, Haifeng Xu:
Incrementality Bidding via Reinforcement Learning under Mixed and Delayed Rewards. NeurIPS 2022 - [i17]Ashwinkumar Badanidiyuru, Zhe Feng, Tianxi Li, Haifeng Xu:
Incrementality Bidding via Reinforcement Learning under Mixed and Delayed Rewards. CoRR abs/2206.01293 (2022) - 2021
- [c23]Rad Niazadeh, Negin Golrezaei, Joshua R. Wang, Fransisca Susan, Ashwinkumar Badanidiyuru:
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization. EC 2021: 737-738 - [i16]Ashwinkumar Badanidiyuru, Andrew Evdokimov, Vinodh Krishnan, Pan Li, Wynn Vonnegut, Jayden Wang:
Handling many conversions per click in modeling delayed feedback. CoRR abs/2101.02284 (2021) - [i15]Rad Niazadeh, Negin Golrezaei, Joshua R. Wang, Fransisca Susan, Ashwinkumar Badanidiyuru:
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization. CoRR abs/2102.11050 (2021) - [i14]Ashwinkumar Badanidiyuru, Zhe Feng, Guru Guruganesh:
Learning to Bid in Contextual First Price Auctions. CoRR abs/2109.03173 (2021) - [i13]Jibang Wu, Ashwinkumar Badanidiyuru, Haifeng Xu:
Auctioning with Strategically Reticent Bidders. CoRR abs/2109.04888 (2021) - 2020
- [c22]Ashwinkumar Badanidiyuru, Amin Karbasi, Ehsan Kazemi, Jan Vondrák:
Submodular Maximization Through Barrier Functions. NeurIPS 2020 - [i12]Ashwinkumar Badanidiyuru, Amin Karbasi, Ehsan Kazemi, Jan Vondrák:
Submodular Maximization Through Barrier Functions. CoRR abs/2002.03523 (2020)
2010 – 2019
- 2019
- [j4]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren:
Optimization with Demand Oracles. Algorithmica 81(6): 2244-2269 (2019) - [c21]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Aranyak Mehta:
Autobidding with Constraints. WINE 2019: 17-30 - [c20]Saeed Alaei, Ashwinkumar Badanidiyuru, Mohammad Mahdian, Sadra Yazdanbod:
Response Prediction for Low-Regret Agents. WINE 2019: 31-44 - [i11]Saeed Alaei, Ashwinkumar Badanidiyuru, Mohammad Mahdian, Sadra Yazdanbod:
Response Prediction for Low-Regret Agents. CoRR abs/1911.02056 (2019) - 2018
- [j3]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
Bandits with Knapsacks. J. ACM 65(3): 13:1-13:55 (2018) - [c19]Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu:
Targeting and Signaling in Ad Auctions. SODA 2018: 2545-2563 - 2017
- [i10]Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu:
Targeting and Signaling in Ad Auctions. CoRR abs/1708.00611 (2017) - 2016
- [c18]Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi:
Fast Constrained Submodular Maximization: Personalized Data Summarization. ICML 2016: 1358-1367 - [c17]Ashwinkumar Badanidiyuru, Christos H. Papadimitriou, Aviad Rubinstein, Lior Seeman, Yaron Singer:
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions. SODA 2016: 414-429 - 2015
- [c16]Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, Andreas Krause:
Lazier Than Lazy Greedy. AAAI 2015: 1812-1818 - [c15]Baharan Mirzasoleiman, Amin Karbasi, Ashwinkumar Badanidiyuru, Andreas Krause:
Distributed Submodular Cover: Succinctly Summarizing Massive Data. NIPS 2015: 2881-2889 - [i9]Ashwinkumar Badanidiyuru, Christos H. Papadimitriou, Aviad Rubinstein, Lior Seeman, Yaron Singer:
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions. CoRR abs/1507.02351 (2015) - 2014
- [b1]Ashwinkumar Badanidiyuru:
Sequential Decision Making With Resource Constraints. Cornell University, USA, 2014 - [c14]Alekh Agarwal, Ashwinkumar Badanidiyuru, Miroslav Dudík, Robert E. Schapire, Aleksandrs Slivkins:
Robust Multi-objective Learning with Mentor Feedback. COLT 2014: 726-741 - [c13]Ashwinkumar Badanidiyuru, John Langford, Aleksandrs Slivkins:
Resourceful Contextual Bandits. COLT 2014: 1109-1134 - [c12]Ashwinkumar Badanidiyuru, Baharan Mirzasoleiman, Amin Karbasi, Andreas Krause:
Streaming submodular maximization: massive data summarization on the fly. KDD 2014: 671-680 - [c11]Ashwinkumar Badanidiyuru, Jan Vondrák:
Fast algorithms for maximizing submodular functions. SODA 2014: 1497-1514 - [i8]Ashwinkumar Badanidiyuru, John Langford, Aleksandrs Slivkins:
Resourceful Contextual Bandits. CoRR abs/1402.6779 (2014) - [i7]Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, Andreas Krause:
Lazier Than Lazy Greedy. CoRR abs/1409.7938 (2014) - 2013
- [c10]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
Bandits with Knapsacks. FOCS 2013: 207-216 - [i6]Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins:
Bandits with Knapsacks. CoRR abs/1305.2545 (2013) - 2012
- [j2]Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan:
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. J. ACM 59(5): 22:1-22:35 (2012) - [c9]Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee:
Approximating low-dimensional coverage problems. SCG 2012: 161-170 - [c8]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren:
Optimization with demand oracles. EC 2012: 110-127 - [c7]Ashwinkumar Badanidiyuru, Robert Kleinberg, Yaron Singer:
Learning on a budget: posted price mechanisms for online procurement. EC 2012: 128-145 - [c6]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden:
Sketching valuation functions. SODA 2012: 1025-1035 - 2011
- [j1]Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
Secure message transmission in asynchronous networks. J. Parallel Distributed Comput. 71(8): 1067-1074 (2011) - [c5]Ashwinkumar Badanidiyuru Varadaraja:
Buyback Problem - Approximate Matroid Intersection with Cancellation Costs. ICALP (1) 2011: 379-390 - [i5]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren:
Optimization with Demand Oracles. CoRR abs/1107.2869 (2011) - [i4]Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee:
Approximating Low-Dimensional Coverage Problems. CoRR abs/1112.0689 (2011) - 2010
- [i3]B. V. Ashwinkumar:
Buyback Problem - Approximate matroid intersection with cancellation costs. CoRR abs/1009.5037 (2010)
2000 – 2009
- 2009
- [c4]Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. ICDCN 2009: 148-162 - [c3]B. V. Ashwinkumar, Robert Kleinberg:
Randomized Online Algorithms for the Buyback Problem. WINE 2009: 529-536 - [i2]B. V. Ashwinkumar, Robert Kleinberg:
Randomized Online Algorithms for the Buyback Problem. CoRR abs/0908.0043 (2009) - 2008
- [c2]Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan:
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. ICITS 2008: 137-155 - [c1]B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan:
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. PODC 2008: 115-124 - [i1]Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan:
Perfectly Secure Message Transmission Tolerating Mixed Adversary. IACR Cryptol. ePrint Arch. 2008: 232 (2008)
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 2025-01-14 22:15 CET 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:
