default search action
Yun Kuen Cheung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Haiqing Zhu, Alexander Soen, Yun Kuen Cheung, Lexing Xie:
Online Learning in Betting Markets: Profit versus Prediction. ICML 2024 - [i23]Haiqing Zhu, Alexander Soen, Yun Kuen Cheung, Lexing Xie:
Online Learning in Betting Markets: Profit versus Prediction. CoRR abs/2406.04062 (2024) - 2023
- [c22]Haiqing Zhu, Yun Kuen Cheung, Lexing Xie:
Stability and Efficiency of Personalised Cultural Markets. WWW 2023: 3447-3455 - [i22]Haiqing Zhu, Yun Kuen Cheung, Lexing Xie:
Stability and Efficiency of Personalised Cultural Markets. CoRR abs/2302.06226 (2023) - 2022
- [j4]Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
Fair Division of Indivisible Goods for a Class of Concave Valuations. J. Artif. Intell. Res. 74: 111-142 (2022) - [c21]Yun Kuen Cheung, Georgios Piliouras, Yixin Tao:
The Evolution of Uncertainty of Learning in Games. ICLR 2022 - [c20]Yun Kuen Cheung, Stefanos Leonardos, Shyam Sridhar, Georgios Piliouras:
Market Equilibria and Risk Diversification in Blockchain Mining Economies. MARBLE 2022: 23-46 - [c19]Stefanos Leonardos, Shyam Sridhar, Yun Kuen Cheung, Georgios Piliouras:
Griefing Factors and Evolutionary In-Stabilities in Blockchain Mining Games. MARBLE 2022: 75-94 - 2021
- [j3]Yun Kuen Cheung, Richard Cole, Yixin Tao:
Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup. Math. Program. 190(1): 615-677 (2021) - [j2]Yun Kuen Cheung, Richard J. Cole, Yixin Tao:
Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. SIAM J. Optim. 31(1): 448-460 (2021) - [c18]Yun Kuen Cheung, Yixin Tao:
Chaos of Learning Beyond Zero-sum and Coordination via Game Decompositions. ICLR 2021 - [c17]Yun Kuen Cheung, Georgios Piliouras:
Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence. ICML 2021: 1855-1865 - [c16]Yun Kuen Cheung, Stefanos Leonardos, Georgios Piliouras:
Learning in Markets: Greed Leads to Chaos but Following the Price is Right. IJCAI 2021: 111-117 - [i21]Yun Kuen Cheung, Stefanos Leonardos, Georgios Piliouras:
Learning in Markets: Greed Leads to Chaos but Following the Price is Right. CoRR abs/2103.08529 (2021) - [i20]Yun Kuen Cheung, Georgios Piliouras:
Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence. CoRR abs/2106.04748 (2021) - [i19]Yun Kuen Cheung, Stefanos Leonardos, Georgios Piliouras, Shyam Sridhar:
From Griefing to Stability in Blockchain Mining Economies. CoRR abs/2106.12332 (2021) - 2020
- [j1]Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur:
Tatonnement beyond gross substitutes? Gradient descent to the rescue. Games Econ. Behav. 123: 295-326 (2020) - [c15]Yun Kuen Cheung, Georgios Piliouras:
Chaos, Extremism and Optimism: Volume Analysis of Learning in Games. NeurIPS 2020 - [i18]Yun Kuen Cheung, Georgios Piliouras:
Chaos, Extremism and Optimism: Volume Analysis of Learning in Games. CoRR abs/2005.13996 (2020) - [i17]Yun Kuen Cheung, Yixin Tao:
Chaos of Learning Beyond Zero-sum and Coordination via Game Decompositions. CoRR abs/2008.00540 (2020)
2010 – 2019
- 2019
- [c14]Yun Kuen Cheung, Martin Hoefer, Paresh Nakhe:
Tracing Equilibrium in Dynamic Markets via Distributed Adaptation. AAMAS 2019: 1225-1233 - [c13]Yun Kuen Cheung, Georgios Piliouras:
Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games. COLT 2019: 807-834 - [i16]Yun Kuen Cheung, Georgios Piliouras:
Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games. CoRR abs/1905.08396 (2019) - 2018
- [c12]Yun Kuen Cheung, Richard Cole:
Amortized Analysis of Asynchronous Price Dynamics. ESA 2018: 18:1-18:15 - [c11]Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
On Fair Division for Indivisible Items. FSTTCS 2018: 25:1-25:17 - [c10]L. Sunil Chandran, Yun Kuen Cheung, Davis Issac:
Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition. ICALP 2018: 32:1-32:14 - [c9]Yun Kuen Cheung:
Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games. NeurIPS 2018: 3532-3542 - [c8]Yun Kuen Cheung, Richard Cole, Yixin Tao:
Dynamics of Distributed Updating in Fisher Markets. EC 2018: 351-368 - [c7]Yun Kuen Cheung:
Steiner Point Removal - Distant Terminals Don't (Really) Bother. SODA 2018: 1353-1360 - [i15]L. Sunil Chandran, Yun Kuen Cheung, Davis Issac:
Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition. CoRR abs/1802.07632 (2018) - [i14]Yun Kuen Cheung, Martin Hoefer, Paresh Nakhe:
Tracing Equilibrium in Dynamic Markets via Distributed Adaptation. CoRR abs/1804.08017 (2018) - [i13]Yun Kuen Cheung, Bhaskar Chaudhuri, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
On Fair Division of Indivisible Items. CoRR abs/1805.06232 (2018) - [i12]Yun Kuen Cheung, Richard Cole, Yixin Tao:
Dynamics of Distributed Updating in Fisher Markets. CoRR abs/1806.04746 (2018) - [i11]Yun Kuen Cheung, Richard Cole:
Amortized Analysis of Asynchronous Price Dynamics. CoRR abs/1806.10952 (2018) - [i10]Yun Kuen Cheung, Richard Cole, Yixin Tao:
(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup. CoRR abs/1811.03254 (2018) - [i9]Yun Kuen Cheung, Richard Cole, Yixin Tao:
Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. CoRR abs/1811.05087 (2018) - 2017
- [i8]Yun Kuen Cheung:
Steiner Point Removal - Distant Terminals Don't (Really) Bother. CoRR abs/1703.08790 (2017) - 2016
- [c6]Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger:
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. ICALP 2016: 131:1-131:14 - [c5]Yun Kuen Cheung:
Better Strategyproof Mechanisms without Payments or Prior - An Analytic Approach. IJCAI 2016: 194-200 - [i7]Yun Kuen Cheung:
Better Strategyproof Mechanisms without Payments or Prior - An Analytic Approach. CoRR abs/1604.05243 (2016) - [i6]Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger:
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. CoRR abs/1604.08342 (2016) - [i5]Yun Kuen Cheung, Richard Cole:
A Unified Approach to Analyzing Asynchronous Coordinate Descent and Tatonnement. CoRR abs/1612.09171 (2016) - 2015
- [c4]Yun Kuen Cheung, Monika Henzinger, Martin Hoefer, Martin Starnberger:
Combinatorial Auctions with Conflict-Based Externalities. WINE 2015: 230-243 - [i4]Yun Kuen Cheung, Monika Henzinger, Martin Hoefer, Martin Starnberger:
Combinatorial Auctions with Conflict-Based Externalities. CoRR abs/1509.09147 (2015) - 2014
- [b1]Yun Kuen Cheung:
Analyzing Tatonnement Dynamics in Economic Markets. New York University, USA, 2014 - [i3]Yun Kuen Cheung, Richard Cole:
Amortized Analysis on Asynchronous Gradient Descent. CoRR abs/1412.0159 (2014) - 2013
- [c3]Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur:
Tatonnement beyond gross substitutes?: gradient descent to the rescue. STOC 2013: 191-200 - 2012
- [c2]Yun Kuen Cheung, Richard Cole, Ashish Rastogi:
Tatonnement in ongoing markets of complementary goods. EC 2012: 337-354 - [i2]Yun Kuen Cheung, Richard Cole, Ashish Rastogi:
Tatonnement in Ongoing Markets of Complementary Goods. CoRR abs/1211.2268 (2012) - 2010
- [i1]Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee:
Multidimensional Divide-and-Conquer and Weighted Digital Sums. CoRR abs/1003.0150 (2010)
2000 – 2009
- 2009
- [c1]Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee:
Multidimensional Divide-and-Conquer and Weighted Digital Sums. ANALCO 2009: 58-74
Coauthor Index
aka: Richard J. Cole
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-09-04 01:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint