default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiayang Li 0001
Person information
- affiliation: University of Hong Kong, Department of Data and Systems Engineering, Hong Kong
- affiliation (PhD 2024): Northwestern University, Department of Civil and Environmental Engineering, Evanston, IL, USA
Other persons with the same name
- Jiayang Li (aka: Jia-Yang Li) — disambiguation page
- Jiayang Li 0002
![[0009-0004-3826-5845]](https://dblp.org/img/orcid-mark.12x12.png "0009-0004-3826-5845")
— University College London, UK - Jiayang Li 0003 — Zhejiang University, College of Computer Science and Technology, Hangzhou, China
- Jiayang Li 0004 — Peking University, School of Electronic and Computer Engineering, Beijing, China (and 1 more)
- Jiayang Li 0005 — Macau University of Science and Technology, Macau, China
- Jiayang Li 0006 — University of Electronic Science and Technology of China, Chengdu, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[i8]Liyang Feng, Hanlin Sun, Yu Marco Nie, Jun Xie, Jiayang Li:
Enforcing Priority in Schedule-based User Equilibrium Transit Assignment. CoRR abs/2601.07712 (2026)- 2024
- [j2]Jiayang Li, Zhaoran Wang, Yu Marco Nie:
Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice. Transp. Sci. 58(5): 973-994 (2024) - [j1]Jiayang Li, Qianni Wang, Liyang Feng, Jun Xie, Yu Marco Nie:
A Day-to-Day Dynamical Approach to the Most Likely User Equilibrium Problem. Transp. Sci. 58(6): 1193-1213 (2024) - [i7]Jiayang Li, Qianni Wang, Liyang Feng, Jun Xie, Yu Marco Nie:
A Day-to-Day Dynamical Approach to the Most Likely User Equilibrium Problem. CoRR abs/2401.08013 (2024) - [i6]Lei Guo, Jiayang Li, Yu Marco Nie, Jun Xie:
A Cardinality-Constrained Approach to Combinatorial Bilevel Congestion Pricing. CoRR abs/2412.06482 (2024) - 2023
- [c5]Jiayang Li, Jing Yu, Boyi Liu, Yu Marco Nie, Zhaoran Wang:
Achieving Hierarchy-Free Approximation for Bilevel Programs with Equilibrium Constraints. ICML 2023: 20312-20335 - [i5]Jiayang Li, Jing Yu, Boyi Liu, Zhaoran Wang, Yu Marco Nie:
Achieving Hierarchy-Free Approximation for Bilevel Programs With Equilibrium Constraints. CoRR abs/2302.09734 (2023) - [i4]Jiayang Li, Zhaoran Wang, Yu Marco Nie:
Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice. CoRR abs/2304.02500 (2023) - 2022
- [c4]Siyu Chen, Donglin Yang, Jiayang Li, Senmiao Wang, Zhuoran Yang, Zhaoran Wang:
Adaptive Model Design for Markov Decision Process. ICML 2022: 3679-3700 - [c3]Boyi Liu, Jiayang Li, Zhuoran Yang, Hoi-To Wai, Mingyi Hong, Yu Marco Nie, Zhaoran Wang:
Inducing Equilibria via Incentives: Simultaneous Design-and-Play Ensures Global Convergence. NeurIPS 2022 - [i3]Jiayang Li, Jing Yu, Qianni Wang, Boyi Liu, Zhaoran Wang, Yu Marco Nie:
Differentiable Bilevel Programming for Stackelberg Congestion Games. CoRR abs/2209.07618 (2022) - 2021
- [i2]Boyi Liu, Jiayang Li, Zhuoran Yang, Hoi-To Wai, Mingyi Hong, Yu Marco Nie, Zhaoran Wang:
Inducing Equilibria via Incentives: Simultaneous Design-and-Play Finds Global Optima. CoRR abs/2110.01212 (2021) - 2020
- [c2]Jiayang Li, Jing Yu, Yu Marco Nie, Zhaoran Wang:
End-to-End Learning and Intervention in Games. NeurIPS 2020 - [i1]Jiayang Li, Jing Yu, Yu Marco Nie, Zhaoran Wang:
End-to-End Learning and Intervention in Games. CoRR abs/2010.13834 (2020)
2010 – 2019
- 2018
- [c1]Jiayang Li, Mengkai Shi, Ji Li, Danya Yao:
Media Access Process Modeling of LTE-V-Direct Communication Based on Markov Chain. Intelligent Vehicles Symposium 2018: 61-66
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 2026-03-31 00:30 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:
