Empirical Mechanism Design for Optimizing Clearing Interval in Frequent Call Markets

Erik Brinkman, Michael P. Wellman
{"title":"Empirical Mechanism Design for Optimizing Clearing Interval in Frequent Call Markets","authors":"Erik Brinkman, Michael P. Wellman","doi":"10.1145/3033274.3085153","DOIUrl":null,"url":null,"abstract":"Several recent authors have advocated for financial markets to move from continuous clearing to discrete or batched clearing, as a way to defeat the latency arms race: the never-ending quest for small advantages in time to access markets. How frequently should such a modern batch auction clear? We conduct a systematic simulation-based investigation on the relationship between clearing frequency and metrics of market quality, such as allocative efficiency, comparing the performance of discrete and continuous auction mechanisms under empirical equilibrium behavior of all participating traders. In effect we perform empirical mechanism design on frequent batch auctions. We find that in a wide array of environments, equilibrium efficiency is improved for small positive intervals but falls off dramatically when there are too few opportunities to trade. The result is a large range of batch frequencies that are near optimally efficient; this range is wider in thick markets.","PeriodicalId":287551,"journal":{"name":"Proceedings of the 2017 ACM Conference on Economics and Computation","volume":"119 14","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3033274.3085153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Several recent authors have advocated for financial markets to move from continuous clearing to discrete or batched clearing, as a way to defeat the latency arms race: the never-ending quest for small advantages in time to access markets. How frequently should such a modern batch auction clear? We conduct a systematic simulation-based investigation on the relationship between clearing frequency and metrics of market quality, such as allocative efficiency, comparing the performance of discrete and continuous auction mechanisms under empirical equilibrium behavior of all participating traders. In effect we perform empirical mechanism design on frequent batch auctions. We find that in a wide array of environments, equilibrium efficiency is improved for small positive intervals but falls off dramatically when there are too few opportunities to trade. The result is a large range of batch frequencies that are near optimally efficient; this range is wider in thick markets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
频繁买入市场结算间隔优化的经验机制设计
最近有几位作者主张金融市场从连续清算转向离散或批量清算,以此作为击败延迟军备竞赛的一种方式:无休止地追求进入市场的小优势。这样的现代批量拍卖应该多久清场一次?我们对清算频率与市场质量指标(如配置效率)之间的关系进行了系统的模拟研究,比较了所有参与交易者在经验均衡行为下离散和连续拍卖机制的表现。实际上,我们对频繁的批量拍卖进行了经验机制设计。我们发现,在各种各样的环境中,均衡效率在较小的正区间内得到提高,但在交易机会过少时却急剧下降。其结果是接近最佳效率的大范围批频率;在市场较厚的情况下,这个区间会更宽。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation Making Right Decisions Based on Wrong Opinions Learning in the Repeated Secretary Problem Facilitating the Search for Partners on Matching Platforms: Restricting Agent Actions Deferred-Acceptance Auctions for Multiple Levels of Service
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1