Peter R. Wurman, Michael P. Wellman, and William E. Walsh. The Michigan Internet AuctionBot: A con gurable auction server for human and software agents. In Proceedings of the Second International Conference on Autonomous Agents, pages 301-308, 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....toward an exchange format. These trends have led to an increasing need for fast market clearing algorithms for exchanges. Such algorithms have been studied in the o ine (batch) context [19, 20, 23, 21] Also, recent electronic commerce server prototypes such as eMediator [18] and AuctionBot [22] have demonstrated a wide variety of new market designs, leading to the need for new clearing algorithms. In this paper we study the ubiquitous setting where there is a market for one commodity, for example, DELL stocks, bonds, pork bellies, electricity, memory chips, or CPU time. For simplicity, ....

Peter R Wurman, Michael P Wellman, and William E Walsh. The Michigan Internet AuctionBot: A con gurable auction server for human and software agents. In Proceedings of the Second International Conference on Autonomous Agents (AGENTS), pages 301-308, Minneapolis/St. Paul, MN, May 1998.

....the Chicago Mercantile Exchange has deployed the Globex system, which supports trading around the clock. Some auction researchers have investigated the related theoretical issues; they have viewed exchanges as a variety of auction markets, called continuous double auctions. In particular, Wurman et al. 1998a] proposed a theory of exchange markets and implemented a general purpose system for auctions and exchanges, which processed traditional fully speci ed orders. Sandholm and Suri [2000] developed an exchange for combinatorial orders, but it could not support markets with more than 1,000 orders. ....

....of integrating multiple auctions across a supply chain, and proposed a mechanism for sharing information among such auctions. Wurman and Wellman built a general purpose system, called the Michigan Internet AuctionBot, that could run a variety of di erent auctions [ Wellman, 1993; Wellman and Wurman, 1998; Wurman et al. 1998b; Wurman and Wellman, 1999 ] however, they restricted the users to simple fully speci ed bids. Their system included scheduler and auctioneer procedures, related databases, and advanced interfaces. Hu et al. 1999] created agents for bidding in the Michigan AuctionBot; ....

[Article contains additional citation context not shown here]

Peter R. Wurman, Michael P. Wellman, and William E. Walsh. The Michigan Internet AuctionBot: A con gurable auction server for human and software agents. In Proceedings of the Second International Conference on Autonomous Agents, pages 301-308, 1998.

