International Conference on Complementarity Problems 2005; Stanford University, CA; August 9-12, 2005

Stanford University, Stanford CA

Investigators

Abstract

The growth in computing and algorithms for game theory has led to new directions for complementarity problems. In addition, new applications in dynamic traffic assignment, electricity market design, supply chain modeling, and others have attracted researchers from a variety of other disciplines to study this class of problems. Extensions of complementarity problems to allow for data uncertainty are also emerging. This international conference is an attempt to bring together researchers from these disparate fields to one venue where the interface can be explored in depth. NSF support of this project is primarily provided to support graduate students, post-doctoral scientists, and other junior researchers to attend the conference