Nekateri kombinatorični problemi: grafi, hipergrafi in pozicijske igre / Some combinatorial problems: graphs, hypergraphs, and positional games
|
Naziv Tittle |
Nekateri kombinatorični problemi: grafi, hipergrafi in pozicijske igre / Some combinatorial problems: graphs, hypergraphs, and positional games |
|
Akronim Acronim |
BI-US/16-17-030 |
|
Opis Description |
(SI) Projekt se bo osredotočil na preplet teorije grafov in teorije iger in naslednje probleme:
Za
študij Nasheve rešljivosti nekaterih vrst stohastičnih iger s popolno informacijo bomo
uporabili bomo kriterij Nasheve rešljivosti iger v klasični obliki v smislu Boolove dualnosti. Cilj teh raziskav je pridobiti nove delne rezultate v zvezi z Delta
domnevo. (EN) The project will focus on the interplay between graph theory and game theory and the following problems: To study the Nash solvability of certain types of stochastic games with complete information, we will use the Nash solvability criterion for games in classical form in the sense of Boolean duality. The aim of these investigations is to obtain new partial results concerning the Delta conjecture. |
|
Trajanje Duration |
01/01/2016 - 31/12/2017 |
|
Vodja projekta Project Leader |
dr. Martin Milanič |
|
Sodelujoče organizacije Participating organizations |
Rutgers University |
|
Oddelek Department |
Oddelek za matematiko IAM |