Solving strategic bargaining with arbitrary one-sided uncertainty
暂无分享,去创建一个
[1] Yoav Shoham,et al. Simple search methods for finding a Nash equilibrium , 2004, Games Econ. Behav..
[2] David M. Kreps,et al. Sequential Equilibria Author ( s ) : , 1982 .
[3] Tuomas Sandholm,et al. Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).
[4] Drew Fudenberg,et al. Game theory (3. pr.) , 1991 .
[5] Vincent Conitzer,et al. Mixed-Integer Programming Methods for Finding Nash Equilibria , 2005, AAAI.
[6] C. E. Lemke. Some pivot schemes for the linear complementarity problem , 1978 .
[7] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[8] Nicola Gatti,et al. Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm , 2008, Artif. Intell..
[9] A. Rubinstein. Perfect Equilibrium in a Bargaining Model , 1982 .
[10] D. Koller,et al. Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .
[11] R. Selten,et al. A Generalized Nash Solution for Two-Person Bargaining Games with Incomplete Information , 1972 .
[12] Peter Bro Miltersen,et al. Computing sequential equilibria for two-player games , 2006, SODA '06.
[13] Tuomas Sandholm. Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation , 2004, Autonomous Agents and Multi-Agent Systems.