Designing fuzzy utility-based double auctions using particle swarm optimization algorithm

M. A. Rigi, S. Mohammadi, Morteza Delgir
{"title":"Designing fuzzy utility-based double auctions using particle swarm optimization algorithm","authors":"M. A. Rigi, S. Mohammadi, Morteza Delgir","doi":"10.1109/IIT.2009.5413356","DOIUrl":null,"url":null,"abstract":"Auction refers to arbitrary resource allocation problems with self-motivated participants: Auctioneer and bidders. Double auction is a kind of auctions with multiple buyers and sellers who trade multiple goods. In double auction each trader submits his bid (price and quantity) to the auctioneer. Then the auctioneer collects all of the bids and tries to assign some buyers to some sellers according to their preferences in a way that the whole of the market reaches its maximum utility, this is called a mechanism. In a traditional double auction market each bid is a linear utility function, but in real world, behavior of buyers and sellers is not linear, therefore we propose a fuzzy non-linear utility function for traders because traders (like all humans) are thinking and making decisions in a fuzzy way. Our aim is to design an optimal double auction mechanism. To find optimum in this non-linear optimization problem, we use particle swarm optimization (PSO).","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Innovations in Information Technology (IIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIT.2009.5413356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Auction refers to arbitrary resource allocation problems with self-motivated participants: Auctioneer and bidders. Double auction is a kind of auctions with multiple buyers and sellers who trade multiple goods. In double auction each trader submits his bid (price and quantity) to the auctioneer. Then the auctioneer collects all of the bids and tries to assign some buyers to some sellers according to their preferences in a way that the whole of the market reaches its maximum utility, this is called a mechanism. In a traditional double auction market each bid is a linear utility function, but in real world, behavior of buyers and sellers is not linear, therefore we propose a fuzzy non-linear utility function for traders because traders (like all humans) are thinking and making decisions in a fuzzy way. Our aim is to design an optimal double auction mechanism. To find optimum in this non-linear optimization problem, we use particle swarm optimization (PSO).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于粒子群优化算法的模糊效用双拍卖设计
拍卖是指具有自我激励的参与者:拍卖人与竞买人之间的任意资源分配问题。双重拍卖是指交易多种商品的多个买家和卖家进行的拍卖。在双重拍卖中,每个交易商向拍卖人提交他的出价(价格和数量)。然后,拍卖师收集所有的出价,并试图根据他们的偏好将一些买家分配给一些卖家,以使整个市场达到其最大效用,这被称为机制。在传统的双拍卖市场中,每个出价都是一个线性效用函数,但在现实世界中,买卖双方的行为不是线性的,因此我们提出了一个模糊的非线性效用函数,因为交易者(和所有人一样)都是以模糊的方式思考和决策的。我们的目标是设计一个最优的双重拍卖机制。为了在非线性优化问题中找到最优解,我们使用了粒子群算法(PSO)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A software development tool for improving Quality of Service in Distributed Database Systems XQPoint: A queriable homomorphic XML compressor Design and simulation of a speech processor for cochlear implant based on Arabic language On popularity quality: Growth and decay phases of publication popularities Impact of applying realistic mobility models on the performance analysis of Internet gateway discovery approaches for Mobile Ad Hoc Networks
×
引用
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