Results 21 to 30 of about 166,027,039 (183)
The price of anarchy in Tor latency reduction
Electronics Letters, 2021 The expected cell latency for multi‐hop M/D/1 queueing networks in Wardrop equilibrium is calculated. The load is balanced such that no user can benefit from unilaterally changing its routes.
Dieter Fiems
doaj +1 more source
Network Creation Games with Traceroute-Based Strategies
Algorithms, 2021 Network creation games have been extensively used as mathematical models to capture the key aspects of the decentralized process that leads to the formation of interconnected communication networks by selfish agents.
Davide Bilò +3 more
doaj +1 more source
Minimizing Price of Anarchy in Resource Allocation Games [PDF]
, 2014 Resource allocation refers to problems where there is a set of resources to be allocated efficiently among a group of agents. The distributed nature of resource allocation motivates modeling it as a distributed control problem. One of the strong modeling
Shalaby, Yassmin
core +8 more sources
Price of anarchy of traffic assignment with exponential cost functions
, 2023 The rapid evolution of technology in connected automated and autonomous vehicles offers immense potential for revolutionizing future intelligent traffic control and management.
Dave de Jonge +23 more
core +1 more source
Quantifying the efficiency of price-only contracts in push supply chains over demand distributions of known supports [PDF]
, 2013 In this paper, we quantify the efficiency of price-only contracts in supply chains with demand distributions by imposing prior knowledge only on the support, namely, those distributions with support [a, b] for 0 < a
Xu, Dachuan, Chen, Bo, Du, Donglei
core +1 more source
The Price of Anarchy for Network Formation in an Adversary Model
Games, 2011 We study network formation with n players and link cost α > 0. After the network is built, an adversary randomly deletes one link according to a certain probability distribution. Cost for player ν incorporates the expected number of players to which ν
Lasse Kliemann
doaj +1 more source
On Multidimensional Congestion Games
Algorithms, 2020 We introduce multidimensional congestion games, that is, congestion games whose set of players is partitioned into d+1 clusters C0,C1,…,Cd. Players in C0 have full information about all the other participants in the game, while players in Ci, for any 1≤i≤
Vittorio Bilò +3 more
doaj +1 more source
The Price of Anarchy in Auctions
Journal of Artificial Intelligence Research, 2017 This survey outlines a general and modular theory for proving approximation guarantees for equilibria of auctions in complex settings. This theory complements traditional economic techniques, which generally focus on exact and optimal solutions and are accordingly limited to relatively stylized settings.
Tim Roughgarden +2 more
openaire +4 more sources
Price of Anarchy for Greedy Auctions [PDF]
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010 We consider auctions in which greedy algorithms, paired with first-price or critical-price payment rules, are used to resolve multi-parameter combinatorial allocation problems. We study the price of anarchy for social welfare in such auctions. We show for a variety of equilibrium concepts, including Bayes-Nash equilibrium and correlated equilibrium ...
Brendan Lucier, Allan Borodin
openaire +2 more sources
Improved Price of Anarchy via Predictions [PDF]
Proceedings of the 23rd ACM Conference on Economics and Computation, 2022 A central goal in algorithmic game theory is to analyze the performance of decentralized multiagent systems, like communication and information networks. In the absence of a central planner who can enforce how these systems are utilized, the users can strategically interact with the system, aiming to maximize their own utility, possibly leading to very
Vasilis Gkatzelis +3 more
openaire +3 more sources