| C. Preist and M. van Tol. Adaptive agents in a persistent shout double auction. In Proceedings of ICE-98, pages 11--18. ACM. |
....persistent open orders. The primary modification has to do with outbidding or undercutting existing orders. This now happens when orders remain open for a certain amount of real time without being traded. Our modifications turn out to be related to those independently proposed by Preist van Tol [Preist and van Tol, 1998] . In our ZIP implementation, each agent maintains a vector of internal price variables p; the i th component of p, p i , is used to set the order price when trading the i th unit. At the start of trading, p is initialized to random positive surplus values, and is adjusted during the period ....
C. Preist and M. van Tol. Adaptive agents in a persistent shout double auction. In Proceedings of the First International Conference on Information and Computation Economies, pages 11--18. ACM Press, 1998.
....This is done on a unit by unit basis only for units that have not yet traded this period. This allows the algorithm to be used in a real time environment. Our modi cations for real time trading and persistent open orders turn out to be related to those independently proposed by Preist van Tol [7]. In prior studies, populations of ZIP traders have been found to achieve robust convergence, with eciencies and rates of convergence somewhat less than those obtained by human subjects. However, in our experiments, we nd extremely high eciencies, possibly because we have done a better job of ....
C. Preist and M. van Tol. Adaptive agents in a persistent shout double auction. In Proceedings of ICE-98. ACM, 1998.
....in rounds, all agents placing shouts, listening to other s shouts, and then recalculating what they shall bid or o#er in the next round. It has been shown that over time even agents with simplebidding strategies will converge to amarketequilibrium price that is optimal for the system as awhole [6]. Facilitators, as generalized in the middle agents paradigm [2] 8] on the other hand rely on one central agent, or set of agents, to indicate where looked for services can be found [3] Such systems create a central directory of service providers, service users, or both. This directory can then ....
Preist, C., Van Tol, M.: Adaptive Agents in a Persistent Shout Double Auction. Proc. 1st InternationalConferenceontheInternet,Computing and Economics. (1998) 11-17
....agents only work given certain supply and demand curves. They created zero intelligence plus agents that use a simple learning algorithm to make use of past information and showed that it worked in the circumstances where Gode and Sunder s zero intelligence traders failed. Priest and Van Tol [6] later extended this work from an auction mechanism where only one agent bids at a time to a more realistic scenario where all agents bid simultaneously. This paper introduces peer to peer auctioning and compares the central auction and simple learning agents used in [6] with such a peer to peer ....
....failed. Priest and Van Tol [6] later extended this work from an auction mechanism where only one agent bids at a time to a more realistic scenario where all agents bid simultaneously. This paper introduces peer to peer auctioning and compares the central auction and simple learning agents used in [6] with such a peer to peer auction using the same agents. This peer to peer auction is created by adapting a peer topeer matchmaking procedure that we analyzed in [4] and [5] In that work we were concerned with removing the central brokerage or yellow pages entity from the distributed agents ....
[Article contains additional citation context not shown here]
Preist, C., Van Tol, M.: Adaptive Agents in a Persistent Shout Double Auction. Proceedings of the 1st International Conference on the Internet, Computing and Economics. ACM Press (1998) 11--17
....the possibility of matching an outstanding bid (ask) Actually, the ZI strategy is equivalent to the ZI C strategy proposed by Gode and Sunder [34] Fixed Mark up (FM) strategy. An FM b agent (sagent) submits the outstanding bid (ask) plus (minus) some prede ned mark up (a specialisation of [35]) This is a simple strategy because the agent does not need to model other agents and it tries to reduce the ask bid spread until its cost or valuation is met. Chris Preist (CP) strategy. The CP strategy consists of a small number of heuristics and a learning rule [36] The heuristics rst ....
C. Preist and M. van Tol, \Adaptive agents in a persistent shout double auction," in Proceedings of the First International Conference on the Information and Computation Economies, 1998, pp. 11-18.
....in rounds, all agents placing shouts, listening to other s shouts, and then recalculating what they shall bid or o#er in the next round. It has been shown that over time even agents with simple bidding strategies will converge to a market equilibrium price that is optimal for the system as a whole [6]. Facilitators, as generalized in the middle agents paradigm [2] 8] on the other hand rely on one central agent, or set of agents, to indicate where looked for services can be found [3] Such systems create a central directory of service providers, service users, or both. This directory can then ....
Preist, C., Van Tol, M.: Adaptive Agents in a Persistent Shout Double Auction. Proc. 1st International Conference on the Internet, Computing and Economics. ACM Press (1998)11-17
....MAGENTA) the agent adjusts margins and prices of units that have not yet traded to beat the best current open bid or ask. This allows the algorithm to be used in a real time environment. Our modifications for real time trading and persistent orders are related to those independently proposed in [6]. Our ZIP experiments find e#ciencies and rates of convergence somewhat higher than in prior studies, possibly because we have done a better job of optimizing the initialization and dynamic behavior. 2.4 Gjerstad Dickhaut (GD) Traders GD agents [4] use the history HM of recent market activity ....
C. Preist and M. van Tol. Adaptive agents in a persistent shout double auction. In Proceedings of ICE-98. ACM, 1998.
No context found.
C. Preist and M. van Tol. Adaptive agents in a persistent shout double auction. In Proceedings of the 1st International Conference on the Internet, Computing and Economics. ACM Press, 1998.
No context found.
Preist, C. and van Tol, M. Adaptive Agents in a Persistent Shout Double Auction. Proceedings of the 1 st International Conference on the Internet, Computing and Economics, ACM Press 1998.
No context found.
Preist, C. and van Tol, M. Adaptive Agents in a Persistent Shout Double Auction. Proceedings of the 1st International Conference on the Internet, Computing and Economics, ACM Press 1998.
No context found.
C. Preist and M. van Tol. Adaptive agents in a persistent shout double auction. In Proceedings of ICE-98, pages 11--18. ACM.
No context found.
C.W. Preist and M. van Tol, "Adaptive Agents in a Persistent Shout Double Auction," in Proceedings of the 1st International Conference on Information and Computation Economies, Elsevier 1999.
No context found.
C.W. Preist and M. van Tol, "Adaptive Agents in a Persistent Shout Double Auction," in Proceedings of the 1st International Conference on Information and Computation Economies, Elsevier 1999.
No context found.
C. Preist and M. van Tol. Adaptive Agents in a Persistent Shout Double Auction. Proceedings of the 1st International Conference on the Internet, Computing and Economics, pp. 11-18, ACM press, 1998.
No context found.
C. Preist and M. van Tol. Adaptive agents in a persistent shout double auction. Technical Report HPL-2003-242, Hewlett Packard Labs, 2003.
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