Raghavan T.E.S.

T.E.S. Raghavan

Information about the author T.E.S. Raghavan will soon be added to the site.
Found 9 papers in total
Bargaining sets and the core in permutation games
2003
Permutation games are totally balanced transferable utility cooperative games that...
Computing the nucleolus of cyclic permutation games
2005
The question of allocating costs or benefits among the participants of a joint...
A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
2003
We give a policy-improvement type algorithm to locate an optimal pure stationary...
Computing stationary Nash equilibria of undiscounted single-controller stochastic games
2002
Given a two-person, nonzero-sum stochastic game where the second player controls the...
Assignment games with stable core
2001
We prove that the core of an assignment game (a two-sided matching game with...
Perfect information stochastic games and related classes
1997
For n -person perfect information stochastic games and for n -person stochastic games...
A finite step algorithm via a bimatrix game to a single controller non-zero sum stochastic game
1993
Given a non-zero sum discounted stochastic game with finitely many states and actions...
Existence of stationary correlated equilibria with symmetric information for discounted stochastic games
1992
The following theorem is proved: Every nonzero-sum discounted stochastic game in...
Algorithms for stochastic games-A survey
1991
The authors consider finite state, finite action, stochastic games over an infinite...
Papers per page: