Multi-Robot Negotiation: Approximating the Set of Subgame Perfect Equilibria in General-Sum Stochastic Games
暂无分享,去创建一个
[1] B. Schölkopf,et al. Multi-Robot Negotiation: Approximating the Set of Subgame Perfect Equilibria in General-Sum Stochastic Games , 2007 .
[2] Ronen I. Brafman,et al. Efficient learning equilibrium , 2004, Artificial Intelligence.
[3] A. Rubinstein. Perfect Equilibrium in a Bargaining Model , 1982 .
[4] David K. Levine. The Castle on the Hill , 2000 .
[5] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[6] Eyal Winter,et al. A characterization of the Nash bargaining solution , 2002, Soc. Choice Welf..
[7] Peter Stone,et al. A polynomial-time nash equilibrium algorithm for repeated games , 2003, EC '03.
[8] Shlomo Zilberstein,et al. Dynamic Programming for Partially Observable Stochastic Games , 2004, AAAI.
[9] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[10] Shai Halevi,et al. A Cryptographic Solution to a Game Theoretic Problem , 2000, CRYPTO.
[11] Vincent Conitzer,et al. Complexity Results about Nash Equilibria , 2002, IJCAI.
[12] P. Dutta. A Folk Theorem for Stochastic Games , 1995 .
[13] Drew Fudenberg,et al. The Folk Theorem in Repeated Games with Discounting or with Incomplete Information , 1986 .