|
|||||
|
|
Computing Nash Equilibria for Scheduling on Restricted Parallel Links |
|
| Authors: | Martin Gairing Thomas Lücking Marios Mavronicolas Burkhard Monien |
| Affiliation: | 1. International Computer Science Institute (ICSI), 1947 Center Street, Berkeley, CA, 94704, USA 2. Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany 3. Department of Computer Science, University of Cyprus, P.O. Box 20537, Nicosia, 1678, Cyprus |
| Abstract: | We consider the problem of routing n users on m parallel links under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. So, this problem is equivalent to the correspondingly restricted scheduling problem of assigning n jobs to m parallel machines. In a Nash equilibrium, no user may improve its own Individual Cost (latency) by unilaterally switching to another link from its set of allowed links. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |