default search action
Junyao Zhao 0001
Person information
- affiliation: Stanford University, CA, USA
Other persons with the same name
- Junyao Zhao 0002 — Beijing Institute of Technology, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i10]Aviad Rubinstein, Junyao Zhao:
Strategizing against No-Regret Learners in First-Price Auctions. CoRR abs/2402.08637 (2024) - 2023
- [c10]Aviad Rubinstein, Junyao Zhao:
Beyond Worst-Case Budget-Feasible Mechanism Design. ITCS 2023: 93:1-93:22 - [c9]Gagan Aggarwal
, Andrés Perlroth
Multi-Channel Auction Design in the Autobidding World. EC 2023: 21 - [c8]Guru Guruganesh
The Power of Menus in Contract Design. EC 2023: 818-848 - [i9]Gagan Aggarwal, Andrés Perlroth, Junyao Zhao:
Multi-Channel Auction Design in the Autobidding World. CoRR abs/2301.13410 (2023) - [i8]Guru Guruganesh, Jon Schneider, Joshua R. Wang, Junyao Zhao:
The Power of Menus in Contract Design. CoRR abs/2306.12667 (2023) - 2022
- [c7]Aviad Rubinstein, Junyao Zhao:
Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation. ICALP 2022: 106:1-106:17 - [c6]Aviad Rubinstein, Junyao Zhao:
Budget-Smoothed Analysis for Submodular Maximization. ITCS 2022: 113:1-113:23 - [i7]Aviad Rubinstein, Junyao Zhao:
Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation. CoRR abs/2204.11149 (2022) - [i6]Aviad Rubinstein, Junyao Zhao:
Beyond Worst-Case Budget-Feasible Mechanism Design. CoRR abs/2211.08711 (2022) - 2021
- [j1]Aviad Rubinstein, Junyao Zhao:
The randomized communication complexity of revenue maximization. SIGecom Exch. 19(2): 75-83 (2021) - [c5]Paul Liu, Aviad Rubinstein, Jan Vondrák, Junyao Zhao:
Cardinality constrained submodular maximization for random streams. NeurIPS 2021: 6491-6502 - [c4]Aviad Rubinstein, Junyao Zhao:
The randomized communication complexity of randomized auctions. STOC 2021: 882-895 - [c3]Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg
Exponential communication separations between notions of selfishness. STOC 2021: 947-960 - [i5]Aviad Rubinstein, Junyao Zhao:
Budget-Smoothed Analysis for Submodular Maximization. CoRR abs/2102.05782 (2021) - [i4]Aviad Rubinstein, Junyao Zhao:
The Randomized Communication Complexity of Randomized Auctions. CoRR abs/2104.11275 (2021) - [i3]Paul Liu, Aviad Rubinstein, Jan Vondrák, Junyao Zhao:
Cardinality constrained submodular maximization for random streams. CoRR abs/2111.07217 (2021) - 2020
- [i2]Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg, Junyao Zhao:
Exponential Communication Separations between Notions of Selfishness. CoRR abs/2012.14898 (2020)
2010 – 2019
- 2018
- [c2]Ilija Bogunovic, Junyao Zhao, Volkan Cevher
Robust Maximization of Non-Submodular Objectives. AISTATS 2018: 890-899 - [i1]Ilija Bogunovic, Junyao Zhao, Volkan Cevher:
Robust Maximization of Non-Submodular Objectives. CoRR abs/1802.07073 (2018) - 2017
- [c1]Junyao Zhao, Josip Djolonga, Sebastian Tschiatschek
Improving Optimization-Based Approximate Inference by Clamping Variables. UAI 2017
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-25 05:54 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: