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


1 - 7 / 7
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Vector connectivity in graphs
Ferdinando Cicalese, Martin Milanič, Pinar Heggernes, Endre Boros, Pim Van 't Hof, Romeo Rizzi, 2014, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: osebi
Ključne besede: vektorska povezanost, aproksimacijski algoritmi, polinomski algoritmi, NP-poln problem, razcepljeni grafi, kografi, drevesa, vector connectivity, approximation algorithms, poynomial time algorithms, NP-hard problem, split graphs, cographs, trees
Objavljeno: 15.10.2015; Ogledov: 1313; Prenosov: 96
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

2.
Equistarable bipartite graphs
Martin Milanič, Endre Boros, Nina Chiarelli, 2015, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: equistable graph, general partition graph, bipartite graph, equistarable graph, 2-extendable graph
Objavljeno: 03.04.2017; Ogledov: 838; Prenosov: 93
URL Polno besedilo (0,00 KB)

3.
1-Sperner hypergraphs and new characterizations of threshold graphs
Endre Boros, Vladimir Gurvich, Martin Milanič, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: osebi
Ključne besede: 1-Sperner hypergraph, threshold hypergraph, threshold graph
Objavljeno: 08.08.2016; Ogledov: 1003; Prenosov: 3
URL Polno besedilo (0,00 KB)

4.
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
Najdeno v: osebi
Ključne besede: deterministic graphical multi-person game, perfect information, Nash equilibrium, directed cycle, terminal position, pure stationary strategy
Objavljeno: 30.03.2018; Ogledov: 1297; Prenosov: 93
URL Polno besedilo (0,00 KB)

5.
6.
On the Sprague-Grundy function of Exact k-Nim
Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Muršič, 2018, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: Moore's Nim, Exact Nim, impartial games, P-position, Sprague-Grundy function
Objavljeno: 22.05.2019; Ogledov: 232; Prenosov: 79
URL Polno besedilo (0,00 KB)

7.
Decomposing 1-Sperner hypergraphs
Endre Boros, Vladimir Gurvich, Martin Milanič, 2019, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: hypergraph, 1-Sperner hypergraph, threshold hypergraph, decomposition
Objavljeno: 26.07.2019; Ogledov: 130; Prenosov: 9
URL Polno besedilo (0,00 KB)

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