{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:10:41Z","timestamp":1743091841377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031290558"},{"type":"electronic","value":"9783031290565"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-29056-5_28","type":"book-chapter","created":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T15:02:23Z","timestamp":1679238143000},"page":"307-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Approach to\u00a0Resolve Social Dilemma in\u00a0P2P Networks"],"prefix":"10.1007","author":[{"given":"Avadh","family":"Kishor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajdeep","family":"Niyogi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,20]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Paul, A.M., Lange, V., Joireman, J., Parks, C.D., Van\u00a0Dijk, E.: The psychology of social dilemmas: a review. Organizational Behav. Human Decision Processes 120(2), 125\u2013141 (2013)","DOI":"10.1016\/j.obhdp.2012.11.003"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Messick, D.M., Brewer, M.B.: Solving social dilemmas: a review. Rev. Personal. Social Psychol. 4(1), 11\u201344 (1983)","DOI":"10.1037\/0022-3514.44.2.294"},{"key":"28_CR3","unstructured":"Komorita, S.S., Parks, C.D.: Social dilemmas. Brown & Benchmark (1994)"},{"key":"28_CR4","first-page":"505","volume":"10","author":"D Friedman","year":"1987","unstructured":"Friedman, D.: Problems in the provision of public goods. Harv. JL & Pub. Pol\u2019y 10, 505 (1987)","journal-title":"Harv. JL & Pub. Pol\u2019y"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1057\/jos.2011.11","volume":"6","author":"JS Hua","year":"2012","unstructured":"Hua, J.S., Huang, S.M., Yen, D.C., Chena, C.W.: A dynamic game theory approach to solve the free riding problem in the peer-to-peer networks. J. Simul. 6(1), 43\u201355 (2012)","journal-title":"J. Simul."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Kishor, A., Niyogi, R., Chronopoulos, A., Zomaya, A.: Latency and energy-aware load balancing in cloud data centers: a bargaining game based approach. IEEE Trans. Cloud Comput. 2168\u20137161 (2021)","DOI":"10.1145\/3412841.3442070"},{"issue":"4","key":"28_CR7","doi-asserted-by":"publisher","first-page":"2275","DOI":"10.1109\/TSC.2020.3044104","volume":"15","author":"A Kishor","year":"2022","unstructured":"Kishor, A., Niyogi, R., Veeravalli, B.: Fairness-aware mechanism for load balancing in distributed systems. IEEE Trans. Serv. Comput. 15(4), 2275\u20132288 (2022)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"28_CR8","unstructured":"Gintis, H.: Game theory evolving: A problem-centered introduction to modeling strategic behavior. Princeton university press (2000)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Fehr, E., Schmidt, K.M.: A theory of fairness, competition, and cooperation. The Quart. J. Econ. 114(3), 817\u2013868 (1999)","DOI":"10.1162\/003355399556151"},{"issue":"5","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1109\/TAC.2008.923662","volume":"53","author":"S Sanghavi","year":"2008","unstructured":"Sanghavi, S., Hajek, B.: A new mechanism for the free-rider problem. IEEE Trans. Autom. Control 53(5), 1176\u20131183 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Pass, R.: Iterated regret minimization: a new solution concept. Games and Economic Behavior 74(1), 184\u2013207 (2012)","DOI":"10.1016\/j.geb.2011.05.012"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10458-010-9122-9","volume":"22","author":"S De Jong","year":"2011","unstructured":"De Jong, S., Tuyls, K.: Human-inspired computational fairness. Auton. Agent. Multi-Agent Syst. 22(1), 103\u2013126 (2011)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Colasante, A., Russo, A.: Voting for the distribution rule in a public good game with heterogeneous endowments. J. Econ. Interact. Coord. 1\u201325 (2016)","DOI":"10.1007\/s11403-016-0172-1"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Masclet, D., Noussair, C.N., Villeval, M.C.: Threat and punishment in public good experiments. Econ. Inq. 51(2), 1421\u20131441 (2013)","DOI":"10.1111\/j.1465-7295.2011.00452.x"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Kishor, A., Niyogi, R.: A game-theoretic approach to solve the free-rider problem. In: 2017 Tenth International Conference on Contemporary Computing (IC3), pp. 1\u20136 (2022)","DOI":"10.1109\/IC3.2017.8284333"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Kishor, A., Gargt, T., Niyogi, R.: Altruistic decision making approach to resolve the tragedy of the commons. In: 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI), pp. 1858\u20131863 (2016)","DOI":"10.1109\/ICACCI.2016.7732320"},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11127-007-9252-z","volume":"135","author":"A Okada","year":"2008","unstructured":"Okada, A.: The second-order dilemma of public goods and capital accumulation. Public Choice 135(3), 165\u2013182 (2008)","journal-title":"Public Choice"},{"issue":"1593","key":"28_CR18","first-page":"1477","volume":"273","author":"T Killingback","year":"2006","unstructured":"Killingback, T., Bieri, J., Flatt, T.: Evolution in group-structured populations can resolve the tragedy of the commons. Proc. Royal Society London B: Biol. Sci. 273(1593), 1477\u20131481 (2006)","journal-title":"Proc. Royal Society London B: Biol. Sci."},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Fehr, E., G\u00e4chter, S.: Cooperation and punishment in public goods experiments (1999)","DOI":"10.2139\/ssrn.203194"},{"issue":"3","key":"28_CR20","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10888-011-9188-x","volume":"10","author":"L Ceriani","year":"2012","unstructured":"Ceriani, L., Verme, P.: The origins of the gini index: extracts from variabilit\u00e0 e mutabilit\u00e0 (1912) by corrado gini. J. Econ. Inequality 10(3), 421\u2013443 (2012)","journal-title":"J. Econ. Inequality"},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J. Global Optim. 39(3), 459\u2013471 (2007)","journal-title":"J. Global Optim."},{"issue":"3","key":"28_CR22","doi-asserted-by":"publisher","first-page":"3021","DOI":"10.1016\/j.asoc.2010.12.001","volume":"11","author":"D Karaboga","year":"2011","unstructured":"Karaboga, D., Akay, B.: A modified artificial bee colony (abc) algorithm for constrained optimization problems. Appl. Soft Comput. 11(3), 3021\u20133031 (2011)","journal-title":"Appl. Soft Comput."},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Akay, B.B., Karaboga, D.: Artificial bee colony algorithm variants on constrained optimization. Int. J. Optim. Contr. Theor. Appl. (IJOCTA) 7(1), 98\u2013111 (2017)","DOI":"10.11121\/ijocta.01.2017.00342"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Kalayci, C.B., Ertenlice, O., Akyer, H., Aygoren, H.: An artificial bee colony algorithm with feasibility enforcement and infeasibility toleration procedures for cardinality constrained portfolio optimization. Expert Syst. Appl. 85, 61\u201375 (2017)","DOI":"10.1016\/j.eswa.2017.05.018"},{"key":"28_CR25","unstructured":"Joines, J.A., Houck, C.R.: On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with ga\u2019s. In: IEEE World Congress on Computational Intelligence, pp. 579\u2013584 (1994)"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Bertsimas, D.: Vivek F Farias, and Nikolaos Trichakis. The price of fairness. Operations Res. 59(1), 17\u201331 (2011)","DOI":"10.1287\/opre.1100.0865"},{"issue":"3","key":"28_CR27","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.ejor.2016.08.013","volume":"257","author":"G Nicosia","year":"2017","unstructured":"Nicosia, G., Pacifici, A., Pferschy, U.: Price of fairness for allocating a bounded resource. Eur. J. Oper. Res. 257(3), 933\u2013943 (2017)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Networks and Systems","Advanced Information Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29056-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T15:05:34Z","timestamp":1679238334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29056-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031290558","9783031290565"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29056-5_28","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AINA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Information Networking and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Juiz de Fora","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aina2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/aina\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}