Kuo Chun Tsai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kuo Chun Tsai has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Zhu Han
University of Houston
2 shared publications - Jiefu Chen
Department of Electrical and Computer Engineering University of Houston Houston Texas USA
1 shared publication - Li Wang
Beijing University of Posts and Telecommunications
1 shared publication - Wenyi Hu
Advanced Geophysical Technology Inc., Houston, Texas, USA.
1 shared publication - Xuqing Wu
University of Houston
1 shared publication Zhu Han
1 shared publication
Latest Publications
- Open Access
- 3 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 199682-199695
Achieving Correlated Equilibrium by Studying Opponent’s Behavior Through Policy-Based Deep Reinforcement Learning
Game theory is a very profound study on distributed decision-making behavior and has been extensively developed by many scholars. However, many existing works rely on certain strict assumptions such as knowing the opponent's private behaviors, which might not be practical. In this work, we focused on two Nobel winning concepts, the Nash equilibrium, and the correlated equilibrium. We proposed a policy-based deep reinforcement learning model which instead of just learning the regions for corresponding strategies and actions, it learns why and how the rational opponent plays. With our proposed policy-based deep reinforcement learning model, we successfully reached the correlated equilibrium which maximizes the utility for each player. Depending on the scenario, the equilibrium can reach outside of the Nash equilibrium convex hull to achieve higher utility for the players, while the traditional non-regret algorithms cannot. In addition, we also proposed a mathematical model to inverse the calculation of the correlated equilibrium probability to estimate the rational opponent player's payoff. Through simulations, with limited interaction among the players, we showed that our proposed method can achieve the optimal correlated equilibrium where each player gains an equal or higher utility than the Nash equilibrium.
- 3 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 199682-199695
Open AccessAchieving Correlated Equilibrium by Studying Opponent’s Behavior Through Policy-Based Deep Reinforcement Learning
Game theory is a very profound study on distributed decision-making behavior and has been extensively developed by many scholars. However, many existing works rely on certain strict assumptions such as knowing the opponent's private behaviors, which might not be practical. In this work, we focused on two Nobel winning concepts, the Nash equilibrium, and the correlated equilibrium. We proposed a policy-based deep reinforcement learning model which instead of just learning the regions for corresponding strategies and actions, it learns why and how the rational opponent plays. With our proposed policy-based deep reinforcement learning model, we successfully reached the correlated equilibrium which maximizes the utility for each player. Depending on the scenario, the equilibrium can reach outside of the Nash equilibrium convex hull to achieve higher utility for the players, while the traditional non-regret algorithms cannot. In addition, we also proposed a mathematical model to inverse the calculation of the correlated equilibrium probability to estimate the rational opponent player's payoff. Through simulations, with limited interaction among the players, we showed that our proposed method can achieve the optimal correlated equilibrium where each player gains an equal or higher utility than the Nash equilibrium.
- 23 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 58 (2) , 1380-1391
Automatic First Arrival Picking via Deep Learning With Human Interactive Learning
- 23 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 58 (2) , 1380-1391
Automatic First Arrival Picking via Deep Learning With Human Interactive Learning
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 7 (1) , 193-204
Caching for Mobile Social Networks with Deep Learning: Twitter Analysis for 2016 U.S. Election
As the rise of the portable devices, people usually access the social media such as Twitter and Facebook through wireless networks. Therefore, data transmission rates significant important to the end users. In this work, we discuss the problem of context-aware data caching in the heterogeneous small cell networks to reduce the service delay and how the device-to-device (D2D) and device-to-infrastructure (D2I) improve the system social welfare. In the data-caching model, we explore three types of cache entities, macro cell base stations, small cell base stations, and end user devices. We propose a long short-term memory (LSTM) deep learning model to perform data analysis and extract information content from the data. By knowing the interest of the data to the cache entities, we can cache the data that will most likely to be requested by the end users to reduce service latency. In simulation, we show our proposed algorithm can efficiently reduce the service latency during 2016 U.S. presidential election where mobile user were urgent to request the election information through wireless networks. Comparing with other mechanisms such as using one-to-many matching algorithm or without D2D communication technology, our proposed algorithm improves significantly on the devices performance and system social welfare.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 7 (1) , 193-204
Caching for Mobile Social Networks with Deep Learning: Twitter Analysis for 2016 U.S. Election
As the rise of the portable devices, people usually access the social media such as Twitter and Facebook through wireless networks. Therefore, data transmission rates significant important to the end users. In this work, we discuss the problem of context-aware data caching in the heterogeneous small cell networks to reduce the service delay and how the device-to-device (D2D) and device-to-infrastructure (D2I) improve the system social welfare. In the data-caching model, we explore three types of cache entities, macro cell base stations, small cell base stations, and end user devices. We propose a long short-term memory (LSTM) deep learning model to perform data analysis and extract information content from the data. By knowing the interest of the data to the cache entities, we can cache the data that will most likely to be requested by the end users to reduce service latency. In simulation, we show our proposed algorithm can efficiently reduce the service latency during 2016 U.S. presidential election where mobile user were urgent to request the election information through wireless networks. Comparing with other mechanisms such as using one-to-many matching algorithm or without D2D communication technology, our proposed algorithm improves significantly on the devices performance and system social welfare.