Iskanje po repozitoriju

Ključne besede: non-realizable degree sequences, dual graphs, surfaces
Objavljeno v RUP: 02.10.2020; Ogledov: 726; Prenosov: 33
Povezava na polno besedilo

Ključne besede: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Objavljeno v RUP: 20.08.2019; Ogledov: 1535; Prenosov: 151
Povezava na polno besedilo

Ključne besede: Moore's Nim, Exact Nim, impartial games, P-position, Sprague-Grundy function
Objavljeno v RUP: 22.05.2019; Ogledov: 1299; Prenosov: 120
Povezava na polno besedilo

Opis: We give an example of a three-person deterministic graphical game that has no Nash equilibrium in pure stationary strategies. The game has seven positions, four outcomes (a unique cycle and three terminal positions), and its normal form is of size only. Thus, the example strengthens significantly the one obtained in 2014 by Gurvich and Oudalov; the latter has four players, five terminals, and normal form of size . Furthermore, our example is minimal with respect to the number of players. Somewhat similar examples were known since 1975, but they were not related to deterministic graphical games. The small size of our example allows us to verify that it has no Nash equilibrium not only in pure but also in independently mixed (so-called behavioral) strategies. For independently mixed strategies two distinct effective payoffs can be considered: along with the classical Markovian evaluation, we also consider a priori evaluation, which may be a better fit for playing in behavioral strategies
Ključne besede: deterministic graphical multi-person game, perfect information, Nash equilibrium, directed cycle, terminal position, pure stationary strategy
Objavljeno v RUP: 30.03.2018; Ogledov: 2859; Prenosov: 168
Povezava na polno besedilo