{"title":"解决搭便车问题的博弈论方法","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":"{\"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}","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}
A game-theoretic approach to solve the free-rider problem
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.