Of Mechanism Design Multiagent Planning
暂无分享,去创建一个
[1] Sébastien Konieczny,et al. Extending Classical Planning to the Multi-agent Case: A Game-Theoretic Approach , 2007, ECSQARU.
[2] Paolo Traverso,et al. Automated Planning: Theory & Practice , 2004 .
[3] Thomas Dean,et al. Automated planning , 1996, CSUR.
[4] Malte Helmert,et al. New Complexity Results for Classical Planning Benchmarks , 2006, ICAPS.
[5] Keith S. Decker,et al. Coordinating Mutually Exclusive Resources using GPGP , 2000, Autonomous Agents and Multi-Agent Systems.
[6] Eithan Ephrati,et al. Multi-Agent Planning as Search for a Consensus that Maximizes Social Welfare , 1992, MAAMAW.
[7] Mathijs de Weerdt,et al. Coordination Through Plan Repair , 2005, MICAI.
[8] Noam Nisan,et al. Computationally feasible VCG mechanisms , 2000, EC '00.
[9] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[10] N. Nisan,et al. Algorithmic Game Theory: Combinatorial Auctions , 2007 .
[11] Malte Helmert,et al. Complexity results for standard benchmark domains in planning , 2003, Artif. Intell..
[12] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[13] Paolo Traverso,et al. Automated planning - theory and practice , 2004 .
[14] Malte Helmert,et al. Aproximation Properties of Planning Benchmarks , 2006, ECAI.
[15] Yoav Shoham,et al. Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.
[16] N. Nisan. Introduction to Mechanism Design (for Computer Scientists) , 2007 .
[17] John K. Slaney,et al. Blocks World revisited , 2001, Artif. Intell..
[18] A. Gibbard. Manipulation of Voting Schemes: A General Result , 1973 .