default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShant Boodaghians
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Shant Boodaghians
, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. Math. Oper. Res. 48(1): 498-519 (2023)- 2022
- [j2]Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta:
Online revenue maximization for server pricing. Auton. Agents Multi Agent Syst. 36(1): 11 (2022) - [c11]Shant Boodaghians, Bhaskar Ray Chaudhury, Ruta Mehta:
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores. SODA 2022: 2285-2302 - 2021
- [b1]Shant Boodaghians:
Search and optimization with randomness in computational economics: equilibria, pricing, and decisions. University of Illinois Urbana-Champaign, USA, 2021 - [j1]Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta:
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets. Discret. Optim. 42: 100671 (2021) - [i9]Shant Boodaghians, Bhaskar Ray Chaudhury, Ruta Mehta:
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores. CoRR abs/2107.06649 (2021) - 2020
- [c10]Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein:
Smoothed Complexity of 2-player Nash Equilibria. FOCS 2020: 271-282 - [c9]Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta:
Online Revenue Maximization for Server Pricing. IJCAI 2020: 4106-4112 - [c8]Shant Boodaghians, Rucha Kulkarni, Ruta Mehta:
Smoothed Efficient Algorithms and Reductions for Network Coordination Games. ITCS 2020: 73:1-73:15 - [c7]Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. EC 2020: 439-458 - [i8]Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. CoRR abs/2002.06968 (2020) - [i7]Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein:
Smoothed Complexity of 2-player Nash Equilibria. CoRR abs/2007.10857 (2020)
2010 – 2019
- 2019
- [c6]Gaurush Hiranandani, Shant Boodaghians, Ruta Mehta, Oluwasanmi Koyejo:
Performance Metric Elicitation from Pairwise Classifier Comparisons. AISTATS 2019: 371-379 - [c5]Gaurush Hiranandani, Shant Boodaghians, Ruta Mehta, Oluwasanmi Koyejo:
Multiclass Performance Metric Elicitation. NeurIPS 2019: 9351-9360 - [i6]Shant Boodaghians, Federico Fusco, Stefano Leonardi, Yishay Mansour, Ruta Mehta:
Online Revenue Maximization for Server Pricing. CoRR abs/1906.09880 (2019) - 2018
- [c4]Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta:
Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets. SAGT 2018: 267-271 - [c3]Shant Boodaghians:
Revealed Preference Dimension via Matrix Sign Rank. WINE 2018: 66-79 - [i5]Gaurush Hiranandani, Shant Boodaghians, Ruta Mehta, Oluwasanmi Koyejo:
Eliciting Binary Performance Metrics. CoRR abs/1806.01827 (2018) - [i4]Shant Boodaghians:
Revealed Preference Dimension via Matrix Sign Rank. CoRR abs/1807.10878 (2018) - [i3]Shant Boodaghians, Rucha Kulkarni, Ruta Mehta:
Nash Equilibrium in Smoothed Polynomial Time for Network Coordination Games. CoRR abs/1809.02280 (2018) - 2015
- [c2]Shant Boodaghians, Adrian Vetta:
The Combinatorial World (of Auctions) According to GARP. SAGT 2015: 125-136 - [c1]Shant Boodaghians, Adrian Vetta:
Testing Consumer Rationality Using Perfect Graphs and Oriented Discs. WINE 2015: 187-200 - [i2]Shant Boodaghians, Adrian Vetta:
The Combinatorial World (of Auctions) According to GARP. CoRR abs/1505.00508 (2015) - [i1]Shant Boodaghians, Adrian Vetta:
Testing Consumer Rationality using Perfect Graphs and Oriented Discs. CoRR abs/1507.07581 (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-04-24 22:59 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:
