| 淡江大學 |
2024-06-07T04:05:24Z |
Nash Equilibria of a Two-Party Policy Competition Game
|
Lin, Chuang-chieh;Lu, Chi-jen;Chen, Po-an |
| 淡江大學 |
2024-05-06 |
How Bad Can An Election Game of Two or More Parties Be?
|
Lin, Chuang-chieh;Lu, Chi-jen;Chen, Po-an |
| 淡江大學 |
2023-06-07 |
Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform
|
Wang, Chi-Hao;Lu, Chi-Jen;Ko, Ming-Tat;Lin, Po-An Chen and Chuang-Chieh |
| 淡江大學 |
2021-10-22 |
Profitable Prediction Market Making
|
Chen, Po-An;Chen, Yiling;Lu, Chi-Jen;Lin, Chuang-Chieh |
| 淡江大學 |
2021-06-06 |
How good is a two-party election game?
|
Lin, Chuang-Chieh;Lu, Chi-Jen;Chen, Po-An |
| 臺大學術典藏 |
2020-05-04T08:04:55Z |
Multiple Text Style Transfer by using Word-level Conditional Generative Adversarial Network with Two-Phase Training.
|
Lai, Chih-Te;Hong, Yi-Te;Chen, Hong-You;Lu, Chi-Jen;Lin, Shou-De; Lai, Chih-Te; Hong, Yi-Te; Chen, Hong-You; Lu, Chi-Jen; Lin, Shou-De; SHOU-DE LIN |
| 臺大學術典藏 |
2020-05-04T08:04:54Z |
Online Linear Optimization with Sparsity Constraints.
|
Wang, Jun-Kun;Lu, Chi-Jen;Lin, Shou-De; Wang, Jun-Kun; Lu, Chi-Jen; Lin, Shou-De; SHOU-DE LIN |
| 臺大學術典藏 |
2020-05-04T07:54:25Z |
On the Parallel Computation of the Algebraic Path Problem.
|
Lu, Chi-Jen; GEN-HUEY CHEN; Wang, Biing-Feng; Chen, Gen-Huey |
| 國立交通大學 |
2019-08-02T02:24:16Z |
Generalized Mirror Descents in Congestion Games with Splittable Flows
|
Chen, Po-An; Lu, Chi-Jen |
| 國立交通大學 |
2019-05-02T00:26:47Z |
Playing Congestion Games with Bandit Feedbacks
|
Chen, Po-An; Lu, Chi-Jen |
| 淡江大學 |
2018-11-14 |
Efficient mechanisms for peer grading and dueling bandits
|
Lin, Chuang-Chieh;Lu, Chi-Jen |
| 國立交通大學 |
2017-04-21T06:56:08Z |
Generalized mirror descents in congestion games
|
Chen, Po-An; Lu, Chi-Jen |
| 國立交通大學 |
2017-04-21T06:55:57Z |
Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games
|
Chen, Po-An; Chen, Yi-Le; Lu, Chi-Jen |
| 國立交通大學 |
2017-04-21T06:48:26Z |
Impossibility results on weakly black-box hardness amplification
|
Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung |
| 國立交通大學 |
2014-12-08T15:42:24Z |
On the complexity of hardness amplification
|
Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung |
| 國立交通大學 |
2014-12-08T15:38:25Z |
Deterministic Extractors for Independent-Symbol Sources
|
Lee, Chia-Jung; Lu, Chi-Jen; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:22:22Z |
Extracting Computational Entropy and Learning Noisy Linear Functions
|
Lee, Chia-Jung; Lu, Chi-Jen; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:20:49Z |
Extracting Computational Entropy and Learning Noisy Linear Functions
|
Lee, Chia-Jung; Lu, Chi-Jen; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:17:49Z |
Deterministic extractors for independent-symbol sources
|
Lee, Chia-Jung; Lu, Chi-Jen; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:14:42Z |
Improved hardness amplification in NP
|
Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung |
| 國立交通大學 |
2014-12-08T15:11:57Z |
Complexity of Hard-Core Set Proofs
|
Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung |
| 國立臺灣大學 |
2012 |
An Online Boosting Algorithm with Theoretical Justifications
|
Chen, Shang-Tse; Lin, Hsuan-Tien; Lu, Chi-Jen |
| 臺大學術典藏 |
2012 |
An Online Boosting Algorithm with Theoretical Justifications
|
Chen, Shang-Tse; Lin, Hsuan-Tien; Lu, Chi-Jen; Chen, Shang-Tse; Lin, Hsuan-Tien; Lu, Chi-Jen |
| 國立高雄第一科技大學 |
2008/07/18 |
論研究發展經費與獲利之關聯性
|
盧啟仁; Lu Chi-Jen |
| 國立高雄應用科技大學 |
2006 |
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives
|
Chang, Yan-Cheng; Hsiao, Chun-Yun; Lu, Chi-Jen |
