| Summary |
The research pursued in this project is about (network) optimization problems in the presence of strategic behavior and data uncertainties. The goal is to study the complexity of finding Nash equilibria, analyze the inefficiency of equilibria and to develop efficient mechanisms to reduce the inefficiency. A particular focus will be put on the incorporation of data uncertainties (such as probabilistic link failures, random delays, uncertain demands, etc.) into game-theoretical models and on the development of efficient algorithms to hedge against these uncertainties. |
