#### Filter Results:

- Full text PDF available (113)

#### Publication Year

1989

2017

- This year (6)
- Last 5 years (37)
- Last 10 years (98)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Xiaotie Deng, Christos H. Papadimitriou
- Math. Oper. Res.
- 1994

- Xi Chen, Xiaotie Deng, Shang-Hua Teng
- J. ACM
- 2009

We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class <b>PPAD</b> (Polynomial Parity Argument, Directed version) introduced by Papadimitriou in 1991.
Our result, building upon the work of Daskalakis et al. [2006a] on the complexity of four-player Nash equilibria, settles a long standing… (More)

- Xi Chen, Xiaotie Deng
- 2006 47th Annual IEEE Symposium on Foundations of…
- 2005

Even though many people thought the problem of finding Nash equilibria is hard in general, and it has been proven so for games among three or more players recently, it's not clear whether the two-player case can be shown in the same class of PPAD-complete problems. We prove that the problem of finding a Nash equilibrium in a two-player game is PPAD-complete

We prove that finding a solution of two player Nash Equilibrium is PPAD-complete.

- Haodi Feng, Kang Chen, Xiaotie Deng, Weimin Zheng
- Computational Linguistics
- 2004

We are interested in the problem of word extraction from Chinese text collections. We define a word to be a meaningful string composed of several Chinese characters. For example, , ‘percent’, and , ‘more and more’, are not recognized as traditional Chinese words from the viewpoint of some people. However, in our work, they are words because they are very… (More)

- Guomin Yang, Qiong Huang, Duncan S. Wong, Xiaotie Deng
- IEEE Trans. Wireless Communications
- 2010

- Xiaotie Deng, Pavol Hell, Jing Huang
- SIAM J. Comput.
- 1996

- Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi
- Math. Oper. Res.
- 1999

- Xiaotie Deng, Christos H. Papadimitriou
- Journal of Graph Theory
- 1999

We wish to explore all edges of an unknown directed, strongly connected graph. At each point, we have a map of all nodes and edges we have visited, we can recognize these nodes and edges if we see them again, and we know how many unexplored edges emanate from each node we have visited, but we cannot tell where each leads until we traverse it. We wish to… (More)

- Guomin Yang, Duncan S. Wong, Huaxiong Wang, Xiaotie Deng
- J. Comput. Syst. Sci.
- 2008