Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"smoothed complexity"”.
-
Smoothed Complexity of Network Coordination Games
… Thus, there is a growing interest in the smoothed complexity of games. That is, the complexity of computing Nash equilibria when the inputs to the problem are confined to look more like real-world inputs. This thesis provides a further analysis of the smoothed complexity of network …
-
Improving the smoothed complexity of flip for max cut problems
… the run-time of FLIP has been studied in the smoothed complexity framework. Etscheid and Roglin [1] showed that the smoothed complexity of FLIP for max-cut in arbitrary graphs is quasi-polynomial. Angel, Bubeck, Peres and Wei [2] showed that the smoothed complexity of FLIP for maxcut in …
-
Search and optimization with randomness in computational economics: equilibria, pricing, and decisions
… into two categories: First, we address the smoothed analysis of Nash equilibrium computation. Second, we address two pricing problems in mechanism design, and solve two economically motivated stochastic optimization problems. Computing Nash equilibria is a central question in the …