default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKunhe Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c8]Nika Haghtalab, Mingda Qiao, Kunhe Yang:
Platforms for Efficient and Incentive-Aware Collaboration. SODA 2025: 2607-2628- 2024
- [i12]Kunhe Yang, Hanrui Zhang:
Computational Aspects of Bayesian Persuasion under Approximate Best Response. CoRR abs/2402.07426 (2024) - [i11]Nika Haghtalab, Mingda Qiao, Kunhe Yang:
Platforms for Efficient and Incentive-Aware Collaboration. CoRR abs/2402.15169 (2024) - [i10]Saba Ahmadi, Kunhe Yang, Hanrui Zhang:
Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification. CoRR abs/2407.11619 (2024) - [i9]Nika Haghtalab, Mingda Qiao, Kunhe Yang, Eric Zhao:
Truthfulness of Calibration Measures. CoRR abs/2407.13979 (2024) - [i8]Nivasini Ananthakrishnan, Nika Haghtalab, Chara Podimata, Kunhe Yang:
Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interaction. CoRR abs/2408.08272 (2024) - [i7]Nika Haghtalab, Mingda Qiao, Kunhe Yang:
Leakage-Robust Bayesian Persuasion. CoRR abs/2411.16624 (2024) - 2023
- [c7]Paria Rashidinejad, Hanlin Zhu, Kunhe Yang, Stuart Russell, Jiantao Jiao:
Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian. ICLR 2023 - [c6]Nika Haghtalab, Chara Podimata, Kunhe Yang:
Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents. NeurIPS 2023 - [c5]Saba Ahmadi
, Avrim Blum, Kunhe Yang:
Fundamental Bounds on Online Strategic Classification. EC 2023: 22-58 - [i6]Saba Ahmadi, Avrim Blum, Kunhe Yang:
Fundamental Bounds on Online Strategic Classification. CoRR abs/2302.12355 (2023) - [i5]Nika Haghtalab, Chara Podimata, Kunhe Yang:
Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents. CoRR abs/2306.02704 (2023) - 2022
- [c4]Nika Haghtalab, Yanjun Han, Abhishek Shetty, Kunhe Yang:
Oracle-Efficient Online Learning for Smoothed Adversaries. NeurIPS 2022 - [i4]Nika Haghtalab, Yanjun Han, Abhishek Shetty, Kunhe Yang:
Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries. CoRR abs/2202.08549 (2022) - [i3]Paria Rashidinejad, Hanlin Zhu, Kunhe Yang, Stuart Russell, Jiantao Jiao:
Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian. CoRR abs/2211.00716 (2022) - 2021
- [j1]Isaac Grosof, Kunhe Yang, Ziv Scully, Mor Harchol-Balter:
Nudge: Stochastically Improving upon FCFS. Proc. ACM Meas. Anal. Comput. Syst. 5(2): 21:1-21:29 (2021) - [c3]Kunhe Yang, Lin F. Yang, Simon S. Du:
Q-learning with Logarithmic Regret. AISTATS 2021: 1576-1584 - [c2]Isaac Grosof, Kunhe Yang, Ziv Scully, Mor Harchol-Balter:
Nudge: Stochastically Improving upon FCFS. SIGMETRICS (Abstracts) 2021: 11-12 - [i2]Isaac Grosof, Kunhe Yang, Ziv Scully, Mor Harchol-Balter:
Nudge: Stochastically Improving upon FCFS. CoRR abs/2106.01492 (2021) - 2020
- [i1]Kunhe Yang, Lin F. Yang, Simon S. Du:
Q-learning with Logarithmic Regret. CoRR abs/2006.09118 (2020)
2010 – 2019
- 2019
- [c1]Kunhe Yang, Yushen Xu:
An Effective Method for Complex Network Community Detection Based on Hierarchical Splitting. ICMAI 2019: 10-14
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-29 22:16 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:
