Title:  Computational Issues of Nucleolus 
Speaker: Deng Xiaotie

City U of Hong Kong

Date: Friday Nov 11, 2005
Time 11-12 Venue: Room 3464, HKUST   


Abstract 
Nucleolus has been credited by Aumann and Maschler as the 
solution concept for the Talmud rule in two thousand years 
ago for bankruptcy problems, even though it was formally 
defined by Schmeidler in less than forty years ago. 
We develop algorithmic results for the computation of 
nucleolus. In particular, we find a polynomial time 
algorithm for finding the nucleolus of a flow game, 
thus answering a twenty three years old open problem 
proposed by Kalai and Zemel.