Price of Anarchy for Highly Congested Routing Games in Parallel Networks
Sign Up to like & getrecommendations! Published in 2017 at "Theory of Computing Systems"
DOI: 10.1007/s00224-017-9834-1
Abstract: We consider nonatomic routing games with one source and one destination connected by multiple parallel edges. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some empirical… read more here.
Keywords: highly congested; congested routing; price anarchy; routing games ... See more keywords
On the Efficiency of All-Pay Mechanisms
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0296-2
Abstract: We study the inefficiency of mixed Nash equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial auctions where m all-pay… read more here.
Keywords: pay; price anarchy; nash equilibria; pay auctions ... See more keywords
Bin packing game with a price of anarchy of $$\frac{3}{2}$$32
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-017-0201-6
Abstract: We consider the bin packing problem in the non-cooperative game setting. In the game there are a set of items with sizes between 0 and 1 and a number of bins each with a capacity… read more here.
Keywords: bin packing; game; packing game; price anarchy ... See more keywords
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