A game-theoretic approach to solve the free-rider problem

Avadh Kishor, R. Niyogi
{"title":"A game-theoretic approach to solve the free-rider problem","authors":"Avadh Kishor, R. Niyogi","doi":"10.1109/IC3.2017.8284333","DOIUrl":null,"url":null,"abstract":"In this paper, we suggest a game-theoretic approach to alleviate the free-rider problem. In this approach, we model the free-rider problem as a constrained single objective optimization problem. We formally prove that in our proposed model, the free-rider problem can be solved completely. Moreover, we validate our proposed model using a meta heuristic algorithm — artificial bee colony (ABC) algorithm. To ensure the constraint is satisfied, we perform the experimental study using ABC algorithm. The experimental results are consistent with those obtained theoretically.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Tenth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2017.8284333","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we suggest a game-theoretic approach to alleviate the free-rider problem. In this approach, we model the free-rider problem as a constrained single objective optimization problem. We formally prove that in our proposed model, the free-rider problem can be solved completely. Moreover, we validate our proposed model using a meta heuristic algorithm — artificial bee colony (ABC) algorithm. To ensure the constraint is satisfied, we perform the experimental study using ABC algorithm. The experimental results are consistent with those obtained theoretically.
解决搭便车问题的博弈论方法
本文提出了一种缓解搭便车问题的博弈论方法。在这种方法中,我们将搭便车问题建模为一个有约束的单目标优化问题。我们正式证明了在我们提出的模型中,搭便车问题可以完全解决。此外,我们使用元启发式算法-人工蜂群(ABC)算法验证了我们提出的模型。为了满足约束条件,我们采用ABC算法进行了实验研究。实验结果与理论计算结果一致。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信