T.Mullen and M. P. Wellman, "A simple computational market for network information services, " In Lesser, V., editor, Proceedings of the First International Conference on Multi--Agent Systems, MIT Press, San Francisco, CA, 283--289, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....methodology for computational markets, however, requires an analytical characterization of their properties. In our own MOP work, wehave adopted the framework of general equilibrium theory [19] and have found that our computational markets behave predictably when conditions of the theory are met [23, 37, 39]. We have also applied the approach to discrete optimization problems where the conditions guaranteeing desirable outcomes are not satis ed and have found (not surprisingly) that the methods sometimes work, and other times break down [36, 38] Since scheduling problems very often involve ....

Tracy Mullen and Michael P. Wellman. A simple computational market for network information services. In First International Conference on Multiagent Systems, pages 283-289, San Francisco, CA, 1995.

.... system [13] which exploits user, middleware and resource agents to deliver complex information services, and Retsina which provides a rich infrastructure of user, task and middleware agents for information management activities [17] Mullen and Wellman s Simple Computational Market model [12] aims to tackle the problem of when and where to establish mirror sites for the more popular information services. Competitive agents choose to set up mirrors based on going prices for network bandwidth, computational resources, and the information service. In contrast to this work, however, here ....

Tracy Mullen and Michael Wellman. A simple computational market for network information services. In Proceedings of the First International Conference on Multiagent Systems., pages 283-189, Menlo park, California, 1995. AAAI Press / MIT Press.

....must be addressed, including how to determine the value of resources to participants and how to conduct the auction as a distributed protocol [12] These are some of the questions we address for the specific domain of reliable data replication in this paper. Other distributed computing systems [26, 22, 13, 11] have used market oriented principles (such as auctions) in order to allocate resources. Our work differs from these previous systems in several ways. First, most systems have a concept of money distinct from the resources that are being bought and sold. In our system, there is no concept of ....

....for using auctions to distribute data collections. They assume that there is a common currency, that there is one copy of each collection, and that the performance metric is access time. Some or all of these assumptions are shared by computational economies such as the Blue Skies digital library [22], the Mariposa transaction processing system [11] and Ferguson, Nikolaou and Yemini s replicated data processing economy [13] Our unique application, replication to achieve reliability, means that we can draw from this previous work but must also develop new techniques and policies. 6 ....

T. Mullen and M. Wellman. A simple computational market for network information services. In Proc. Int. Conference on Multi-Agent Systems, June 1995.

....most aggravating reason for this is the centralized design of actual realizations. University of Karlsruhe, Germany. Department of Computing Science, Institute of Telematics. E mail: sonja teco.unikarlsruhe. de While distributed architectures have been realized for pure information systems, e.g. [1], nothing comparable has been proposed for electronic commerce systems, yet. In the next section first of all the limitations of centralized systems are examined in detail. Section 3 analysis requirements for distributed electronic commerce systems. In section 4 a system architecture is derived ....

Tracy Mullen and Michael P. Wellman, "A simple computational market for network information services", in Proceedings of the First International Conference on Multi--Agent Systems, Victor Lesser, Ed., San Francisco, CA, 1995, pp. 283--289, MIT Press.

....related to multiple agents counterspeculating are discussed. 1 Introduction General equilibrium theory, a microeconomic market framework, has recently been successfully adapted for and used in computational multiagent systems in many application domains, see e.g. # Kurose and Simha, 1989; Wellman, 1993; 1994; Mullen and Wellman, 1995; Ygge and Akkermans, 1996; Cheng and Wellman, 1997 # . It provides a distributed method for e#ciently allocating goods and resources among agents. Such a market can havetwotypes of agents, producers and consumers. It has a #nite number of commodities. The ....

