[Lowerbounds, Upperbounds]

Algorithms are everywhere.

Wednesday, October 19, 2005
1:30 pm Posner Hall 151

Dorit Hochbaum
Haas School of Business, Berkeley

What do sport ranking, group decision making, multicriteria decisions, customer segmentation, medical prognosis and assessing bankruptcy risk have in common?

The problems of aggregate ranking or group decision making (or any of the others listed in title) are challenging. We review some known models for the problems and present alternative models. The new models overcome some of the shortcomings of existing models and offer flexibility. Moreover, these models are linked to network flow problems (with convex objective) and to inverse problems. We provide polynomial time algorithms using network flow techniques such as parametric cut and fractional multicommodity linear programming.