.... In the domain of e commerce, for example, it is estimated that there are currently more than 2; 000 auction sites on the Internet (http: www.internetauctionlist.com) situations, to the entities that value them most highly [6] While there are many di erent types of auction [7], the most common forms are the simple single sided varieties (e.g. English, rst price ascending; Dutch, rst price descending; First Price Sealed Bid and Vickrey, second price sealed bid) in which there is a single seller and multiple buyers or a single buyer and multiple sellers (a reverse ....

P. Wurman, M. Wellman, and W. Walsh, \The Michigan Internet Auctionbot: a con gurable auction sever for human and software agents," in Proceedings of the Second International Conference on Autonomous Agents, 1998, pp. 301-308.

....in the AI community on search algorithms [Sandholm1999, Fujishima et al..1999, Sandholm and Suri2000] and special case polynomial algorithms [Tennenholtz2000] for clearing combinatorial auctions. Third, recent electronic commerce server prototypes such as eMediator [Sandholm2000] and AuctionBot [Wurman et al..1998] from academic AI This work was funded by, and conducted at, CombineNet, Inc. 311 S. Craig St. Pittsburgh, PA 15213. 1 groups have led to the uncovering of a need for fast clearing algorithms for a vast space of market designs. In this paper we analyze the inherent complexity of, and design ....

Peter R Wurman, Michael P Wellman, and William E Walsh. The Michigan Internet AuctionBot: A congurable auction server for human and software agents. In AGENTS, pages 301-308. 16

....with (very) large numbers of agents. One aspect of current research on multi agent systems is that a large system is deemed to consist of hundreds of agents, maybe a thousand, but not millions. The claim that Auctionbot is scalable, for example, is supported by an experiment with only 90 agents [39]. Larger numbers of agents require scalable development frameworks and support environments. The term scalability is not always used to refer to architecture, services and performance. In some cases it is used to refer to scalable functionality. For example, the SAIRE approach [23] claims to be ....

P. R. Wurman, M. P. Wellman, and W. E. Walsh. \The Michigan Internet AuctionBot: A congurable auction server for human and software agents." In K. P. Sycara and M. Wooldridge, (eds.), Proc. Proceedings of the 2nd International Conference on Autonomous Agents (Agents'98), pp. 301-308, New York, 9-13, 1998. ACM Press.

....2 The Problem of Scalability In the multi agent system community, large multi agent systems are considered to consist of hundreds of agents, not thousands nor millions. As an example, consider the claim that Auctionbot is scalable, which is supported by an experiment with only 90 agents [33]. In the near future, however, we expect that multi agent systems will need to be able to scale (in terms of the number of agents and available resources) to much larger populations. This almost immediately without noticeable loss of performance, or considerable increase in administrative ....

P. R. Wurman, M. P. Wellman, and W. E. Walsh. \The Michigan Internet AuctionBot: A congurable auction server for human and software agents." In K. P. Sycara and M. Wooldridge, (eds.), Proc. Proceedings of the 2nd International Conference on Autonomous Agents (Agents'98), pp. 301-308, New York, 9-13, 1998. ACM Press.

....the negotiation space As already noted, the design of an appropriate negotiation scenario crucially depends on a number of parameters, which can be seen to generate a space of possible negotiation scenarios. A preliminary attempt to classify this space has already been proposed by Wurman et al. [WWW98]. In particular, they identify variables upon which auction servers can be designed. Some of the parameters introduced there are also present in our classi cation; but since we are not only concerned with auctions, our classi cation is more general. We divide the parameters on which the ....

P. R. Wurman, M. P. Wellman, and W. E. Walsh. The Michigan Internet AuctionBot: A congurable auction server for human and software agents. In K. P. Sycara and M. J. Wooldridge, editors, Proceedings of the 2nd International Conference on Autonomous Agents (Agents'98), pages 301-308, New York, May 9{ 13, 1998. ACM Press. 20

....to the simplicity of their conventions for interaction when multi party negotiations are involved, but also to the fact that on line auctions may successfully reduce storage, delivery or clearing house costs in many markets. This popularity has spawned AI research and development in auction servers[22, 17] as well as in trading agents and heuristics[5, 9] On the other hand, auctions are not only employed in web based trading, but also as one of the most prevalent coordination mechanisms for agent mediated resource allocation problems (f.i. energy management[23] climate control[6] ow ....

P. R. Wurman, , M. P. Wellman, and W. E. Walsh. The Michigan Internet AuctionBot: A Congurable Auction Server for Human and Software Agents. In Second International Conference on Autonomous Agents (AGENTS'98), 1998.

.... and marketbased architectures are a popular choice for multiple agents (see, for instance, 2, 16, 20, 23] and our own MAGMA architecture [21] Most market architectures limit the interactions of agents to manual negotiations, direct agent toagent negotiation [19, 9] or various types of auctions [24]. Auctions are becoming the predominant mechanism for agent mediated electronic commerce [10] AuctionBot [24] and eMEDIATOR [18] are among the most well known examples of multi agent auction systems. They use economics principles to model the interactions of multiple agents. Auctions are not ....

.... our own MAGMA architecture [21] Most market architectures limit the interactions of agents to manual negotiations, direct agent toagent negotiation [19, 9] or various types of auctions [24] Auctions are becoming the predominant mechanism for agent mediated electronic commerce [10] AuctionBot [24] and eMEDIATOR [18] are among the most well known examples of multi agent auction systems. They use economics principles to model the interactions of multiple agents. Auctions are not always the most appropriate mechanism for the business to business transactions we are interested in, where ....

P. R. Wurman, M. P. Wellman, and W. E. Walsh. The Michigan Internet AuctionBot: A congurable auction server for human and software agents. In Second Int'l Conf. on Autonomous Agents, May 1998.

....support simple negotiation services, business to business dynamic trade applications have begun to exhibit advanced capabilities previously found in research systems. For example, some commercial auction platforms support the con gurability characteristic of the Michigan Internet AuctionBot [16], 3 and several integrate auctions with other commerce facilities, as demonstrated by an IBM auction prototype [9] Although multidimensional mechanisms are more complicated, and not yet widely available, we expect that they will eventually provide an important medium for automated negotiation. ....

....handle multiple attributes. 4.2 Auction Space Auction Space provides basic knowledge about the parametrization of the space of possible auction mechanisms, as well as defaults for auction parameters and constraints among them. The parametrization is motivated by that employed by the AuctionBot [16] and by an extended and generalized parametrization in more recent work [17] The default values for parameters are labeled as lowest priority rules so that parameters inferred based on speci c aspects of a negotiation will take precedence. For example, the following rules specify that by default, ....

P. R. Wurman, M. P. Wellman, and W. E. Walsh. The Michigan Internet AuctionBot: A congurable auction server for human and software agents. In Second International Conference on Autonomous Agents, pages 301-308, Minneapolis, 1998.

....and further learning and adaptation e ects. Our computational testbed is the Michigan Internet AuctionBot (http: auction.eecs.umich.edu ) which provides fairly general facilities to 30 set up and run distributed computational markets, and provides an interface for both human and computer agents [88]. Acknowledgments We thank to Didier Dubois, Robin Hanson, Je rey Mackie Mason, Robert Nau, Charles Plott, Steven Pollock, Ross Shachter, James Smith, Mike West, and Fredrik Ygge for providing helpful insights, feedback, encouragement, and relevant pointers. ....

Peter R. Wurman, Michael P. Wellman, and William E. Walsh. The Michigan Internet AuctionBot: A congurable auction server for human and software agents. In Second International Conference on Autonomous Agents, pages 301-308, Minneapolis, May 1998.

....auctions on the World Wide Web 1 is evidence that explicit price formation mechanisms will play an important role in electronic commerce. To support our research into negotiation protocols for electronic commerce and multiagent systems [20, 21] we have built the Michigan Internet AuctionBot [23], a con gurable auction server deployed over the World Wide Web (http: auction.eecs.umich.edu ) The AuctionBot has been operational since September 1996, allowing human agents to create auctions and submit bids via web forms, and (more recently) software agents to perform the same operations via ....

Peter R. Wurman, Michael P. Wellman, and William E. Walsh. The Michigan Internet AuctionBot: A congurable auction server for human and software agents. In Second International Conference on Autonomous Agents, pages 301-308, Minneapolis, 1998. 21

....complementarities [7, 16] 4 The Family of k Bundle Auctions Although we have presented the price setting policy under the assumption of an omniscient mediator, the algorithms can be used directly on bids. Thus, we can combine the k bundle price policy with the full set of auction parameters [20, 19]. This gives potentially hundreds of new auction types to explore. We have not completed an in depth analysis of any member of this auction family, but have a few preliminary observations. Throughout this section we assume that bids are of the form r i (b) where r i (b) 2 R , but is not ....

Peter R. Wurman, Michael P. Wellman, and William E. Walsh. The Michigan Internet AuctionBot: A congurable auction server for human and software agents. In Second International Conference on Autonomous Agents, pages 301-8, Minneapolis, 1998. 12

No context found.

Peter R. Wurman, Michael P. Wellman, and William E. Walsh. The Michigan Internet AuctionBot: A con gurable auction server for human and software agents. In Proceedings of the Second International Conference on Autonomous Agents, pages 301-308, 1998.

No context found.

Peter R. Wurman, Michael P. Wellman, and William E. Walsh. The Michigan Internet AuctionBot: A con gurable auction server for human and software agents. In Proceedings of the Second International Conference on Autonomous Agents, pages 301-308, 1998. 78 Appendices

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