Mechanisms for information elicitation
暂无分享,去创建一个
[1] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[2] E. Michael Maximilien,et al. Reputation and endorsement for web services , 2001, SECO.
[3] Jeffrey S. Rosenschein,et al. Robust mechanisms for information elicitation , 2006, AAMAS '06.
[4] Moshe Tennenholtz,et al. Overcoming free riding in multi-party computations - The anonymous case , 2006, Games Econ. Behav..
[5] Shafi Goldwasser,et al. Multi party computations: past and present , 1997, PODC '97.
[6] W. Hamilton,et al. The evolution of cooperation. , 1984, Science.
[7] Jonas Holmerin,et al. Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.
[8] Canice Prendergast,et al. A Theory of "Yes Men." , 1993 .
[9] R. Aumann,et al. Epistemic Conditions for Nash Equilibrium , 1995 .
[10] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[11] A. Hendrickson,et al. Proper Scores for Probability Forecasters , 1971 .
[12] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[13] Moshe Tennenholtz,et al. Sequential Information Elicitation in Multi-Agent Systems , 2004, UAI.
[14] Mathukumalli Vidyasagar,et al. A Theory of Learning and Generalization , 1997 .
[15] L. J. Savage. Elicitation of Personal Probabilities and Expectations , 1971 .
[16] Boi Faltings,et al. An incentive compatible reputation mechanism , 2003, EEE International Conference on E-Commerce, 2003. CEC 2003..
[17] R. Wets,et al. Stochastic programming , 1989 .
[18] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[19] P. Bohm,et al. Political Stock Markets and Unreliable Polls , 1999 .
[20] Arkadi Nemirovski,et al. Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..
[21] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[22] Edoardo Amaldi,et al. The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations , 1995, Theor. Comput. Sci..
[23] Paul Resnick,et al. Eliciting Informative Feedback: The Peer-Prediction Method , 2005, Manag. Sci..
[24] Boi Faltings,et al. User-Involved Preference Elicitation , 2003 .
[25] J. Laffont,et al. The Theory of Incentives: The Principal-Agent Model , 2001 .
[26] Vincent Conitzer,et al. Complexity of Mechanism Design , 2002, UAI.
[27] Vincent Conitzer,et al. Complexity of (iterated) dominance , 2005, EC '05.
[28] Craig Boutilier,et al. Partial Revelation Automated Mechanism Design , 2007, AAAI.
[29] E. Maskin,et al. Implementation Theory∗ , 2002 .
[30] Craig Boutilier,et al. Mechanism Design with Partial Revelation , 2007, IJCAI.
[31] Paul Resnick,et al. Reputation systems , 2000, CACM.
[32] Jeffrey S. Rosenschein,et al. Mechanisms for Partial Information Elicitation: The Truth, but Not the Whole Truth , 2006, AAAI.
[33] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[34] A. Raftery,et al. Strictly Proper Scoring Rules, Prediction, and Estimation , 2007 .
[35] Jeffrey O. Kephart,et al. Price and Niche Wars in a Free-Market Economy of Software Agents , 1997, Artificial Life.
[36] R. Aumann. Agreeing to disagree. , 1976, Nature cell biology.
[37] Craig Boutilier,et al. On the Foundations of Expected Expected Utility , 2003, IJCAI.
[38] Bernard Salanié,et al. The Economics of Contracts: A Primer , 1997 .
[39] Mathukumalli Vidyasagar,et al. A Theory of Learning and Generalization: With Applications to Neural Networks and Control Systems , 1997 .
[40] J. Wolfers,et al. Prediction Markets , 2003 .
[41] Boi Faltings,et al. Eliminating Undesired Equilibrium Points from Incentive Compatible Reputation Mechanisms , 2005 .
[42] Krzysztof Z. Gajos,et al. Preference elicitation for interface optimization , 2005, UIST.
[43] Rajarshi Das,et al. Pricing information bundles in a dynamic environment , 2001, EC '01.
[44] D. Samet. Iterated Expectations and Common Priors , 1998 .