....counterspeculating are discussed. 1 Introduction General equilibrium theory, a microeconomic market framework, has recently been successfully adapted for and used in computational multiagent systems in many application domains, see e.g. # Kurose and Simha, 1989; Wellman, 1993; 1994; Mullen and Wellman, 1995; Ygge and Akkermans, 1996; Cheng and Wellman, 1997 # . It provides a distributed method for e#ciently allocating goods and resources among agents. Such a market can havetwotypes of agents, producers and consumers. It has a #nite number of commodities. The amount of each commodity is ....

[Article contains additional citation context not shown here]

Wellman. A simple computational market for network information services. In Proceedings of the First International Conference on Multi-Agent Systems #ICMAS-95#, pages 283#289, San Francisco, CA, June 1995.

....can be solved efficiently and in a distributed fashion by using the computational economy framework and finding its competitive equilibrium: flow problems, allocation of computation time, allocation of computational resources, provision of distributed information services, etc. Mullen and Wellman [40] have broadened Wellman s model in order to solve a problem of information service provision. In this model, a popular information service (of which the 1 For other surveys of DAI, see [23, 15, 62, 39] 2 For introductory books in game theory see, for example, 21, 42, 47] 2 canonical ....

T. Mullen and M. Wellman. A simple computational market for network information services. In Proc. of the First International Conference on Multiagent Systems, pages 283--289, California, USA, 1995.

....generalizes the earlier theory by for example Kurose and Simha, and Bertsekas. Wellman et al. have contributed significantly in developing market based approaches to resource allocation into a programming paradigm, which they have given the name marketoriented programming, e.g. Wellman, 1993; Mullen Wellman, 1995; Wellman, 1995, 1996; Yamaki, Wellman, Ishida, 1996; Hu Wellman, 1996; Cheng Wellman, 1998; Wellman Hu, 1998; Walsh, Wellman, Wurman, MacKie Mason, 1998) Particularly, the microeconomic framework of general equilibrium theory has been successfully used as a resource allocation ....

Mullen, T., & Wellman, M. P. (1995). A simple computational market for network information services. In Lesser, V. (Ed.), Proceedings of the First International Conference on Multi-Agent Systems, ICMAS'95, pp. 283--289 San Francisco, CA.

....NPAs from discovering the high level policies of the organisation. In addition, exception instances and the policy for re negotiating a new contract under physical network failure are mentioned, but are not a specific concern. 2. 10 Agents and Economic Theory for Telecommunications Management As Mullen and Wellman (1995) state, market based price systems constitute one well studied class of mechanisms for allocating resources among distributed decision makers. The exploitation of economic theory, and its intrinsic ability to produce allocations with minimal communication, has probably been the most widely ....

