Zobrazeno 1 - 10
of 366
pro vyhledávání: '"91A43"'
Autor:
Neuman, Eyal, Tuschmann, Sturmius
We study finite-player dynamic stochastic games with heterogeneous interactions and non-Markovian linear-quadratic objective functionals. We derive the Nash equilibrium explicitly by converting the first-order conditions into a coupled system of stoc
Externí odkaz:
http://arxiv.org/abs/2411.05896
We investigate a cheating robot version of Cops and Robber, first introduced by Huggan and Nowakowski, where both the cops and the robber move simultaneously, but the robber is allowed to react to the cops' moves. For conciseness, we refer to this ga
Externí odkaz:
http://arxiv.org/abs/2409.11581
Autor:
Madhavarapu, Tejo V.
The problem of the malicious ma\^{i}tre d' is introduced and solved by Peter Winkler in his book Mathematical Puzzles: A Connoisseur's Collection [1]. This problem is about a ma\^{i}tre d' seating diners around a table, trying to maximize the number
Externí odkaz:
http://arxiv.org/abs/2407.09000
Autor:
McAlister, John S., Fefferman, Nina H.
Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the coordinatio
Externí odkaz:
http://arxiv.org/abs/2406.19273
Autor:
Buchanan, Calum, Carr, MacKenzie, Clifton, Alexander, Hartke, Stephen G., Iršič, Vesna, Sieger, Nicholas, Whitman, Rebecca
We study a two-player game played on undirected graphs called Trail Trap, which is a variant of a game known as Partizan Edge Geography. One player starts by choosing any edge and moving a token from one endpoint to the other; the other player then c
Externí odkaz:
http://arxiv.org/abs/2405.05195
This paper studies many-to-one assignment markets, or matching markets with wages. Although it is well-known that the core of this model is non-empty, the structure of the core has not been fully investigated. To the known dissimilarities with the on
Externí odkaz:
http://arxiv.org/abs/2404.04847
Autor:
Polevoy, Gleb, Michalak, Tomasz
Consider spies infiltrating a network or dissidents secretly organising under a dictatorship. Such scenarios can be cast as adversarial social network analysis problems involving nodes connecting while evading network analysis tools, e.g., centrality
Externí odkaz:
http://arxiv.org/abs/2312.01394
This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players. Starting from a fixed vertex, players take turns to move a token along the edges of
Externí odkaz:
http://arxiv.org/abs/2401.16252
The flow game with public arcs is a cooperative revenue game derived from a flow network. In this game, each player possesses an arc, while certain arcs, known as public arcs, are not owned by any specific player and are accessible to any coalition.
Externí odkaz:
http://arxiv.org/abs/2401.13535
Autor:
Brethouwer, Jan-Tino, Fokkink, Robbert
A Search and Rescue game (SR game) is a new type of game on a graph that has quickly found applications in scheduling, object detection, and adaptive search. In this paper, we broaden the definition of SR games by putting them into the context of ord
Externí odkaz:
http://arxiv.org/abs/2312.06622