Search
Now showing items 861-870 of 976
Computing Nash equilibria for scheduling on restricted parallel links
(2010)
We consider the problem of routing nusers 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 ...
Nash equilibria in discrete routing games with convex latency functions
(2004)
We study Nash equilibria in a discrete routing game that combines features of the two most famous models for non-cooperative routing, the KP model [16] and the Wardrop model [27]. In our model, users share parallel links. ...
The price of anarchy for polynomial social cost
(2006)
In this work, we consider an interesting variant of the well studied KP model for selfish routing on parallel links, which reflects some influence from the much older Wardrop model [J.G. Wardrop, Some theoretical aspects ...
Understanding the barriers to virtual student placements in the Semester of Code
(2016)
The Semester of Code initiative organised virtual placements for university students around Europe, working on authentic business problems using open source software. The project was welcomed by stakeholders, and many ...
The Price of Anarchy for restricted parallel links
(2006)
In the model of restricted parallel links, n users must be routed on m parallel links under the restriction that the link for each user be chosen from a certain set of allowed links for the user. In a (pure) Nash equilibrium, ...
The price of anarchy for polynomial social cost
(2004)
In this work, we consider an interesting variant of the well-studied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [31]. In the new model, user traffics are still unsplittable, ...
A comprehensive solution for application-level adaptation
(2009)
Driven by the emergence of mobile and pervasive computing there is a growing demand for contextaware software systems that can dynamically adapt to their run-time environment. We present the results of project MADAM that ...
Structure and complexity of extreme Nash equilibria
(2005)
We study extreme Nash equilibria in the context of a selfish routing game. Specifically, we assume a collection of n users, each employing a mixed strategy, which is a probability distribution over m parallel identical ...