在预测市场中整合做市商、限价单和连续交易

Hoda Heidari, Sébastien Lahaie, David M. Pennock, Jennifer Wortman Vaughan
{"title":"在预测市场中整合做市商、限价单和连续交易","authors":"Hoda Heidari, Sébastien Lahaie, David M. Pennock, Jennifer Wortman Vaughan","doi":"10.1145/2764468.2764532","DOIUrl":null,"url":null,"abstract":"We provide the first concrete algorithm for combining market makers and limit orders in a prediction market with continuous trade. Our mechanism is general enough to handle both bundle orders and arbitrary securities defined over combinatorial outcome spaces. We define the notion of an e-fair trading path, a path in security space along which no order executes at a price more than e above its limit, and every order executes when its market price falls more than e below its limit. We show that, under a certain supermodularity condition, a fair trading path exists for which the endpoint is efficient, but that under general conditions reaching an efficient endpoint via an e-fair trading path is not possible. We develop an algorithm for operating a continuous market maker with limit orders that respects the e-fairness conditions in the general case. We conduct simulations of our algorithm using real combinatorial predictions made during the 2008 US presidential election and evaluate it against a natural baseline according to trading volume, social welfare, and violations of the two fairness conditions.","PeriodicalId":376992,"journal":{"name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Integrating Market Makers, Limit Orders, and Continuous Trade in Prediction Markets\",\"authors\":\"Hoda Heidari, Sébastien Lahaie, David M. Pennock, Jennifer Wortman Vaughan\",\"doi\":\"10.1145/2764468.2764532\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We provide the first concrete algorithm for combining market makers and limit orders in a prediction market with continuous trade. Our mechanism is general enough to handle both bundle orders and arbitrary securities defined over combinatorial outcome spaces. We define the notion of an e-fair trading path, a path in security space along which no order executes at a price more than e above its limit, and every order executes when its market price falls more than e below its limit. We show that, under a certain supermodularity condition, a fair trading path exists for which the endpoint is efficient, but that under general conditions reaching an efficient endpoint via an e-fair trading path is not possible. We develop an algorithm for operating a continuous market maker with limit orders that respects the e-fairness conditions in the general case. We conduct simulations of our algorithm using real combinatorial predictions made during the 2008 US presidential election and evaluate it against a natural baseline according to trading volume, social welfare, and violations of the two fairness conditions.\",\"PeriodicalId\":376992,\"journal\":{\"name\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2764468.2764532\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2764468.2764532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

我们提供了第一个在预测市场中结合做市商和限价单的具体算法。我们的机制足够通用,可以处理在组合结果空间上定义的捆绑订单和任意证券。我们定义了电子公平交易路径的概念,即在安全空间中没有任何订单在超过其限价e时执行,并且每个订单在其市场价格低于其限价e时执行。我们证明了在一定的超模块化条件下,存在一个端点是有效的公平交易路径,但在一般条件下,通过电子公平交易路径到达一个有效的端点是不可能的。我们开发了一种算法来操作一个具有限价单的连续做市商,该算法在一般情况下尊重电子公平条件。我们使用2008年美国总统大选期间的真实组合预测对我们的算法进行了模拟,并根据交易量、社会福利和违反两个公平条件对其进行了自然基线评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Integrating Market Makers, Limit Orders, and Continuous Trade in Prediction Markets
We provide the first concrete algorithm for combining market makers and limit orders in a prediction market with continuous trade. Our mechanism is general enough to handle both bundle orders and arbitrary securities defined over combinatorial outcome spaces. We define the notion of an e-fair trading path, a path in security space along which no order executes at a price more than e above its limit, and every order executes when its market price falls more than e below its limit. We show that, under a certain supermodularity condition, a fair trading path exists for which the endpoint is efficient, but that under general conditions reaching an efficient endpoint via an e-fair trading path is not possible. We develop an algorithm for operating a continuous market maker with limit orders that respects the e-fairness conditions in the general case. We conduct simulations of our algorithm using real combinatorial predictions made during the 2008 US presidential election and evaluate it against a natural baseline according to trading volume, social welfare, and violations of the two fairness conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信