Share This Author
Settling the complexity of computing two-player Nash equilibria
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) introduced by…
On the Complexity of Cooperative Solution Concepts
The von Neumann-Morgenstern solution is pointed out that its existence may not even be decidable, and many of these results generalize to the case in which the game is presented by a hypergraph with edges of size k > 2.
Settling the Complexity of Two-Player Nash Equilibrium
It is proved that the problem of finding a Nash equilibrium in a two-player game is PPAD-complete.
Universal authentication protocols for anonymous wireless communications
- Guomin Yang, Qiong Huang, D. Wong, Xiaotie Deng
- Computer ScienceIEEE Transactions on Wireless Communications
Two protocols are proposed: one provides better efficiency and supports user anonymity to an extent comparable to that provided by current mobile systems; and the other one achieves strong user anonymity that protects U's identity against both eavesdroppers and foreign servers and is currently the strongest notion of user anonymity defined for secure roaming.
Algorithmic Aspects of the Core of Combinatorial Optimization Games
The computational complexity and algorithms of the core are studied to answer important questions about the cores of various games on graphs, such as maximum flow, connectivity, maximum matching, minimum vertex cover, minimum edge cover, maximum independent set, and minimum coloring.
Exploring an unknown graph
- Xiaotie Deng, C. Papadimitriou
- Computer Science, MathematicsProceedings  31st Annual Symposium on…
- 22 October 1990
The main result is an algorithm that achieves a bounded ratio when the deficiency is bounded; unfortunately the ratio is exponential in the deficiency.
Accessor Variety Criteria for Chinese Word Extraction
This work defines a word to be a meaningful string composed of several Chinese characters, considers the number of distinct predecessors and successors of a string in a large corpus (TREC 5 and TREC 6 documents), and uses them as the measurement of the context independency of astring from the rest of the sentences in the document.
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
A linear-time algorithm to recognize and represent proper circular-arc graphs and obtain a new proof of a characterization of proper interval graphs by forbidden subgraphs.
Detecting Phishing Web Pages with Visual Similarity Assessment Based on Earth Mover's Distance (EMD)
- Anthony Y. Fu, Wenyin Liu, Xiaotie Deng
- Computer ScienceIEEE Transactions on Dependable and Secure…
- 1 October 2006
An effective approach to phishing Web page detection is proposed, which uses Earth mover's distance (EMD) to measure Web page visual similarity and train an EMD threshold vector for classifying a Web page as a phishing or a normal one.