T. Sandholm, "Limitations of Vickrey Auction in Computational Multiagent Systems," in In Proceedings of Second International Conference on Multiagent Systems (ICMAS-96), Kyoto, Japan, December 1996, pp. 299--306.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....an agent can immediately verify if it has been given an accurate allocation. If an agent knows the received allocation x i and its own bid s i , any bid total suggested by the auctioneer other than s i x i can be immediately identified as a signal of an inaccurate allocation or a lying auctioneer [21]. Furthermore, under this cost structure, each agent pays the same price per unit resource received. We assume that each agent has a valuation v i (x i ) for receiving an allocation x i . This valuation may be a characterization of the estimated performance as a function of a given share of the ....

T. W. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International conference on Multi-Agent Systems, pages 299--306, Kyoto, Japan, December 1996.

....a rich body of economic theory, so that rigorous results exists for many problems. Of the economicallybased control schemes, the one that has received by far the most attention in the multi agent community was auctions. Algorithms for holding and deciding auctions have been proposed and analyzed [21, 19], both from the perspective of resource allocation [3, 20] and task allocation [30] and applied to task domains such as allocating operating system resources [15] providing library services [17] scheduling jobs on networks of workstations [8] and maintaining optimal o#ce climate [33] The most ....

T. Sandholm. Limitations of the Vickrey Auction in Computational Multiagent Systems. In International Conference on Multi-Agent Systems (ICMAS), pages 299--306, Kyoto, Japan, Dec. 1996.

....impact on the implementability of the allocation scheme. We seek to design an auction that minimizes these e#ects. It has been noted that second price auctions have several detriments including excessive vulnerabilities to bidder collusion and undesired revelation of private information [22]. Another concern, that we wish to address, is the possibility of the lying auctioneer. In a Vickrey auction, the buyer must trust that the second price is reported accurately, unless preferences of other agents are made public. The revelations of all bids might not be desired by the agents and ....

Sandholm, T. W.: 1996, `Limitations of the Vickrey auction in computational multiagent systems'. In: Proceedings of the 2nd International conference on Multi-Agent Systems. Kyoto, Japan, pp. 299--306.

....Categories Subject Descriptors Intelligent agents, Multiagent systems. General Terms Economics. Keywords Bidding and bargaining agents. Electronic commerce market. 1. INTRODUCTION Recently, auction mechanisms have become a fundamental way of automating negotiation among agents [4,9,10,12]. The widespread research on automated auctions deals mostly with models in which price is the unique strategic dimension. However, in many situations, it is necessary to conduct negotiations on multiple attributes of a deal. For example, in task allocation, the attributes of a deal include ....

....(ascending) auction protocol, and we prove that, given some assumptions, they all converge to the same result. We also discuss which of the above variations is preferred for different types of environments. 2. RELATED WORK An auction is an efficient protocol for reaching agreements among agents [4,9,10,12]. There are several types of auctions which are used, including the English auction, first price sealed bid auction, second price sealed bid (Vickery) auction, and the Dutch auction [10] In this paper, we consider the first price sealed bid and the English auction. In the first price auction, ....

[Article contains additional citation context not shown here]

Sandholm, T.W. Limitations of the Vickrey Auction in Computational Multiagent Systems. In proc. of ICMAS- 96 1996, 299-306.

....strategy. Categories Subject Descriptors Intelligent agents, Multiagent systems. General Terms Economics. Keywords Bidding and bargaining agents. Electronic commerce market. 1. INTRODUCTION Negotiating agents can efficiently use auction mechanisms for reaching agreements among agents [8,13,14], and they can also be used when the issue under consideration is associated with multiattributes items [5] A multi attribute item is characterized by several attributes in which one of them is the price and the others are non price quality attributes. For example, a service can be characterized ....

Sandholm, T.W. Limitations of the Vickrey Auction in Computational Multiagent Systems. In proc. of ICMAS96 1996, 299-306.

....Categories Subject Descriptors Intelligent agents, Multiagent systems. General Terms Economics. Keywords Bidding and bargaining agents. Electronic commerce market. 1. INTRODUCTION Negotiating agents can efficiently use auction mechanisms for reaching agreements among agents [8,13,14], and auctions can also be used when the issue under consideration is associated with multi attributes items [5] A multi attribute item is characterized by several attributes in which one of them is the price and the others are non price quality attributes. For example, in task ....

Sandholm, T.W. Limitations of the Vickrey Auction in Computational Multiagent Systems. In Proc. of ICMAS- 96 1996, 299-306.

....and behavior) privacy issues should be taken into account. It is important to note here that the Vickrey auction has some known deficiencies. Furthermore, limitations of the protocol may arise when the Vickrey protocol is used for automated auctions and bidding is done by computational agents [14]. These aspects deserve further attention for future implementations. mitment is proposed and analyzed. The key ingredient of this protocol is the option to break an agreement, in favor of, hopefully, a better deal, at the possible cost of a prenegotiated penalty. In our the experiments, an agent ....

T. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299--306. AAAI Press, 1996.

....and behavior) privacy issues should be taken into account. llIt is important to note here that the Vickrey auction has some known deficiencies. Furthermore, limitations of the protocol may arise when the Vickrey protocol is used for automated auctions and bidding is done by computational agents [19]. These aspects deserve further attention for future implementations. 4. The Decornrnitrnent Option 5 case. This, in general, increases the competition between the trucks of different companies. 4. THE DECOMMITMENT OPTION Contracts are typically binding in traditional multi agent negotiation ....

T. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299-306. AAAI Press, 1996.

....8. Related Work 8.1. MECHANISM DESIGN WITH BOUNDED RATIONAL AGENTS An early study of Vickrey auctions in computational settings first demonstrated that the strategyproofness of an auction can break when agents have approximate values for items and options to continue computation or submit bids [39]. Sandholm s analysis shows that an agent can make a better decision about whether or not to perform further computation about the value of an item if it is well informed about the bids from other agents. In recent years, Larson Sandholm [22, 20, 21] have modeled agent deliberation in ....

Sandholm, T. W.: 1996, `Limitations of the Vickrey Auction in Computational Multiagent Systems'. In: Second International Conference on Multiagent Systems (ICMAS-96). pp. 299--306.

....the best (dominant) strategy a bidder can choose is to declare truthfully his her value for owning the item. This mechanism also happens to be efficient, individual rational, and weakly budget balanced, further nice properties that make Vickrey auctions at least theoretically popular. See Sandholm [20] for a concise overview of various auction types and a discussion of why the interesting Vickrey auction is not used very often in real life. 4 Node Types in Peer to Peer Systems Mechanism design should be viewed as a tool in the network designer s repertoire to help deal with rational nodes. ....

Tuomas Sandholm. Limitations of the Vickrey Auction in Computational Multiagent Systems. In Proceedings of the 2nd International Conference on Multi-Agent Systems (ICMAS). AAAI Press, 1996. Menlo Park, CA.

....and behavior) privacy issues should be taken into account. It is important to note here that the Vickrey auction has some known de ciencies. Furthermore, limitations of the protocol may arise when the Vickrey protocol is used for automated auctions and bidding is done by computational agents [19]. These aspects deserve further attention for future implementations. 4. The Decommitment Option 5 case. This, in general, increases the competition between the trucks of di erent companies. 4. The Decommitment Option Contracts are typically binding in traditional multi agent negotiation ....

T. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299-306. AAAI Press, 1996.

....auction is made public. The dominant strategy is the bidding of the actual expected pro t (valuation) Vickrey, 1961 ] under the assumption of sucient competition between the trucks of the companies. In this auction setup, in the long run, the agent cannot pro t by using a di erent strategy [ Sandholm, 1996 ] Furthermore, in our model, opportunities for speculation as in [ Rosenschein and Zlotkin, 1994; McMillan, 1994; Watson, 2002 ] are restricted. As a cost in the bidding is occurred if the bid is won when there are competitors, the trucks within one company only enter an auction if they are ....

T. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299-306. AAAI Press, 1996.

....only the second highest bid. The dominant strategy is the bidding of the actual expected pro t (valuation) Vickrey, 1961 ] under the assumption of sucient competition between the ShopNegotiators. In this auction setup, in the long run, the agent cannot pro t by using a di erent strategy [ Sandholm, 1996 ] From the auction, there is feedback whether the bid is won or not. For a winning bid, there is a customer who may make a purchase at the shop for which the shop negotiator presented the banners. From this information the shop negotiator agents can derive the expected pro t from a customer ....

T. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299-306. AAAI Press, 1996.

....only the second highest bid. The dominant strategy is the bidding of the actual expected profit (valuation) Vickrey, 1961] under the assumption of sufficient competition between the ShopNegotiators. In this auction setup, in the long run, the agent cannot profit by using a different strategy [Sandholm, 1996]. From the auction, there is feedback whether the bid is won or not. For a winning bid, there is a customer who may make a purchase at the shop for which the shop negotiator presented the banners. From this information the shop negotiator agents can derive the expected profit from a customer ....

T. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299-306. AAAI Press, 1996.

....of agents. As argued above, and as it is obviously implied by many real world applications, it is necessary to take the existence of antisocial agents into consideration. The paper focused on the Vickrey auction and showed that this auction protocol, in addition to other known deficiencies [15, 14, 13], is vulnerable to antisocial bidders. This is an effect of the second price policy which enables easy price manipulation. As the common English auction for private value bidders is equivalent to the Vickrey auction [9, 12] all strategies in this paper work for English auctions as well. The ....

T.W. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS-96), Menlo Park, CA, 1996. AAAI Press.

....private valuation of a good. This is a huge advantage over first price auctions, where bidders have to estimate the other bidders valuations when calculating their bid. However, despite its impressive theoretical properties, the Vickrey auction is rarely used in practice. It is generally agreed [23, 22, 26] that the Vickrey auction s sparseness is due to two major reasons: the fear of an untruthful auctioneer and the reluctance of bidders to reveal their true valuations. The winner of an auction has to doubt whether the price the auctioneer tells him to pay is actually the second highest bid. The ....

T. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299--306, Menlo Park, CA, 1996. AAAI Press.

....huge advantage over first price auctions, where bidders have to estimate the other bidders valuations when calculating their bid. However, despite its impressive theoretical properties, the Vickrey auction is rarely used in practice. This problem has been addressed several times in the literature [24, 23, 27] and it is now common knowledge that the Vickrey auction s sparseness is due to two major reasons: the fear of an untruthful auctioneer and . the reluctance of bidders to reveal their true valuations The proposed protocol removes both crucial weaknesses of the Vickrey auction by omitting the ....

T. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299--306, Menlo Park, CA, 1996. AAAI Press.

....of agents here is very broad, incorporating attributes of code mobility, artificial intelligence, usercustomization, and self interest. A subfield of this general direction of research takes a game theoretic analysis of agents goals, and in particular uses notions from mechanism design [21] [22] [7] A related subfield of Distributed AI, sometimes termed market based computation [26] 8] 25] aims to leverage the notions of free markets in order to solve distributed problems. These subfields of DAI are related to our work. Communication Networks In recent years researchers in the ....

Tuomas W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), pages 299--306, Keihanna Plaza, Kyoto, Japan, December 1996.

....and multiagent systems (MASs) Often agents need access to specific resources to pursue their objectives, but the needs of one agent may conflict with those of another. A number of market based approaches have been proposed as a means to deal with resource allocation and related problems in MASs [6, 20, 22]. Of particular interest are auction mechanisms, where each agent bids for a resource according to some protocol, and the allocation and price for the resource are determined by specific rules [14] Auctions have a number of desirable properties as a means for coordinating activities, including ....

T. Sandholm. Limitations of the vickrey auction in computational multiagent systems. ICMAS-96, pp.299--306, Kyoto, 1996.

....adaptation of auction theory to computational settings becomes a task of considerable importance. Naturally, when one considers trade in computational settings, he may wish to consider the effects of computational bounds on agents behavior in auctions. This is the approach taken for example in [19]. However, as we show, the computational setting also suggests the need for a careful study of basic issues in economics that have (somewhat surprisingly) been neglected. The Internet is a computational setting, with flexible software which is used by relatively sophisticated users. This makes ....

T. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In 2nd International Conference on Multi-Agent Systems, 1996.

....huge advantage over first price auctions, where bidders have to estimate the other bidders valuations when calculating their bid. However, despite its impressive theoretical properties, the Vickrey auction is rarely used in practice. This problem has been addressed several times in the literature [24, 23, 27] and it is now common knowledge that the Vickrey auction s sparseness is due to two major reasons: The fear of an untruthful auctioneer and the reluctance of bidders to reveal their true private valuations. The protocol in this paper removes both crucial weaknesses of the Vickrey auction by ....

T. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299--306, Menlo Park, CA, 1996. AAAI Press.

....huge advantage over first price auctions, where bidders have to estimate the other bidders valuations when calculating their bid. However, despite its impressive theoretical properties, the Vickrey auction is rarely used in practice. This problem has been addressed several times in the literature [19, 18, 22] and it is now common knowledge that the Vickrey auction s sparseness is due to two major reasons: The fear of an untruthful auctioneer and the reluctance of bidders to reveal their true private valuations. The protocol in this report removes both crucial weaknesses of the Vickrey auction by ....

T. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS-96), pages 299--306, Menlo Park, CA, 1996. AAAI Press.

....of agents. As argued above, and as it is obviously implied by many real world applications, it is necessary to take the existence of antisocial agents into consideration. The paper focused on the Vickrey auction and showed that this auction protocol, in addition to other known deficiencies [14, 13, 12], is vulnerable to antisocial bidders. This is an effect of the second price policy which enables easy price manipulation and emphasizes the required confidentiality of 0 1000 2100 10 20 30 40 50 60 70 80 90 100 Auction Rounds CE 1 CE 2 CE 3 All contractees are antisocial (d i = 0.5, s i = ....

T.W. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS-96), Menlo Park, CA, 1996. AAAI Press.

....of agents. As argued above, and as it is obviously implied by many real world applications, it is necessary to take the existence of antisocial agents into consideration. The paper focused on the Vickrey auction and showed that this auction protocol, in addition to other known deficiencies [2], is vulnerable to antisocial bidders. This is an e#ect of the second price policy which enables easy price manipulation. As the common English auction for private value bidders is equivalent to the Vickrey auction, all strategies in this paper work for English auctions as well. The inability to ....

T. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS-96), Menlo Park, CA, 1996. AAAI Press.

....in the usage of techniques from auction theory for computational resource allocation [28, 9, 19] in computerized Institute of Computer Science, Hebrew U. Jerusalem. This research was supported by grants from the Israeli ministry of Science and the Israeli academy of sciences. 1 agent systems [25, 22]; and in current trends in business to business electronic commerce [21] With this new dominance of auctions, also comes a quantum leap in the complexity of these auctions. In many cases, auctions of multiple non identical items is performed. The price that a bidder may offer for one item may ....

Tuomas W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), pages 299--306, Keihanna Plaza, Kyoto, Japan, December 1996.

....the standard and the reverse auction are fully analogical, all presented considerations and techniques do hold for both formulations of the Vickrey auction. Despite its impressive theoretical properties, the Vickrey auction is rarely used in practice. This problem has been addressed several times [18, 19, 17] and it is an undisputed fact that the Vickrey auction s sparseness is due to two major reasons. First, the proper execution of a Vickrey auction depends on the truthfulness of the auctioneer. The highest bidder has to trust the auctioneer when he is told the second highest bid. There is a great ....

T.W. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS-96), Menlo Park, CA, 1996. AAAI Press.

....drawing from the elds of Mechanism Design in Economics and from the Theory of Algorithms in Computer Science. Combinatorial auctions in which a large number of items are sold and in which bidders may express preferences over bundles, i.e. subsets, of items have drawn a lot of attention recently [8, 10, 9, 11, 12, 2, 4, 7, 3, 1, 6, 13]. We consider here the winner determination problem, i.e. the algorithmic problem of nding the allocation that maximizes the declared social welfare. We consider both (single unit) combinatorial auctions and multiunit combinatorial auctions in which a number of identical items of each type ....

T. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In 2nd International Conference on Multi-Agent Systems, 1996.

....of agents here is very broad, incorporating attributes of code mobility, artificial intelligence, usercustomization, and self interest. A subfield of this general direction of research takes a game theoretic analysis of agents goals, and in particular uses notions from mechanism design [21] [22] [7] A related subfield of Distributed AI, sometimes termed market based computation [26] 8] 25] aims to leverage the notions of free markets in order to solve distributed problems. These subfields of DAI are related to our work. Communication Networks In recent years researchers in the ....

Tuomas W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), pages 299--306, Keihanna Plaza, Kyoto, Japan, December 1996.

....before combinatorial auctions can be used in a large scale. One of the major problems is the computational di#culty of determining an optimal allocation for a given set of bids. This problem is usually formalized as a packing problem and is known to be NP complete to solve, or even to approximate [12]. The problem has received much attention lately [14, 3, 7, 13, 1, 4, 11, 10] with three approaches usually taken: heuristics to improve the running time of finding the optimal solution, heuristics to improve the solution quality of e#cient algorithms, or special cases that can be optimally ....

T. W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), pages 299--306, Keihanna Plaza, Kyoto, Japan, December 1996.

....selfinterested individuals. This domain was explored in a paper about English auctions over multidimensional goods [13] The complex issues of self interest were avoided by assuming that it is illegal to resell the resources and that agents treat prices as exogenous. Recent work by Sandholm [29] and by Vulkan and Jennings [13] has made it clear that the Vickrey auction has several drawbacks that makes it unsuitable for open agent systems. The fact that the Vickrey auction relies on secret private value bids makes it susceptible to collusion and unusable for common valued goods. Vulkan ....

Tuomas Sandholm, Limitations of the Vickrey Auction in Computational Multiagent Systems, Second International Conference on Multiagent Systems, ICMAS-96, Kyoto, Japan, December, 1996.

....that always sells goods in a bundle. Introduction Internet auctions have become an especially popular part of Electronic Commerce (EC) Various theoretical and practical studies on Internet auctions have already been conducted (Monderer Tennenholtz 1998; Wurman, Wellman, Walsh 1998; Sandholm 1996). The Internet provides an excellent infrastructure for executing much cheaper auctions with many more sellers and buyers from all over the world. However, we must consider the possibility of new types of cheating. For example, an agent may try to profit from submitting false bids made under ....

....names. Such a dishonest action is very difficult to detect since identifying each participant on the Internet is virtually impossible. We call a bid under a fictitious name a false name bid. The problems resulting from collusion have been discussed by many researchers (Rasmusen 1994; Varian 1995; Sandholm 1996). Compared with collusion, a false name bid is easier to exe Copyright c fl 2000, American Association for Artificial Intelligence (www.aaai.org) All rights reserved. cute since it can be done alone, while a bidder has to seek out and persuade other bidders to join in collusion. In (Sakurai, ....

Sandholm, T. 1996. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), 299--306.

....http: www.kecl.ntt.co. jp csl ccrg members matubara (Shigeo Matsubara) to appear Artificial Intelligence 1 Introduction Internet auctions havebecomeanespecially popular part of Electronic Commerce (EC) Various theoretical and practical studies on Internet auctions have already been conducted [6,10,13]. Among these studies, those on combinatorial auctions have lately attracted considerable attention [2,3,8,11] Although conventional auctions sell a single good at a time, combinatorial auctions sell multiple goods with interdependentvalues simultaneously and allowthebidders to bid on ....

....bids under fictitious names. Such a dishonest action is very difficult to detect since identifying each participant on the Internet is virtually impossible. We call a bid made under a fictitious name a false name bid. The problems resulting from collusion have been discussed by many researchers [3,7,10,12]. Compared with collusion, a false name bid is easier to execute since it can be done alone, while a bidder has to seek out and persuade other bidders to join in collusion. We can consider false name bids as a very restricted subclass of collusion. The authors have analyzed the effects of ....

T. Sandholm, Limitations of the Vickrey auction in computational multiagent systems, in: Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), 1996, pp. 299--306. 18

....design problem. Mechanism design is an active research area in economics (Mas Colell, Whinston, Green 1995) and the obtained results have been applied to computer science, in particular, negotiation problems among computational agents (Monderer Tennenholtz 1998; Rosenschein Zlotkin 1994; Sandholm 1996; Walsh et al. 1998) In existing studies on mechanism design problems, it is commonly assumed that the designer of a mechanism can identify the participants of the mechanism. This assumption, however, does not hold when considering a collective decision making problem on the Internet, ....

Sandholm, T. 1996. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), 299--306.

....buyers (or sellers) and two sided or double auctions that permit multiple buyers and sellers to bid to exchange a designated good. For one sided auctions, many theoretical and practical studies have been conducted [3] including those on Internet auctions and on applications of software agents [2, 9, 12]. The Internet provides an excellent infrastructure for executing much cheaper auctions with many more sellers and buyers from all over the world. However, we must consider the possibility of new types of cheating. For example, a participant may try to profit from submitting false bids made under ....

