22 citations · 35 across the 10 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012
On Online Labeling with Polynomially Many Labels
Martin Babka, Jan Bulánek, Vladimír Čunát +2
In the online labeling problem with parameters n and m we are presented with a sequence of n keys from a totally ordered universe U and must assign each arriving key a label from t…
cs.GT2012
Exact Algorithms for Solving Stochastic Games
Kristoffer Arnsfelt Hansen, Michal Koucky, Niels Lauritzen +2
Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum gam…