Mullen, T., Wellman, M. P. (1995) `A Simple Computational Market for Network Information Services', Proc. of the First International Conference on Multi-agent Systems (ICMAS-95), San Francisco, CA, USA, June 1995.

....services in a digital library. Most of the literature related to resource allocation for distributed systems have been concerned with allocation of a single item , such as processing time [WaHoHuKeSt92] communication bandwidth [Fe89] access to data [Fe93] or network information services [MuWe95]. Our work is concerned with allocating multiple resources in a single bundle , as this is the type of resource allocation problem arising in the realization of composite services in open environments. In [HaBoDs95] a negotiation architecture is introduced, which allows to return in response to ....

T. Mullen and M.P. Wellman. "A Simple Computational Market for Network Information Services". In Proceedings of the Int'l Conference on Multiagent Systems, June 1995. San Fransisco, 17 CA.

....an equilibrium state. Most of the literature related to resource allocation for distributed systems have been concerned with allocation of a single item , such as processing time [WaHoHuKeSt92] communication bandwidth [FeNiYe89] and access to data [FeNiYe93] or network information services [MuWe95]. On the other hand, our work is concerned with allocating multiple resources in a single bundle , as this is the type of resource allocation problem arising in the realization of composite services in open environments. Service providers are autonomous, resulting in clients having to participate ....

T. Mullen and M.P. Wellman. "A simple computational market for network information services". In Proceedings of the Int'l Conference on Multiagent Systems, June 1995. San Fransisco, CA.

....system are explicitly described using a formal language. Using this facility, it is possible for agents to negotiate about provision of complex services as well as resource allocation. A distinguishing aspect of the UMDL testbed is that resource allocation is handled using a market metaphor [39]. An intriguing aspect of interoperability is that, as pointed out in [45] comparing solutions is very difficult since different approaches operate under differing assumptions, and their design goals may be conflicting. Currently there are no quantitative metrics for evaluating interoperability ....

T. Mullen and M.P. Wellman. A simple computational market for network information services. In Proc. 1st International Conference on Multiagent Systems, June 1995. San Fransisco, CA.

....In addition, the formation of coalitions is not addressed there. The theoretic model underlying market oriented programming is more suitable for large scale systems of agents, although under some restriction may provide good results even for small number of agents, as proved by simulations in [34]. A Market oriented approach was also utilized for task allocation, as presented in [56] There, Walsh and Wellman present a simple auctioning protocol for the pricing and allocation of tasks among self interested agents. In contrast, we address the case of cooperative agents. As a result, while ....

T. Mullen and M. Wellman. A simple computational market for network information services. In Proc. of the First International Conference on Multiagent Systems, pages 283--289, California, USA, 1995.

....planning and execution 3 . And, as stated previously, while several models prove to work successfully for systems that consist of few agents (usually less than 20) e.g. 16,17] their computational complexity would prohibit scaling up. Even when the model is based on market equilibrium, as in [39], simulations are limited to less than 20 agents. In contrast, we present a theoretical justification to the ability of our model to scale up. Moreover, we further support these claims by simulations results that consist of thousands of agents and tasks. These results show no increase in ....

T. Mullen and M. Wellman. A simple computational market for network information services. In Proc. of the First International Conference on Multiagent Systems, pages 283--289, California, USA, 1995.

....technique for walras that is potentially distributable. The algorithm is described in some detail in [4] along with proofs of its convergence. Wellman has studied applicability of market programming to multicommodity flow [41] configuration design [42] and location of servers in a network [28]. Appendix B: A General Equilibrium Formulation A simple economic model for general equilibrium analysis is given as an illustration for understanding the conditions for existence of equilibria in such models. The formulation is essentially that given by Shoven Whalley [32] We assume the ....

T. Mullen and M.P. Wellman. A simple computational market for network information services. In First International Conference on Multiagent Systems, June 1995.

....agents counterspeculating are discussed. 1 Introduction General equilibrium theory, a microeconomic market framework, has recently been successfully adapted for and used in computational multiagent systems in many application domains, see e.g. Kurose and Simha, 1989; Wellman, 1993; 1994; Mullen and Wellman, 1995; Ygge and Akkermans, 1996; Cheng and Wellman, 1997 ] It provides a distributed method for efficiently allocating goods and resources among agents. Such a market can have two types of agents, producers and consumers. It has a finite number of commodities. The amount of each commodity is ....

....discusses how the latter application fails to meet the assumptions for existence of a general equilibrium. For example, because some design parameters are discrete, production possibilities sets cannot be convex. Mullen and Wellman have applied Walras to a distributed information network example [ Mullen and Wellman, 1995 ] The iterative market process of Wal 1 If agents act competitively (as opposed to strategically via speculation) each general equilibrium is Pareto efficient: no agent can be made better off with any methodology for making decisions without making some other agent worse off. Such ....

Tracy Mullen and Michael P Wellman. A simple computational market for network information services. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS-95), pages 283--289, San Francisco, CA, June 1995.

No context found.

T.Mullen and M. P. Wellman, "A simple computational market for network information services, " In Lesser, V., editor, Proceedings of the First International Conference on Multi--Agent Systems, MIT Press, San Francisco, CA, 283--289, 1998.

No context found.

T Mullen and M.P. Wellman, "A Simple Computational Market for Network Information Services," Prat. First Int7 Conf. Mukiagent Systems, AmeL Assn. Artificial Intelligence Press, Menlo Park, Calif., 1995, pp. 283-289.

....methodology for computational markets, however, requires an analytical characterization of their properties. In our own MOP work, we have adopted the framework of general equilibrium theory [20] and have found that our computational markets behave predictably when conditions of the theory are met [24, 39, 41]. We have also applied the approach to discrete optimization problems where the conditions guaranteeing desirable outcomes are not satisfied and have found (not surprisingly) that the methods sometimes work, and other times break down [38, 40] Since scheduling problems very often involve ....

Tracy Mullen and Michael P. Wellman. A simple computational market for network information services. In First International Conference on Multiagent Systems, pages 283--289, San Francisco, CA, 1995.

....methodology for computational markets, however, requires an analytical characterization of their properties. In our own MOP work, we have adopted the framework of general equilibrium theory [21] and have found that our computational markets behave predictably when conditions of the theory are met [25, 40, 42]. We have also applied the approach to discrete optimization problems where the conditions guaranteeing desirable outcomes are not satisfied and have found (not surprisingly) that the methods sometimes work, and other times break down [39, 41] Since scheduling problems very often involve ....

Tracy Mullen and Michael P. Wellman. A simple computational market for network information services. In First International Conference on Multiagent Systems, pages 283--289, San Francisco, CA, 1995.

....methodology for computational markets, however, requires an analytical characterization of their properties. In our own MOP work, we have adopted the framework of general equilibrium theory [21] and have found that our computational markets behave predictably when conditions of the theory are met [25, 39, 41]. We have also applied the approach to discrete optimization problems where the conditions guaranteeing desirable outcomes are not satisfied and have found (not surprisingly) that the methods sometimes work, and other times break down [38, 40] Since scheduling problems very often involve ....

Tracy Mullen and Michael P. Wellman. A simple computational market for network information services. In First International Conference on Multiagent Systems, pages 283--289, San Francisco, CA, 1995.

....methodology for computational markets, however, requires an analytical characterization of their properties. In our own MOP work, we have adopted the framework of general equilibrium theory [21] and have found that our computational markets behave predictably when conditions of the theory are met [25, 39, 41]. We have also applied the approach to discrete optimization problems where the conditions guaranteeing desirable outcomes are not satisfied and have found (not surprisingly) that the methods sometimes work, and other times break down [38, 40] Since scheduling problems very often involve ....

Tracy Mullen and Michael P. Wellman. A simple computational market for network information services. In First International Conference on Multiagent Systems, pages 283--289, San Francisco, CA, 1995.

....methodology for computational markets, however, requires an analytical characterization of their properties. In our own MOP work, we have adopted the framework of general equilibrium theory [18] and have found that our computational markets behave predictably when conditions of the theory are met [22, 37, 39]. We have also applied the approach to discrete optimization problems where the conditions guaranteeing desirable outcomes are not satisfied and have found (not surprisingly) that the methods sometimes work, and other times break down [36, 38] Since scheduling problems very often involve ....

Tracy Mullen and Michael P. Wellman. A simple computational market for network information services. In First International Conference on Multiagent Systems, pages 283--289, San Francisco, CA, 1995.

No context found.

T. M. . M. Wellman. A simple computational market for network information services. Proceedings of the First International Conference on Multiagent systems, pages 283-289, 1995.

No context found.

T. Mullen and M. Wellman. A simple computational market for network information services. In Proc. Int. Conference on Multi-Agent Systems, June 1995.

No context found.

Mullen, T., Wellman, M. P. 1995. A Simple Computational Market for Network Information Services. First International Conference on Multiagent Systems, June 1995. http://ai.eecs.umich.edu/people/mullen/papers.html.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC