Iterated Regret Minimization: A New Solution Concept
暂无分享,去创建一个
[1] Joseph Y. Halpern,et al. Iterated Regret Minimization: A More Realistic Solution Concept , 2008, ArXiv.
[2] Robert E. Tarjan,et al. A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..
[3] Miodrag Potkonjak,et al. MediaBench: a tool for evaluating and synthesizing multimedia and communications systems , 1997, Proceedings of 30th Annual International Symposium on Microarchitecture.
[4] David M. Kreps,et al. Rational cooperation in the finitely repeated prisoners' dilemma , 1982 .
[5] T. Palfrey,et al. Risk Averse Behavior in Asymmetric Matching Pennies Games , 2000 .
[6] Joseph Y. Halpern,et al. A logical characterization of iterated admissibility , 2009, TARK '09.
[7] Kurt Mehlhorn,et al. Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint , 2000, CP.
[8] Y. Kareev,et al. The Role of Impulses in Shaping Decisions , 2011 .
[9] Jörg Stoye,et al. Axioms for minimax regret choice correspondences , 2011, J. Econ. Theory.
[10] Pascal Van Hentenryck,et al. Constraint Programming in OPL , 1999, PPDP.
[11] H. Keisler,et al. ADMISSIBILITY IN GAMES , 2008 .
[12] Hector J. Levesque,et al. All I Know: A Study in Autoepistemic Logic , 1990, Artif. Intell..
[13] Roy Radner,et al. Minimax-regret strategies for bargaining over several variables , 1989 .
[14] Ludovic Renou,et al. Minimax Regret and Strategic Uncertainty , 2008, J. Econ. Theory.
[15] R. Rosenthal. Games of perfect information, predatory pricing and the chain-store paradox , 1981 .
[16] Kaushik Basu,et al. The traveler's dilemma: Paradoxes of rationality in game theory , 1994 .
[17] R. McKelvey,et al. An experimental study of the centipede game , 1992 .
[18] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[19] Takashi Hayashi. Dynamic choice with anticipated regret , 2008 .
[20] M. Dufwenberg,et al. Price Competition and Market Concentration : An Experimental Study * , 1998 .
[21] Jürg Niehans,et al. Zur Preisbildungen bei ungewissen Erwartungen , 1948 .
[22] R. Aumann,et al. Epistemic Conditions for Nash Equilibrium , 1995 .
[23] R. Selten. Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.
[24] Charles A. Holt,et al. Ten Little Treasures of Game Theory and Ten Intuitive Contradictions , 2001 .
[25] Nagel,et al. Experimental Results on the Centipede Game in Normal Form: An Investigation on Learning. , 1998, Journal of mathematical psychology.
[26] Takashi Hayashi,et al. Regret aversion and opportunity dependence , 2008, J. Econ. Theory.
[27] Toby Walsh,et al. The Difference All-Difference Makes , 1999, IJCAI.
[28] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[29] SATORU KUDOSE. TRAVELER’S DILEMMA , 2007 .
[30] Craig Boutilier,et al. Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty , 2004, UAI.
[31] Jean-Charles Régin,et al. A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.
[32] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[33] T. Becker,et al. Experts Playing the Traveler's Dilemma , 2005 .
[34] Ido Erev,et al. Foregone with the Wind: Indirect Payoff Information and its Implications for Choice , 2006, Int. J. Game Theory.
[35] Eddie Dekel,et al. Lexicographic Probabilities and Choice Under Uncertainty , 1991 .
[36] Willem Jan van Hoeve,et al. The alldifferent Constraint: A Survey , 2001, ArXiv.
[37] Ilya Segal,et al. Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .
[38] Werner Güth,et al. Games of Competition in a Stochastic Environment , 2005 .
[39] Leonard J. Savage,et al. The Theory of Statistical Decision , 1951 .
[40] R. Selten,et al. Learning Direction Theory and the Winner’s Curse , 2005 .
[41] Erkut Y. Ozbay,et al. Auctions with Anticipated Regret: Theory and Experiment , 2007 .
[42] Toby Walsh,et al. CSPLIB: A Benchmark Library for Constraints , 1999, CP.
[43] H. Jerome Keisler,et al. Admissibility in Games1 , 2008 .
[44] W. Rudin. Principles of mathematical analysis , 1964 .
[45] Dimitris Bertsimas,et al. Robust game theory , 2006, Math. Program..
[46] David Pearce. Rationalizable Strategic Behavior and the Problem of Perfection , 1984 .
[47] I. Ritov,et al. Probability of Regret: Anticipation of Uncertainty Resolution in Choice , 1996 .
[48] Colin Camerer,et al. A Cognitive Hierarchy Model of Games , 2004 .
[49] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[50] B. Bernheim. Rationalizable Strategic Behavior , 1984 .
[51] Toby Walsh,et al. Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems , 2000, AAAI/IAAI.
[52] Jean-François Puget,et al. A Fast Algorithm for the Bound Consistency of alldiff Constraints , 1998, AAAI/IAAI.
[53] Charles A. Holt,et al. Anomalous Behavior in a Traveler's Dilemma? , 1999 .
[54] Peter van Beek,et al. Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies , 2001, CP.
[55] D. Monderer,et al. Approximating common knowledge with common beliefs , 1989 .
[56] T. Tan,et al. The Bayesian foundations of solution concepts of games , 1988 .
[57] Peter J. Stuckey,et al. When do bounds and domain propagation lead to the same search space , 2001, PPDP '01.