{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:46:14Z","timestamp":1742953574115,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030169886"},{"type":"electronic","value":"9783030169893"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16989-3_5","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T19:44:24Z","timestamp":1554839064000},"page":"71-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-Level Cooperation in Network Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9393-3771","authenticated-orcid":false,"given":"Leon","family":"Petrosyan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5419-8436","authenticated-orcid":false,"given":"Artem","family":"Sedakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,2]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.comnet.2015.03.017","volume":"83","author":"K Avrachenkov","year":"2015","unstructured":"Avrachenkov, K., Elias, J., Martignon, F., Neglia, G., Petrosyan, L.: Cooperative network design: a nash bargaining solution approach. Comput. Netw. 83(4), 265\u2013279 (2015)","journal-title":"Comput. Netw."},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.jet.2006.06.006","volume":"135","author":"Y Bramoull\u00e9","year":"2007","unstructured":"Bramoull\u00e9, Y., Kranton, R.: Public goods in networks. J. Econ. Theory 135(1), 478\u2013494 (2007)","journal-title":"J. Econ. Theory"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.geb.2007.10.008","volume":"64","author":"D Corbae","year":"2008","unstructured":"Corbae, D., Duffy, J.: Experiments with network formation. Games Econ. Behav. 64, 81\u2013120 (2008)","journal-title":"Games Econ. Behav."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-22006-7_14","volume-title":"Automata, Languages and Programming","author":"M Dyer","year":"2011","unstructured":"Dyer, M., Mohanaraj, V.: Pairwise-interaction games. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 159\u2013170. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22006-7_14"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.geb.2004.01.005","volume":"50","author":"S Goyal","year":"2005","unstructured":"Goyal, S., Vega-Redondo, F.: Network formation and social coordination. Games Econ. Behav. 50, 178\u2013207 (2005)","journal-title":"Games Econ. Behav."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1007\/s11277-013-1086-z","volume":"72","author":"M Iturralde","year":"2013","unstructured":"Iturralde, M., Wei, A., Ali-Yahiya, T., et al.: Resource allocation for real time services in LTE networks: resource allocation using cooperative game theory and virtual token mechanism. Wirel. Pers. Commun. 72, 1415\u20131435 (2013)","journal-title":"Wirel. Pers. Commun."},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0899-8256(02)00504-3","volume":"41","author":"M Jackson","year":"2002","unstructured":"Jackson, M., Watts, A.: On the formation of interaction networks in social coordination games. Games Econ. Behav. 41(2), 265\u2013291 (2002)","journal-title":"Games Econ. Behav."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comnet.2015.05.006","volume":"87","author":"J Liao","year":"2015","unstructured":"Liao, J., Cui, Z., Wang, J., et al.: A coalitional game approach on improving interactions in multiple overlay environments. Comput. Netw. 87, 1\u201315 (2015)","journal-title":"Comput. Netw."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s11235-017-0289-0","volume":"66","author":"NKM Madi","year":"2017","unstructured":"Madi, N.K.M., Hanapi, Z.B.M., Othman, M., et al.: Two-level QoS-aware frame-based downlink resources allocation for RT\/NRT services fairness in LTE networks. Telecommun. Syst. 66, 357\u2013375 (2017)","journal-title":"Telecommun. Syst."},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1928","DOI":"10.1109\/TPWRS.2010.2044425","volume":"25","author":"YP Molina","year":"2010","unstructured":"Molina, Y.P., Prada, R.B., Saavedra, O.R.: Complex losses allocation to generators and loads based on circuit theory and Aumann-Shapley method. IEEE Trans. Power Syst. 25(4), 1928\u20131936 (2010)","journal-title":"IEEE Trans. Power Syst."},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"4568","DOI":"10.1109\/TPWRS.2013.2278296","volume":"28","author":"YP Molina","year":"2013","unstructured":"Molina, Y.P., Saavedra, O.R., Amar\u00eds, H.: Transmission network cost allocation based on circuit theory and the Aumann-Shapley method. IEEE Trans. Power Syst. 28(4), 4568\u20134577 (2013)","journal-title":"IEEE Trans. Power Syst."},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Petrosyan, L.A., Bulgakova, M.A., Sedakov, A.A.: Time-consistent solutions for two-stage network games with pairwise interactions. Mob. Netw. Appl. (2018). \n                    https:\/\/doi.org\/10.1007\/s11036-018-1127-7","DOI":"10.1007\/s11036-018-1127-7"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/s13235-015-0166-y","volume":"6","author":"LA Petrosyan","year":"2016","unstructured":"Petrosyan, L.A., Sedakov, A.A.: The subgame-consistent shapley value for dynamic network games with shock. Dyn. Games Appl. 6(4), 520\u2013537 (2016)","journal-title":"Dyn. Games Appl."},{"issue":"10","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1855","DOI":"10.1134\/S000511791610012X","volume":"77","author":"LA Petrosyan","year":"2016","unstructured":"Petrosyan, L.A., Sedakov, A.A., Bochkarev, A.O.: Two-stage network games. Autom. Remote Control 77(10), 1855\u20131866 (2016)","journal-title":"Autom. Remote Control"},{"key":"5_CR15","volume-title":"Theory of Games and Economic Behavior","author":"J Neumann Von","year":"1944","unstructured":"Von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1002\/cplx.21432","volume":"18","author":"F Xie","year":"2013","unstructured":"Xie, F., Cui, W., Lin, J.: Prisoners dilemma game on adaptive networks under limited foresight. Complexity 18, 38\u201347 (2013)","journal-title":"Complexity"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Game Theory for Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16989-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:41:32Z","timestamp":1558402892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16989-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030169886","9783030169893"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16989-3_5","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GameNets","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Game Theory for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamenets2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/gamenets.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}