default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiddharth Prasad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2023
[c9]Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm:
Bicriteria Multidimensional Mechanism Design with Side Information. NeurIPS 2023- 2022
- [c8]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Improved Sample Complexity Bounds for Branch-And-Cut. CP 2022: 3:1-3:19 - [c7]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm:
Maximizing Revenue under Market Shrinkage and Market Uncertainty. NeurIPS 2022 - [c6]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. NeurIPS 2022 - 2021
- [c5]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm:
Learning Within an Instance for Designing High-Revenue Combinatorial Auctions. IJCAI 2021: 31-37 - [c4]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. NeurIPS 2021: 4015-4027 - 2020
- [c3]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm:
Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs. IJCAI 2020: 332-338 - [c2]Federico Echenique
, Siddharth Prasad:
Incentive Compatible Active Learning. ITCS 2020: 67:1-67:20 - 2019
- [c1]Zachary Chase, Siddharth Prasad:
Learning Time Dependent Choice. ITCS 2019: 62:1-62:19
Informal and Other Publications
- 2024
- [i8]Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm:
New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets. CoRR abs/2401.13773 (2024) - 2023
- [i7]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm:
Bicriteria Multidimensional Mechanism Design with Side Information. CoRR abs/2302.14234 (2023) - [i6]Siddharth Prasad, Martin Mladenov, Craig Boutilier:
Content Prompting: Modeling Content Provider Dynamics to Improve User Welfare in Recommender Ecosystems. CoRR abs/2309.00940 (2023) - 2022
- [i5]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. CoRR abs/2204.07312 (2022) - 2021
- [i4]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. CoRR abs/2106.04033 (2021) - [i3]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Improved Learning Bounds for Branch-and-Cut. CoRR abs/2111.11207 (2021) - 2019
- [i2]Federico Echenique, Siddharth Prasad:
Incentive Compatible Active Learning. CoRR abs/1911.05171 (2019) - 2018
- [i1]Zachary Chase, Siddharth Prasad:
Learning Time Dependent Choice. CoRR abs/1809.03154 (2018)
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-04-24 23: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
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:
