Open mechanism design: ensuring and verifying the strategyproofness of mechanisms in open environments
暂无分享,去创建一个
[1] David C. Parkes,et al. Egg: An Extensible and Economics-Inspired Open Grid Computing Platform , 2006 .
[2] David Abramson,et al. A Computational Economy for Grid Computing and its Implementation in the Nimrod-G Resource Brok , 2001, Future Gener. Comput. Syst..
[3] Noam Nisan,et al. Competitive analysis of incentive compatible on-line auctions , 2000, EC '00.
[4] Amin Vahdat,et al. Addressing strategic behavior in a deployed microeconomic resource allocator , 2005, P2PECON '05.
[5] Szilvia Pápai,et al. Groves sealed bid auctions of heterogeneous objects with fair prices , 2003, Soc. Choice Welf..
[6] Miron Livny,et al. Condor and the Grid , 2003 .
[7] David C. Parkes,et al. Practical secrecy-preserving, verifiably correct and trustworthy auctions , 2006, ICEC '06.
[8] Alexander Pfaffinger,et al. Economic-Based Dynamic Load Distribution in Large Workstation Networks , 1996, Euro-Par, Vol. II.
[9] Ryan Porter,et al. Mechanism design for online real-time scheduling , 2004, EC '04.
[10] A. Gibbard. Manipulation of Voting Schemes: A General Result , 1973 .
[11] N. Nisan,et al. Globally distributed computation over the Internet-the POPCORN project , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).
[12] David Abramson,et al. Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..
[13] Tad Hogg,et al. Spawn: A Distributed Computational Economy , 1992, IEEE Trans. Software Eng..
[14] Francine Berman,et al. Overview of the Book: Grid Computing – Making the Global Infrastructure a Reality , 2003 .
[15] Russell Bent,et al. The Value of Consensus in Online Stochastic Scheduling , 2004, ICAPS.
[16] Michael Wooldridge,et al. On the complexity of practical ATL model checking , 2006, AAMAS '06.
[17] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.
[18] Noam Nisan,et al. Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[19] Moni Naor,et al. Privacy preserving auctions and mechanism design , 1999, EC '99.
[20] Yossi Azar,et al. Reducing truth-telling online mechanisms to online optimization , 2003, STOC '03.
[21] Pablo Noriega,et al. Implementing norms in electronic institutions , 2005, AAMAS '05.
[22] Vijay Kumar,et al. Online learning in online auctions , 2003, SODA '03.
[23] David P. Anderson,et al. BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.
[24] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[25] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[26] Michael P. Wellman,et al. Empirical game-theoretic analysis of the TAC Supply Chain game , 2007, AAMAS '07.
[27] Andrew V. Goldberg,et al. Envy-free auctions for digital goods , 2003, EC '03.
[28] Elad Yom-Tov,et al. Improving Resource Matching Through Estimation of Actual Job Requirements , 2006, 2006 15th IEEE International Conference on High Performance Distributed Computing.
[29] Marc Pauly,et al. Programming and Verifying Subgame-Perfect Mechanisms , 2002, J. Log. Comput..
[30] Yoav Shoham,et al. Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.
[31] Ahuva Mu'alem. A Note on Testing Truthfulness , 2005, Electron. Colloquium Comput. Complex..
[32] Aiko M. Hormann,et al. Programs for Machine Learning. Part I , 1962, Inf. Control..
[33] Dana Ron,et al. Testing Monotonicity , 2000, Comb..
[34] David C. Parkes,et al. Specification faithfulness in networks with rational nodes , 2004, PODC '04.
[35] Frank Guerin,et al. Guaranteeing Properties for E-commerce Systems , 2002, AMEC.
[36] L. Walras. Elements of Pure Economics , 1954 .
[37] Donald B. Marron,et al. The use of computer-assisted auctions for allocating tradeable pollution permits , 1996 .
[38] Scott H. Clearwater,et al. Saving energy using market-based control , 1996 .
[39] Michael Wooldridge,et al. Logic for Mechanism Design A Manifesto , 2003 .
[40] Laurent Massoulié,et al. Faithfulness in internet algorithms , 2004, PINS '04.
[41] Bharadwaj Veeravalli,et al. Design and analysis of a dynamic scheduling strategy with resource estimation for large-scale grid systems , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.
[42] S. Clearwater. Market-based control: a paradigm for distributed resource allocation , 1996 .
[43] Gregory F. Cooper,et al. A Bayesian Method for the Induction of Probabilistic Networks from Data , 1992 .
[44] Éva Tardos,et al. Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[45] Rudolf Müller,et al. Dominant Strategy Mechanisms with Multidimensional Types , 2005, Computing and Markets.
[46] David C. Parkes,et al. Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges , 2001, IJCAI.
[47] Rajkumar Buyya,et al. Compute Power Market: towards a market-oriented grid , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.
[48] Munindar P. Singh,et al. Virtual Organizations [Guest Editors' Introduction] , 2008, IEEE Internet Computing.
[49] Francine Berman,et al. Grid Computing: Making the Global Infrastructure a Reality , 2003 .
[50] Amos Fiat,et al. Competitive generalized auctions , 2002, STOC '02.
[51] Andrei Broder,et al. Network Applications of Bloom Filters: A Survey , 2004, Internet Math..
[52] Ian T. Foster,et al. The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..
[53] T. Ishida,et al. An equilibratory market-based approach for distributed resource allocation and its applications to communication network control , 1996 .
[54] Mohammad Taghi Hajiaghayi,et al. Online auctions with re-usable goods , 2005, EC '05.
[55] David P. Anderson,et al. SETI@home-massively distributed computing for SETI , 2001, Comput. Sci. Eng..
[56] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[57] Frank Thomson Leighton,et al. The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[58] Michael E. Saks,et al. Weak monotonicity suffices for truthfulness on convex domains , 2005, EC '05.
[59] Michael Schroeder,et al. Market-based Resource Allocation for Grid Computing: A Model and Simulation , 2003, Middleware Workshops.
[60] Michael J. Pazzani,et al. Searching for Dependencies in Bayesian Classifiers , 1995, AISTATS.
[61] Craig Boutilier,et al. Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.
[62] Rina Dechter,et al. Temporal Constraint Networks , 1989, Artif. Intell..
[63] Joan Feigenbaum,et al. Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.
[64] Noam Nisan,et al. Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.
[65] A. D. Baker. Metaphor or reality: a case study where agents BID with actual costs to schedule a factory , 1996 .
[66] Pat Langley,et al. An Analysis of Bayesian Classifiers , 1992, AAAI.
[67] Michael P. Wellman,et al. Market-oriented programming: some early lessons , 1996 .
[68] S. Bikhchandani,et al. Incentive Compatibility in Multi-unit Auctions , 2003 .
[69] Yoav Shoham,et al. Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.
[70] S. Lauritzen. Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models , 1992 .