Young Kun Ko

According to our database, Young Kun Ko authored at least 6 papers between 2015 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Efficient Linearization Implies the Multiphase Conjecture.

Young Kun Ko

Electron. Colloquium Comput. Complex., 2022

2020

Hardness of Approximate Nearest Neighbor Search under L-infinity.

Young Kun Ko, Min Jae Song

CoRR, 2020

2018

On Symmetric Parallel Repetition : Towards Equivalence of MAX-CUT and UG.

Young Kun Ko

Electron. Colloquium Comput. Complex., 2018

2017

Bounds for the Communication Complexity of Two-Player Approximate Correlated Equilibria.

Young Kun Ko, Ariel Schvartzman

Electron. Colloquium Comput. Complex., 2017

2016

Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games.

Umang Bhaskar, Yu Cheng, Young Kun Ko, Chaitanya Swamy

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015

Near-Optimal Hardness Results for Signaling in Bayesian Games.

Umang Bhaskar, Yu Cheng, Young Kun Ko, Chaitanya Swamy

CoRR, 2015