Sergey Matsievsky

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we consider a large class of hierarchical congestion population games. One can show that the equilibrium in a game of such type can be described as a minimum point in a properly constructed multi-level convex optimization problem. We propose a fast primal-dual composite gradient method and apply it to the problem, which is dual to the problem(More)
  • 1