改进的资源分配设计规则

P. Shabalin, Bernd Laqua, A. Pikovsky
{"title":"改进的资源分配设计规则","authors":"P. Shabalin, Bernd Laqua, A. Pikovsky","doi":"10.1109/CEC-EEE.2007.110","DOIUrl":null,"url":null,"abstract":"Iterative combinatorial auctions (ICA) have been getting raising attention both from researchers and in practice as they can increase efficiency of complex markets with substitute or complement valuations. This paper suggests several improvements for such auctions. We analyze the impact of these rules along several performance measurements using numerical experiments under various value models. Based on these experiments we select successful rules and consider their possible combinations.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Improved Rules for the Resource Allocation Design\",\"authors\":\"P. Shabalin, Bernd Laqua, A. Pikovsky\",\"doi\":\"10.1109/CEC-EEE.2007.110\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Iterative combinatorial auctions (ICA) have been getting raising attention both from researchers and in practice as they can increase efficiency of complex markets with substitute or complement valuations. This paper suggests several improvements for such auctions. We analyze the impact of these rules along several performance measurements using numerical experiments under various value models. Based on these experiments we select successful rules and consider their possible combinations.\",\"PeriodicalId\":58336,\"journal\":{\"name\":\"电子商务评论\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"电子商务评论\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC-EEE.2007.110\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"电子商务评论","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1109/CEC-EEE.2007.110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

迭代组合拍卖(ICA)由于可以通过替代或补充估值来提高复杂市场的效率,受到了学术界和实践界的广泛关注。本文对此类拍卖提出了几点改进建议。我们在不同的数值模型下使用数值实验来分析这些规则对几个性能测量的影响。在这些实验的基础上,我们选择了成功的规则,并考虑了它们可能的组合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improved Rules for the Resource Allocation Design
Iterative combinatorial auctions (ICA) have been getting raising attention both from researchers and in practice as they can increase efficiency of complex markets with substitute or complement valuations. This paper suggests several improvements for such auctions. We analyze the impact of these rules along several performance measurements using numerical experiments under various value models. Based on these experiments we select successful rules and consider their possible combinations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
20
期刊最新文献
IntegraL: Lightweight Link-Based Integration of Heterogeneous Digital Library Collections and Services in the Deep Web WSDL-D: A Flexible Web Service Invocation Mechanism for Large Datasets Restructuring Ontologies through Knowledge Discovery Resource Provisioning in an E-commerce Application Auction-Based Traffic Management: Towards Effective Concurrent Utilization of Road Intersections
×
引用
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