Tighter price of anarchy for selfish task allocation on selfish machines
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-020-00556-6
Abstract: Given a set $$L = \{J_1,J_2,\ldots ,J_n\}$$ of n tasks and a set $$M = \{M_1,M_2, \ldots ,M_m\}$$ of m identical machines, in which tasks and machines are possessed by different selfish clients. Each selfish… read more here.
Keywords: task; price anarchy; anarchy selfish; allocation ... See more keywords