{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:28:36Z","timestamp":1725474516105},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_18","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:41:09Z","timestamp":1164652869000},"page":"186-197","source":"Crossref","is-referenced-by-count":0,"title":["Games of Connectivity"],"prefix":"10.1007","author":[{"given":"Pradeep","family":"Dubey","sequence":"first","affiliation":[]},{"given":"Rahul","family":"Garg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Symposium on Foundations of Computer Science (FOCS 2004) (October 2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: ACM Symposium on Theory of Computing (STOC 2003), pp. 511\u2013520 (June 2003)","DOI":"10.1145\/780542.780617"},{"key":"18_CR3","first-page":"519","volume-title":"Encyclopaedia Brittanica, Macropaedia","author":"G. Birkhoff","year":"1977","unstructured":"Birkhoff, G.: Lattice theory. In: Encyclopaedia Brittanica, Macropaedia, vol.\u00a01, pp. 519\u2013524. Encyclopaedia Brittanica Inc., Helen Hemingway Benton, London (1977)"},{"key":"18_CR4","unstructured":"Dubey, P., Garg, R.: Games of connectivity. Technical Report RI04006, IBM Research Report (July 2004)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. In: ACM Symposium on Theory of Computing (STOC 2000), Portland, Oregon, USA (May 2004)","DOI":"10.1145\/335305.335332"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Shapley, L.: A value for n-person games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games. Annals of Mathematics Studies, vol.\u00a02(28) (1953)","DOI":"10.1515\/9781400881970-018"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"L. Shapley","year":"1971","unstructured":"Shapley, L.: Cores of convex games. International Journal of Game Theory\u00a01, 11\u201326 (1971)","journal-title":"International Journal of Game Theory"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Wang, Y., Zhu, Q.: Error control and concealment for video communications: A review. Proceedings of IEEE, special issue on Multimedia Signal Processing, 974\u2013997 (May 1998)","DOI":"10.1109\/5.664283"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:55Z","timestamp":1619507875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11944874_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}