Allocative efficiency and traders' protection under zero intelligence behavior
AbstractThis paper studies the continuous double auction from the point of view of market engineering: we tweak a resampling rule often used for this exchange protocol and search for an improved design. We assume zero intelligence trading as a lower bound for more robust behavioral rules and look at allocative efficiency, as well as three subordinate performance criteria: mean spread, cancellation rate, and traders' protection. This latter notion measures the ability of a protocol to help traders capture their share of the competitive equilibrium profits. We consider two families of resampling rules and obtain the following results. Full resampling is not necessary to attain high allocative efficiency, but fine-tuning the resampling rate is important. The best allocative performances are similar across the two families. However, if the market designer adds any of the other three criteria as a subordinate goal, then a resampling rule based on a price band around the best quotes is superior.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Department of Applied Mathematics, Università Ca' Foscari Venezia in its series Working Papers with number 168.
Length: 24 pages
Date of creation: Oct 2008
Date of revision: Nov 2009
Publication status: Published in H. Dawid and W. Semmler (eds.), Computational Methods in Economic Dynamics, Springer, 5-28
market engineering; trading protocols; competitive share; exchange market;
Find related papers by JEL classification:
- D51 - Microeconomics - - General Equilibrium and Disequilibrium - - - Exchange and Production Economies
- D40 - Microeconomics - - Market Structure and Pricing - - - General
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C92 - Mathematical and Quantitative Methods - - Design of Experiments - - - Laboratory, Group Behavior
This paper has been announced in the following NEP Reports:
- NEP-ALL-2008-10-28 (All new papers)
- NEP-EXP-2008-10-28 (Experimental Economics)
- NEP-MST-2008-10-28 (Market Microstructure)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Duffy, John, 2006.
"Agent-Based Models and Human Subject Experiments,"
Handbook of Computational Economics,
in: Leigh Tesfatsion & Kenneth L. Judd (ed.), Handbook of Computational Economics, edition 1, volume 2, chapter 19, pages 949-1011
- Smith, Vernon L, 1982. "Microeconomic Systems as an Experimental Science," American Economic Review, American Economic Association, vol. 72(5), pages 923-55, December.
- Marco LiCalzi & Paolo Pellizzari, 2008. "Zero-Intelligence Trading without Resampling," Working Papers 164, Department of Applied Mathematics, Università Ca' Foscari Venezia.
- Dhananjay (Dan) K. Gode & Shyam Sunder, 2000.
"Double Auction Dynamics: Structural Effects Of Non-Binding Price Controls,"
Yale School of Management Working Papers
ysm1, Yale School of Management.
- Gode, Dhananjay (Dan) K. & Sunder, Shyam, 2004. "Double auction dynamics: structural effects of non-binding price controls," Journal of Economic Dynamics and Control, Elsevier, vol. 28(9), pages 1707-1731, July.
- Dhananjay K. & Shyam Sunder, 2004. "Double Auction Dynamics: Structural Effects of Non-binding Price Controls," Yale School of Management Working Papers ysm141, Yale School of Management, revised 01 Apr 2008.
- Sean Crockett & Stephen Spear & Shyam Sunder, 1899.
"Learning Competitive Equilibrium,"
GSIA Working Papers
2003-E18, Carnegie Mellon University, Tepper School of Business.
- Marco LiCalzi & Paolo Pellizzari, 2005.
"Simple market protocols for efficient risk sharing,"
- LiCalzi, Marco & Pellizzari, Paolo, 2007. "Simple market protocols for efficient risk sharing," Journal of Economic Dynamics and Control, Elsevier, vol. 31(11), pages 3568-3590, November.
- Marco LiCalzi & Paolo Pellizzari, 2006. "Simple Market Protocols for Efficient Risk Sharing," Working Papers 136, Department of Applied Mathematics, Università Ca' Foscari Venezia.
- Gode, Dhananjay K & Sunder, Shyam, 1997. "What Makes Markets Allocationally Efficient?," The Quarterly Journal of Economics, MIT Press, vol. 112(2), pages 603-30, May.
- Marco LiCalzi & Paolo Pellizzari, 2006. "The allocative effectiveness of market protocols under intelligent trading," Working Papers 134, Department of Applied Mathematics, Università Ca' Foscari Venezia.
- Mirowski, Philip, 2007. "Markets come to bits: Evolution, computation and markomata in economic science," Journal of Economic Behavior & Organization, Elsevier, vol. 63(2), pages 209-242, June.
- Hurwicz, Leonid & Radner, Roy & Reiter, Stanley, 1975.
"A Stochastic Decentralized Resource Allocation Process: Part II,"
Econometric Society, vol. 43(3), pages 363-93, May.
- Hurwicz, Leonid & Radner, Roy & Reiter, Stanley, 1975. "A Stochastic Decentralized Resource Allocation Process: Part I," Econometrica, Econometric Society, vol. 43(2), pages 187-221, March.
- Paul Brewer & Maria Huang & Brad Nelson & Charles Plott, 2002. "On the Behavioral Foundations of the Law of Supply and Demand: Human Convergence and Robot Randomness," Experimental Economics, Springer, vol. 5(3), pages 179-208, December.
- Maslov, Sergei, 2000. "Simple model of a limit order-driven market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 278(3), pages 571-578.
- Gode, Dhananjay K & Sunder, Shyam, 1993. "Allocative Efficiency of Markets with Zero-Intelligence Traders: Market as a Partial Substitute for Individual Rationality," Journal of Political Economy, University of Chicago Press, vol. 101(1), pages 119-37, February.
- Zhan, Wenjie & Friedman, Daniel, 2007. "Markups in double auction markets," Journal of Economic Dynamics and Control, Elsevier, vol. 31(9), pages 2984-3005, September.
- Gul, Faruk & Lundholm, Russell, 1995. "Endogenous Timing and the Clustering of Agents' Decisions," Journal of Political Economy, University of Chicago Press, vol. 103(5), pages 1039-66, October.
- Arifovic, Jasmina & Ledyard, John, 2007. "Call market book information and efficiency," Journal of Economic Dynamics and Control, Elsevier, vol. 31(6), pages 1971-2000, June.
- Alvin E. Roth, 2002. "The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics," Econometrica, Econometric Society, vol. 70(4), pages 1341-1378, July.
- Sunder, S., 1992. "Lower Bounds for Efficiency of Surplus Extraction in Double Auctions," GSIA Working Papers 1992-17, Carnegie Mellon University, Tepper School of Business.
- Roberto Cervone & Stefano Galavotti & Marco LiCalzi, 2009. "Symmetric Equilibria in Double Auctions with Markdown Buyers and Markup Sellers," Working Papers 187, Department of Applied Mathematics, Università Ca' Foscari Venezia.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marco LiCalzi).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.