Zobrazeno 1 - 10
of 102 571
pro vyhledávání: '"Maker, P."'
Autor:
Vilkas, Timo
We consider the following combinatorial two-player game: On the random tree arising from a branching process, each round one player (Breaker) deletes an edge and by that removes the descendant and all its progeny, while the other (Maker) fixates an e
Externí odkaz:
http://arxiv.org/abs/2412.08334
The ranking of possible alternatives during the design or operation of an industrial process leads to the definition of a solution representing the best compromise between several contradictory objectives. The choice of solution is a decision that ca
Externí odkaz:
http://arxiv.org/abs/2409.04461
Autor:
Menichinelli, Massimo, Napolitano, Maurizio, D'Elia, Luca, Bianchini, Massimo, D'Ambrosio, Silvia, Lambert, Sandrine
Publikováno v:
Design Journal; Nov2024, Vol. 27 Issue 6, p1229-1251, 23p
Autor:
Tolstikov, Vasily
An automated market maker where the price can cross the zero bound into the negative price domain with applications in electricity, energy, and derivatives markets is presented. A unique feature involves the ability to swap both negatively and positi
Externí odkaz:
http://arxiv.org/abs/2410.13265
Game development is a highly technical practice that traditionally requires programming skills. This serves as a barrier to entry for would-be developers or those hoping to use games as part of their creative expression. While there have been prior g
Externí odkaz:
http://arxiv.org/abs/2410.01096
The Maker-Breaker domination game (MBD game) is a two-player game played on a graph $G$ by Dominator and Staller. They alternately select unplayed vertices of $G$. The goal of Dominator is to form a dominating set with the set of vertices selected by
Externí odkaz:
http://arxiv.org/abs/2408.16297
Autor:
Sowa, Matthias, Srivastav, Anand
Maker-Breaker subgraph games are among the most famous combinatorial games. For given $n,q \in \mathbb{N}$ and a subgraph $C$ of the complete graph $K_n$, the two players, called Maker and Breaker, alternately claim edges of $K_n$. In each round of t
Externí odkaz:
http://arxiv.org/abs/2405.04462
Autor:
Wang, Ruiyu, Zhuang, Zheyu, Jin, Shutong, Ingelhag, Nils, Kragic, Danica, Pokorny, Florian T.
An end-to-end (E2E) visuomotor policy is typically treated as a unified whole, but recent approaches using out-of-domain (OOD) data to pretrain the visual encoder have cleanly separated the visual encoder from the network, with the remainder referred
Externí odkaz:
http://arxiv.org/abs/2409.20248
We study the $(a:b)$ Maker-Breaker subgraph game played on the edges of the complete graph $K_n$ on $n$ vertices, $n,a,b \in \mathbb{N}$ where the goal of Maker is to build a copy of a specific fixed subgraph $H$. In our work this is a spanning graph
Externí odkaz:
http://arxiv.org/abs/2406.11051
As consumer flexibility becomes expected, it is important that the market mechanisms which attain that flexibility are perceived as fair. We set out fairness issues in energy markets today, and propose a market design to address them. Consumption is
Externí odkaz:
http://arxiv.org/abs/2407.20814