Natisni
Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


11 - 20 / 37
Na začetekNa prejšnjo stran1234Na naslednjo stranNa konec
11.
Lovász Hamiltonicity Problem
Klavdija Kutnar, Shao Fei Du, Dragan Marušič, 2019, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: Lovász problem, Hamilton cycle, vertex-transitive graph
Objavljeno v RUP: 06.08.2019; Ogledov: 1643; Prenosov: 87
.pdf Celotno besedilo (19,29 KB)
Gradivo ima več datotek! Več...

12.
13.
Hamiltonicity of vertex-transitive graphs : the pq case I
Dragan Marušič, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: vertex-transitive, graph, Hamilton cycle
Objavljeno v RUP: 23.10.2018; Ogledov: 1297; Prenosov: 24
URL Povezava na celotno besedilo

14.
Hamiltonicity of vertex-transitive graphs : the pq case III
Klavdija Kutnar, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: vertex-transitive, graph, Hamilton cycle
Objavljeno v RUP: 23.10.2018; Ogledov: 1453; Prenosov: 22
URL Povezava na celotno besedilo

15.
16.
A three-person deterministic graphical game without Nash equilibria
Endre Boros, Vladimir Gurvich, Martin Milanič, Vladimir Oudalov, Jernej Vičič, 2018, izvirni znanstveni članek

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: 3319; Prenosov: 173
URL Povezava na celotno besedilo

17.
On reflexible polynomials
Aleksander Malnič, Boštjan Kuzman, Primož Potočnik, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: minimal elementary abelian cover, doubled cycle, polynomial
Objavljeno v RUP: 07.02.2018; Ogledov: 2894; Prenosov: 30
URL Povezava na celotno besedilo

18.
On structural results of tetravalent half-arc-transitive graphs
Primož Šparl, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: graph, half-arc-transitive, alternating cycle, radius
Objavljeno v RUP: 07.02.2018; Ogledov: 2046; Prenosov: 27
URL Povezava na celotno besedilo

19.
20.
Iskanje izvedeno v 0.05 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici