Iskanje po repozitoriju

Ključne besede: Cayley isomorphism problem, Cayley graph, CI-group
Objavljeno v RUP: 18.07.2018; Ogledov: 1650; Prenosov: 89
Povezava na celotno besedilo

Ključne besede: vertex-transitive graph, semiregular automorphism, polycirculant conjecture
Objavljeno v RUP: 18.05.2018; Ogledov: 2071; Prenosov: 84
Povezava na celotno besedilo

Ključne besede: odd automorphism, even automorphism, automorphism group, vertex-transitive graph
Objavljeno v RUP: 17.04.2018; Ogledov: 2554; Prenosov: 164
Povezava na celotno 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: 3551; Prenosov: 174
Povezava na celotno besedilo

Ključne besede: bipartite distance-regular graph, Q-polynomial property, isomorphism
Objavljeno v RUP: 12.03.2018; Ogledov: 3346; Prenosov: 80
Povezava na celotno besedilo