Results 1 to 10 of about 621,141 (286)

On Multidimensional Congestion Games [PDF]

open access: yesAlgorithms, 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   +2 more sources

Monotonicity of equilibria in nonatomic congestion games [PDF]

open access: yesEuropean Journal of Operational Research, 2023
This paper studies the monotonicity of equilibrium costs and equilibrium loads in nonatomic congestion games, in response to variations of the demands. The main goal is to identify conditions under which a paradoxical non-monotone behavior can be excluded.
Roberto Cominetti   +2 more
exaly   +6 more sources

Emergent coordination in temporal partitioning congestion games. [PDF]

open access: yesPLoS ONE
In this article we study the social dynamic of temporal partitioning congestion games (TPGs), in which participants must coordinate an optimal time-partitioning for using a limited resource.
Reuven Cohen, Oren Perez
doaj   +2 more sources

Random Order Congestion Games [PDF]

open access: yesMathematics of Operations Research, 2009
We introduce a new class of games called random order congestion games (ROCGs). In an ROCG, each player has a task that can be carried out by any element of a set of resources, and each resource executes its assigned tasks in a random order. The aim of each player is to minimize his expected cost, which is the sum of the fixed costs over the set of ...
Michal Penn   +2 more
exaly   +4 more sources

A Two-Player Resource-Sharing Game with Asymmetric Information

open access: yesGames, 2023
This paper considers a two-player game where each player chooses a resource from a finite collection of options. Each resource brings a random reward. Both players have statistical information regarding the rewards of each resource.
Mevan Wijewardena, Michael J. Neely
doaj   +1 more source

Fighting for Routes: Resource Allocation among Competing Planners in Transportation Networks

open access: yesGames, 2023
In transportation networks, incomplete information is ubiquitous, and users often delegate their route choice to distributed route planners. To model and study these systems, we introduce network control games, consisting of multiple actors seeking to ...
Charlotte Roman, Paolo Turrini
doaj   +1 more source

Asynchronous congestion games [PDF]

open access: yesInternational Joint Conference on Autonomous Agents and Multiagent Systems, 2008
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each resource executes its assigned tasks in a random order. Each player's aim is to minimize his expected cost which is the sum of two terms - the sum of the fixed costs over the ...
Penn, M., Polukarov, M., Tennenholtz, M.
openaire   +2 more sources

A Note on Type-Symmetries in Finite Games

open access: yesMathematics, 2022
In two-action generalized polymatrix games, Nash equilibria are support-type-symmetric, i.e., determined by supports for each type of player. We show that such a property does not generalize straightforwardly for games with at least three actions or ...
Renato Soeiro, Alberto A. Pinto
doaj   +1 more source

Distribution Games: A New Class of Games With Application to User Provided Networks

open access: yesIEEE Access, 2022
User Provided Network (UPN) is a promising solution for sharing the limited network resources by utilizing user capabilities as a part of the communication infrastructure.
Sinan Emre Tasci   +2 more
doaj   +1 more source

Congestion games with failures [PDF]

open access: yesDiscrete Applied Mathematics, 2005
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a CGF agents share a common set of facilities (service providers), where each service provider (SP) may fail with some known probability.
Penn, Michal   +2 more
openaire   +6 more sources

Home - About - Disclaimer - Privacy