Survivability through market based adaptivity: The MARX project

Proceedings - DARPA Information Survivability Conference and Exposition, DISCEX 2000

Volumn 2, Issue , 2000, Pages 145-156

  Eegleston, J E ^a   Jamin, S ^a   Kelly, T P ^a   MacKie Mason, J K ^a   Walsh, W E ^a   Wellman, P P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RESOURCE ALLOCATION;

ADAPTIVITY; APPLICATION SPECIFIC; DISTRIBUTED SYSTEMS; MICHIGAN; RESOURCE ALLOCATION PROBLEM;

COMMERCE;

EID: 84962299183     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DISCEX.2000.821516     Document Type: Conference Paper

References (39)

1. Anderson, Axel, Ionel Birgean, and Jeffrey K. MacKie-Mason. 1999. Bilateral negotiation with fees. In IBM/IAC Workshop on Internet-Based Negotiation Technology, Yorktown Heights, NY.
2. Brooks, Christopher H., Scott Fay, Rajarshi Das, Jeffrey K. MacKie-Mason, Jeffrey O. Kephart, and Edmund Durfee. 1999. Automated Stategy Seaches in an Electronic Goods Market: Learning and Complex Price Schedules. In ACM Conference on Electronic Commerce, Denver.
3. Campbell, Donald E. 1987. Resource Allocation Mechanisms: Cambridge University Press.
4. Cao, Pei, and Sandy Irani. 1997. Cost-aware WWW proxy caching algorithms. In USENIX Symposium on Internet Technologies and Systems.
5. Chan, Yee Man, Jonathan Womer, Jeffrey K. MacKie-Mason, and Sugih Jamin. 1999. One size doesn't fit all: Improving network QoS through preference-driven Web caching. In Second Berlin Internet Economics Workshop.
6. Dijkstra, Edsger W., and C. S. Scholten. 1980. Termination detection for diffusing computations. Information Processing Letters 11:1-4.
7. Floyd, Sally, and Kevin Fall. 1999. Promoting the use of end-to-end congestion control in the Internet. IEEE Transactions on Networking.
8. Gibbard, Allan. 1973. Manipulation of voting schemes: A general result. Econometrica 41:587-601.
9. Harkavy, Michael, J. D. Tygar, and Hiroaki Kikuchi. 1998. Electronic auctions with private bids. In Third USENIX Workshop on Electronic Commerce, Boston.
10. Irani, Sandy. 1997. Page replacement with multi-size pages and applications to Web caching. In Twenty-Ninth ACM Symposium on the Theory of Computing, El Paso, TX.
11. Kelly, Terence P. 1998. Secure anonymous auctions without trusted parties: University of Michigan.
12. Kelly, Terence P., Yee-Man Chan, Sugih Jamin, and Jeffrey K. MacKie-Mason. 1999. Biased replacement policies for web caches: Differential quality-of-service and aggregate user value. In Fourth International Web Caching Workshop.
13. Kelly, Terence P., Sugih Jamin, and Jeffrey K. MacKie-Mason. 1999. Variable QoS from Shared Web Caches: User-Centered Design and Value-Sensitive Replacement. In MIT/Tufts Workshop on Internet Service Quality Economics, Cambridge, MA.
14. Leland, W. E., M. S. Taqqu, W. Willinger, and D. V. Wilson. 1994. On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE Transactions on Networking 2:1-15.
15. Lynch, Nancy A. 1996. Distributed Algorithms: Morgan Kaufmann.
16. MacKie-Mason, Jeffrey K., and Hal R. Varian. 1994. Generalized Vickrey Auctions: University of Michigan.
17. Mas-Colell, Andreu, Michael D. Whinston, and Jerry R. Green. 1995. Microeconomic Theory: Oxford University Press.
18. Myerson, Roger B., and Mark A. Satterthwaite. 1983. Efficient mechanisms for bilateral trading. Journal of Economic Theory 29:265-281.
19. Naor, Moni, Benny Pinkas, and Reuben Sumner. 1999. Privacy Preserving Auctions and Mechanism Design. In ACM Conference on Electronic Commerce, Denver.
20. O'Malley, Kevin, and Terence Kelly. 1998. An API for Internet auctions. Dr. Dobb's Journal (September):70-74.
21. Rassenti, S. J., V. L. Smith, and R. L. Bulfin. 1982. A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics 13:402-417.
22. Sandholm, Tuomas W., and Victor R. Lesser. 1996. Advantages of a leveled commitment contracting protocol. In Thirteenth National Conference on Artificial Intelligence, Portland, OR.
23. Sleator, Daniel, and Robert Tarjan. 1985. Amortized efficiency of list update and paging rules. Communications of the ACM 28:202-208.
24. Stoica, Ion, Scott Shenker, and Hui Zhang. 1998. Core-stateless fair queueing: A scalable architecture to approximate fair bandwidth allocations in high speed networks. Computer Communication Review 18 (4).
25. Waldspurger, Carl A., and William E. Weihl. 1994. Lottery scheduling: Flexible proportional-share resource management. In Proceedings of the First Symposium on Operating System Design and Implementation (OSDI).
26. Walsh, William E., and Michael P. Wellman. 1998. A market protocol for distributed task allocation. In Third International Conference on Multiagent Systems, July, Paris.
27. Walsh, William E., and Michael P. Wellman. 1999a. Efficiency and equilibrium in task allocation economies with hierarchical dependencies. In Sixteenth International Joint Conference on Artificial Intelligence, Stockholm.
28. Walsh, William E., and Michael P. Wellman. 1999b. Modeling supply chain formation in multiagent systems. In IJCAI-99 Workshop on Agent-Mediated Electronic Commerce, Stockholm.
29. Walsh, William E., Michael P. Wellman, Peter R. Wurman, and Jeffrey K. MacKie-Mason. 1998. Some economics of market-based distributed scheduling. In Eighteenth International Conference on Distributed Computing Systems, May, Amsterdam.
30. Wellman, Michael P. 1996. Market-oriented programming: Some early lessons. In Market-Based Control: A Paradigm for Distributed Resource Allocation, edited by S. Clearwater: World Scientific.
31. Wellman, Michael P., and William E. Walsh. 1999. Distributed quiescence detection in multiagent negotiation. In AAAI-99 Workshop on Negotiation, Orlando, FL.
32. Wellman, Michael P., William E. Walsh, Peter R. Wurman, and Jeffrey K. MacKie-Mason. to appear. Auction protocols for decentralized scheduling. Games and Economic Behavior.
33. Wellman, Michael P., and Peter R. Wurman. 1998a. Market-aware agents for a multiagent world. Robotics and Autonomous Systems 24:115-125.
34. Wellman, Michael P., and Peter R. Wurman. 1998b. Real time issues for Internet auctions. In IEEE Workshop on Dependable and Real-Time E-Commerce Systems, June, Denver, CO.
35. Williams, Stephen, Marc Abrams, Charles R. Standridge, Ghaleb Abdulla, and Edward A. Fox. 1996. Removal policies for World-Wide Web documents. In ACM SIGCOMM.
36. Willinger, W. and Taqqu, M.S. and Sherman, R. and Wilson, D.V. 1995. Self-similarity through high-variability: Statistical analysis of Ethernet LAN traffic at the source level. In ACM SIGCOMM.
37. Wurman, Peter R. 1999. Market Structure and Multidimensional Auction Design for Computational Economies. PhD, Computer Science and Engineering, University of Michigan.
38. Wurman, Peter R., William E. Walsh, and Michael P. Wellman. 1998. Flexible double auctions for electronic commerce: Theory and implementation. Decision Support Systems 24:17-27.
39. Wurman, Peter R., Michael P. Wellman, and William E. Walsh. to appear. A parametrization of the auction design space. Games and Economic Behavior.