default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKshipra Bhawalkar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, Di Wang:
The Average-Value Allocation Problem. APPROX/RANDOM 2024: 13:1-13:23- [c13]Santiago R. Balseiro, Kshipra Bhawalkar, Zhe Feng, Haihao Lu, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
A Field Guide for Pacing Budget and ROS Constraints. ICML 2024 - [i9]Seyed A. Esmaeili, Kshipra Bhawalkar, Zhe Feng, Di Wang, Haifeng Xu:
How to Strategize Human Content Creation in the Era of GenAI? CoRR abs/2406.05187 (2024) - [i8]Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, Di Wang:
The Average-Value Allocation Problem. CoRR abs/2407.10401 (2024) - [i7]Kshipra Bhawalkar, Marios Mertzanidis, Divyarthi Mohan, Alexandros Psomas:
Mechanism Design via the Interim Relaxation. CoRR abs/2407.12699 (2024) - [i6]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) - 2023
- [i5]Santiago R. Balseiro, Kshipra Bhawalkar, Zhe Feng, Haihao Lu, Vahab Mirrokni, Balasubramanian Sivan, Di Wang:
Joint Feedback Loop for Spend and Return-On-Spend Constraints. CoRR abs/2302.08530 (2023) - 2022
- [c12]Gagan Aggarwal, Kshipra Bhawalkar, Guru Guruganesh, Andrés Perlroth:
Maximizing Revenue in the Presence of Intermediaries. ITCS 2022: 1:1-1:22 - [c11]Gagan Aggarwal, Kshipra Bhawalkar, Aranyak Mehta, Divyarthi Mohan, Alexandros Psomas:
Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions. NeurIPS 2022 - [i4]Gagan Aggarwal, Kshipra Bhawalkar, Aranyak Mehta, Divyarthi Mohan, Alexandros Psomas:
Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions. CoRR abs/2206.02948 (2022) - 2021
- [c10]Kshipra Bhawalkar, Kostas Kollias, Manish Purohit:
Revenue Maximization in Transportation Networks. APPROX-RANDOM 2021: 26:1-26:16 - [i3]Gagan Aggarwal, Kshipra Bhawalkar, Guru Guruganesh, Andrés Perlroth:
Maximizing revenue in the presence of intermediaries. CoRR abs/2111.10472 (2021)
2010 – 2019
- 2019
- [j3]Arash Asadpour
, MohammadHossein Bateni, Kshipra Bhawalkar, Vahab S. Mirrokni:
Concise Bid Optimization Strategies with Multiple Budget Constraints. Manag. Sci. 65(12): 5785-5812 (2019) - 2018
- [c9]Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu:
Targeting and Signaling in Ad Auctions. SODA 2018: 2545-2563 - 2017
- [i2]Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu:
Targeting and Signaling in Ad Auctions. CoRR abs/1708.00611 (2017) - 2015
- [j2]Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma:
Preventing Unraveling in Social Networks: The Anchored k-Core Problem. SIAM J. Discret. Math. 29(3): 1452-1475 (2015) - 2014
- [j1]Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden:
Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness. ACM Trans. Economics and Comput. 2(4): 14:1-14:23 (2014) - [c8]Kshipra Bhawalkar, Sreenivas Gollapudi, Debmalya Panigrahi:
Online Set Cover with Set Requests. APPROX-RANDOM 2014: 64-79 - [c7]Kshipra Bhawalkar, Patrick Hummel, Sergei Vassilvitskii:
Value of Targeting. SAGT 2014: 194-205 - [c6]Arash Asadpour, MohammadHossein Bateni, Kshipra Bhawalkar, Vahab S. Mirrokni:
Concise Bid Optimization Strategies with Multiple Budget Constraints. WINE 2014: 263-276 - [i1]Kshipra Bhawalkar, Patrick Hummel, Sergei Vassilvitskii:
Value of Targeting. CoRR abs/1407.3338 (2014) - 2013
- [b1]Kshipra Bhawalkar:
Approximation guarantees for game-theoretic equilibria. Stanford University, USA, 2013 - [c5]Kshipra Bhawalkar, Sreenivas Gollapudi, Kamesh Munagala:
Coevolutionary opinion formation games. STOC 2013: 41-50 - 2012
- [c4]Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma:
Preventing Unraveling in Social Networks: The Anchored k-Core Problem. ICALP (2) 2012: 440-451 - [c3]Kshipra Bhawalkar, Tim Roughgarden:
Simultaneous Single-Item Auctions. WINE 2012: 337-349 - 2011
- [c2]Kshipra Bhawalkar, Tim Roughgarden:
Welfare Guarantees for Combinatorial Auctions with Item Bidding. SODA 2011: 700-709 - 2010
- [c1]Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden:
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. ESA (2) 2010: 17-28
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-09-25 01:36 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:
