An O(n log n) Algorithm for Constrained Network Nash Equilibrium

We present an efficient dual algorithm for solving the constrained Nash equilibrium problem over bipartite networks. This problem models selfish routing on networks. In the case of quadratic payoff functions for each agent, we provide an O(n log n) algorithm, where n is the number of agents in the game. This complexity bound improves known results for this class of problems.

By: D. Towsley, L. Wynter

Published in: RC23828 in 2005


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .