Results 241 to 250 of about 4,555 (277)
Some of the next articles are maybe not open access.
THE PRICE OF ANARCHY FOR RESTRICTED PARALLEL LINKS
Parallel Processing Letters, 2006In 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, no user may improve its own Individual Cost (latency) by unilaterally switching to another link from its set of allowed links ...
Gairing, M. +7 more
openaire +2 more sources
The Impact of Spillback on the Price of Anarchy for Flows Over Time
Algorithmic Game Theory, 2020Flows over time enable a mathematical modeling of traffic that changes as time progresses. In order to evaluate these dynamic flows from a game theoretical perspective we consider the price of anarchy (PoA). In this paper we study the impact of spillback
Jonas Israel, Leon Sering
semanticscholar +1 more source
Prize Collecting Multiagent Orienteering: Price of Anarchy Bounds and Solution Methods
IEEE Transactions on Automation Science and Engineering, 2020We propose and address a new variation of the team orienteering problem (TOP) in which all members of the team are independent self-interested agents. The prize-collecting nature emanates from the fact that the prize available at a node of the traversal ...
Timothy Murray, J. Garg, R. Nagi
semanticscholar +1 more source
The Price of Anarchy of Self-Selection in Tullock Contests
Adaptive Agents and Multi-Agent Systems, 2020Crowdsourcing platforms operate by offering their clients the ability to obtain cost-effective solutions for their problems through contests. The top contestants with the best solutions are rewarded, and the submitted solutions are provided to the ...
Hau Chan, D. Parkes, K. Lakhani
semanticscholar +1 more source
The price of anarchy in parallel queues revisited
ACM SIGMETRICS Performance Evaluation Review, 2010We consider a network of parallel, non-observable queues and analyze the Price of Anarchy (PoA) from the new point of view where the router has the memory of previous dispatching choices. In the regime where the demands grow with the network size, we provide an upper bound on the PoA by means of convex programming.
Anselmi, Jonatha, Gaujal, Bruno
openaire +2 more sources
The price of anarchy for a berth allocation game
Journal of Scheduling, 2023Jiayin Pan, Cong Chen, Yinfeng Xu
semanticscholar +1 more source
The Price of Anarchy in All-Optical Networks
2004In this paper we consider all-optical networks in which a service provider has to satisfy a given set of communication requests. Each request is charged a cost depending on its wavelength and on the wavelengths of the other requests met along its path in the network.
BILO', VITTORIO, MOSCARDELLI L.
openaire +3 more sources
Computing the Price of Anarchy in Atomic Network Congestion Games (Invited Talk)
International Conference on Formal Modeling and Analysis of Timed Systems, 2023Nicolas Markey
semanticscholar +1 more source
The price of Anarchy in series-parallel network congestion games
Mathematical programming, 2022Bainian Hao, Carla Michini
semanticscholar +1 more source
Algorithmic-gradient approach for the Price of Anarchy and Stability for incomplete information
Journal of Computer Science, 2022J. Clempner
semanticscholar +1 more source