Searching for "A near-optimal polynomial time algorithm for learning in certain classes of stochastic games." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A Near-Optimal Polynomial Time Algorithm for Learning in Certain Classes of Stochastic Games.
by Ronen I. Brafman, Moshe Tennenholtz — 1999 — Artificial Intelligence
…A Near-Optimal Polynomial Time Algorithm for Learning in Certain Classes of Stochastic Games. Ronen…
Cited by 19 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB