Search Results for author:
Found 2 papers, 0 papers with code
Learning the Expected Core of Strictly Convex Stochastic Cooperative Games
Reward allocation, also known as the credit assignment problem, has been an important topic in economics, engineering, and machine learning.
Double Thompson Sampling in Finite stochastic Games
This algorithm achieves a total regret bound of $\tilde{\mathcal{O}}(D\sqrt{SAT})$in time horizon $T$ with $S$ states, $A$ actions and diameter $D$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
