An algorithmic game theory framework for bilateral bargaining with uncertainty
暂无分享,去创建一个
[1] A. Rubinstein. Perfect Equilibrium in a Bargaining Model , 1982 .
[2] D. Koller,et al. Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .
[3] Larry Samuelson,et al. Bargaining Under Two-Sided Incomplete Information: The Unrestricted Offers Case , 1988, Oper. Res..
[4] Nicola Gatti,et al. Bargaining over multiple issues in finite horizon alternating-offers protocol , 2006, Annals of Mathematics and Artificial Intelligence.
[5] Yoav Shoham,et al. Simple search methods for finding a Nash equilibrium , 2004, Games Econ. Behav..
[6] Peter Bro Miltersen,et al. Computing sequential equilibria for two-player games , 2006, SODA '06.
[7] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[8] N. R. Jennings,et al. Multi-Issue Negotiation with Deadlines , 2006, J. Artif. Intell. Res..
[9] Nicholas R. Jennings,et al. On Efficient Procedures for Multi-issue Negotiation , 2006, TADA/AMEC.
[10] Gerhard Weiss,et al. Multiagent Systems , 1999 .
[11] Nicola Gatti,et al. Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm , 2008, Artif. Intell..
[12] A. Rubinstein. A BARGAINING MODEL WITH INCOMPLETE INFORMATION ABOUT TIME PREFERENCES , 1985 .