Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty
暂无分享,去创建一个
[1] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[2] Robert J. Weber,et al. Distributional Strategies for Games with Incomplete Information , 1985, Math. Oper. Res..
[3] Craig Boutilier,et al. Constraint-Based Optimization with the Minimax Decision Criterion , 2003, CP.
[4] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[5] David C. Parkes,et al. Auction design with costly preference elicitation , 2005, Annals of Mathematics and Artificial Intelligence.
[6] Tuomas Sandholm,et al. Automated Mechanism Design: A New Application Area for Search Algorithms , 2003, CP.
[7] Larry G. Epstein,et al. A Two-Person Dynamic Equilibrium under Ambiguity , 2003 .
[8] Craig Boutilier,et al. Incremental utility elicitation with minimax regret decision criterion , 2003, IJCAI 2003.
[9] David C. Parkes,et al. iBundle: an efficient ascending price bundle auction , 1999, EC '99.
[10] Raimo P. Hämäläinen,et al. Preference ratios in multiattribute evaluation (PRIME)-elicitation and decision procedures under incomplete information , 2001, IEEE Trans. Syst. Man Cybern. Part A.
[11] Noam Nisan,et al. Auctions with severely bounded communication , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[12] Craig Boutilier,et al. Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions , 2004, AAAI.
[13] Moshe Tennenholtz,et al. On Stable Social Laws and Qualitative Equilibria , 1998, Artif. Intell..
[14] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[15] Craig Boutilier,et al. Cooperative Negotiation in Autonomic Systems using Incremental Utility Elicitation , 2002, UAI.
[16] D. J. White,et al. Decision Theory , 2018, Behavioral Finance for Private Banking.
[17] Moshe Tennenholtz,et al. Bundling equilibrium in combinatorial auctions , 2002, Games Econ. Behav..
[18] Ronen I. Brafman,et al. UCP-Networks: A Directed Graphical Representation of Conditional Utilities , 2001, UAI.
[19] I. Gilboa,et al. Maxmin Expected Utility with Non-Unique Prior , 1989 .
[20] Tuomas Sandholm,et al. An alternating offers bargaining model for computationally limited agents , 2002, AAMAS '02.
[21] George Apostolakis,et al. Decision theory , 1986 .
[22] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[23] Tuomas Sandholm,et al. Partial-revelation VCG mechanism for combinatorial auctions , 2002, AAAI/IAAI.