....made under fictitious names. Such a dishonest action is very difficult to detect since identifying each participant on the Internet is virtually impossible. We call a bid made under a fictitious name a false name bid. The problems resulting from collusion have been discussed by many researchers [7, 9, 10]. Compared with collusion, a false name bid is easier to execute since it can be done by someone acting alone, while a bidder has to seek out and persuade other bidders to join in collusion. The authors have analyzed the effect of false name bids in one sided auctions [8, 13] and have developed a ....

T. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), pages 299--306, 1996.

....may be implemented or certified by some globally trusted authority it is more questionable in the case of agents. Just as design of negotiation mechanisms must account for incentives faced by agents, we must consider these incentives in constructing any augmentation for quiescence detection [Sandholm, 1996] . 7.3.1 Deviations There are five distinct ways an agent could deviate from the quiescence detection protocol. 1. Failure to acknowledge a received message while in active mode. 2. Failure to acknowledge the activator upon reaching a fully acknowledged state. 1 3. Premature acknowledgment ....

Tuomas Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Second International Conference on Muli-Agent Systems, pages 299--306, 1996.

....is the point of the graph. The nodes of G are the finite paths that start from the point of G. 5. An example: auction analysis With the growing impact of electronic commerce, auctions are going to play an increasingly important role in multiagent systems and distributed artificial intelligence [17,18,14]. In this section we demonstrate how the belief graph reasoning, presented here, can be applied to the analysis of auctions. Most theoretical results in auction theory draw crucially on the revenue equivalence theorem [19] According to the theorem, the first price sealed bid, second price sealed ....

Sandholm T. Limitations of the Vickrey Auction in Computational Multiagent Systems. Proceedings of the ICMAS'96, pp. 229-306, 1996.

No context found.

T. Sandholm, "Limitations of Vickrey Auction in Computational Multiagent Systems," in In Proceedings of Second International Conference on Multiagent Systems (ICMAS-96), Kyoto, Japan, December 1996, pp. 299--306.

No context found.

T.W. Sandholm, Limitations of the vickrey auction in computational multiagent systems, Second International Conference on Multiagent Systems (ICMAS-96) (1996), 299--306.

No context found.

Sandholm, T. W.: 1996, `Limitations of the Vickrey Auction in Computational Multiagent Systems'. In: Second International Conference on Multiagent Systems (ICMAS-96). pp. 299--306.

No context found.

Tuomas W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), pages 299--306, Keihanna Plaza, Kyoto, Japan, December 1996.

No context found.

T Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Second International Conference on Multiagent Systems (ICMAS-96), pages 299--306, 1996.

No context found.

T. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Proceedings of the 2nd International Conference on Multiagent Systems (ICMAS), pages 299-- 306, Menlo Park, CA, 1996. AAAI Press.

No context found.

Tuomas W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS96) , pages 299--306, Keihanna Plaza, Kyoto, Japan, December 1996. 78

No context found.

T. Sandholm, Limitations of the Vickrey Auction in Computational Multiagent Systems, in ConferenceProceedings of the Second International Conference on Multi-Agent Systems (ICMAS-96),Kyoto 1996.

No context found.

Sandholm, T.W., (1995), "Limitations of the Vickrey auction in computational multiagents systems", Proc. of the First Intl. Conference on Multi -Agent Systems, MIT Press, Cambridge, MA.

No context found.

Tuomas W Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Second International Conference on Multiagent Systems (ICMAS-96), pages 299--306, 1996.

No context found.

Sandholm, T. 1996. Limitations of the Vickrey Auction in computational multiagent systems. In Conference Proceedings of the Second International Conference on Multi-Agent Systems (ICMAS-96), 299-306. Kyoto: AAAI Press.

No context found.

Sandholm, T. 1996. Limitations of the Vickrey auction in computational multiagent systems. In Proc. 2nd International Conference on Multiagent Systems #ICMAS-96#, 299#306.

No context found.

Tuomas W. Sandholm. Limitations of the vickrey auction in computational multiagent systems. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), pages 299-306, Keihanna Plaza, Kyoto, Japan, December 1996.

No context found.

T. W. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In Victor Lesser, editor, Proc. of the first Int. Conference on Multi-Agent Systems. The MIT Press, Cambridge, MA, 1995.

First 50 documents  Next 50

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