Zobrazeno 1 - 10
of 19
pro vyhledávání: '"YUN KUEN CHEUNG"'
Publikováno v:
Mathematical Research for Blockchain Economy ISBN: 9783031186783
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6822c3ebbb570afe82b8e62a8916df34
https://doi.org/10.1007/978-3-031-18679-0_5
https://doi.org/10.1007/978-3-031-18679-0_5
Publikováno v:
Mathematical Research for Blockchain Economy ISBN: 9783031186783
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfbc16b76053ea8010b85ddaae5a089e
https://doi.org/10.1007/978-3-031-18679-0_2
https://doi.org/10.1007/978-3-031-18679-0_2
This work is concerned with the dynamics of online cultural markets, namely, attention allocation of many users on a set of digital goods with infinite supply. Such dynamic is important in shaping processes and outcomes in society, from trending item
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3235d7bb6d7c1b5850b3e2cb42b3398e
Publikováno v:
IJCAI
We study learning dynamics in distributed production economies such as blockchain mining, peer-to-peer file sharing and crowdsourcing. These economies can be modelled as multi-product Cournot competitions or all-pay auctions (Tullock contests) when i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1ed17b5a5bc11ddc5910b7e9133a14c
Autor:
Chaudhury, Bhaskar Ray, Yun Kuen Cheung, Garg, Jugal, Garg, Naveen, Hoefer, Martin, Mehlhorn, Kurt
Publikováno v:
Journal of Artificial Intelligence Research; 2022, Vol. 74, p111-142, 32p
We seek tight bounds on the viable parallelism in asynchronous implementations of coordinate descent that achieves linear speedup. We focus on asynchronous coordinate descent (ACD) algorithms on convex functions which consist of the sum of a smooth c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f209fdc6bae5a751f703bafa089763d
http://arxiv.org/abs/1811.03254
http://arxiv.org/abs/1811.03254
Publikováno v:
EC
A major goal in Algorithmic Game Theory is to justify equilibrium concepts from an algorithmic and complexity perspective. One appealing approach is to identify natural distributed algorithms that converge quickly to an equilibrium. This paper establ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1cdf84776be3fa68b631e805e4579f2
https://doi.org/10.1145/3219166.3219189
https://doi.org/10.1145/3219166.3219189
Autor:
YUN KUEN CHEUNG1 yunkuen.cheung@rhul.ac.uk, COLE, RICHARD J.2 cole@cs.nyu.edu, YIXIN TAO2 yt851@nyu.edu
Publikováno v:
SIAM Journal on Optimization. 2021, Vol. 31 Issue 1, p448-460. 13p.
Autor:
Yun Kuen Cheung
Publikováno v:
SODA
Given a weighted graph G = (V, E, w) with a set of k terminals T ⊂ V, the Steiner Point Removal problem seeks for a minor of the graph with vertex set T, such that the distance between every pair of terminals is preserved within a small multiplicat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::073fde51309c86f9fd26ea099521948b
https://doi.org/10.1137/1.9781611975031.89
https://doi.org/10.1137/1.9781611975031.89
Publikováno v:
Web and Internet Economics
Lecture Notes in Computer Science
Web and Internet Economics ISBN: 9783662489949
WINE
Lecture Notes in Computer Science
Web and Internet Economics ISBN: 9783662489949
WINE
Combinatorial auctions (CA) are a well-studied area in algorithmic mechanism design. However, contrary to the standard model, empirical studies suggest that a bidder's valuation often does not depend solely on the goods assigned to him. For instance,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30ff185cdd3c90f413d587728515e8c2