{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:34Z","timestamp":1759847554033},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,10,19]],"date-time":"2014-10-19T00:00:00Z","timestamp":1413676800000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00224-014-9587-z","type":"journal-article","created":{"date-parts":[[2014,10,18]],"date-time":"2014-10-18T02:49:25Z","timestamp":1413600565000},"page":"238-260","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LP-Based Covering Games with Low Price of Anarchy"],"prefix":"10.1007","volume":"57","author":[{"given":"Georgios","family":"Piliouras","sequence":"first","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Valla","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3 A","family":"V\u00e9gh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,19]]},"reference":[{"issue":"1","key":"9587_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. Theory Comput. 4(1), 77\u2013109 (2008)","journal-title":"Theory Comput."},{"key":"9587_CR2","doi-asserted-by":"crossref","unstructured":"Balcan, M., Krehbiel, S., Piliouras, G., Shin, J.: Minimally invasive mechanism design: Distributed covering with carefully chosen advice. In: Proceedings of the IEEE 51st Annual Conference on Decision and Control (CDC), pp 2690\u20132695. IEEE (2012)","DOI":"10.1109\/CDC.2012.6426061"},{"issue":"2","key":"9587_CR3","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithm. 2(2), 198\u2013203 (1981)","journal-title":"J. Algorithm."},{"key":"9587_CR4","doi-asserted-by":"crossref","unstructured":"Baset, S., Schulzrinne, H.: An analysis of the skype peer-to-peer internet telephony protocol. In: Proceedings of the 25th IEEE International Conference on Computer Communications, pp 1\u201311 (2006)","DOI":"10.1109\/INFOCOM.2006.312"},{"key":"9587_CR5","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness. In: European Symposium on Algorithms (ESA), pp 17\u201328. Springer (2010)","DOI":"10.1007\/978-3-642-15781-3_2"},{"issue":"1","key":"9587_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s00224-009-9197-3","volume":"47","author":"N Buchbinder","year":"2010","unstructured":"Buchbinder, N., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative cost sharing games via subsidies. Theory Comput. Syst. 47(1), 15\u201337 (2010)","journal-title":"Theory Comput. Syst."},{"key":"9587_CR7","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Hoefer, M.: Selfish service installation in networks. In: Proceedings of the 2nd Workshop on Internet and Network Economics (WINE), pp 174\u2013185. Springer (2006)","DOI":"10.1007\/11944874_17"},{"issue":"16-18","key":"9587_CR8","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1016\/j.tcs.2010.02.005","volume":"411","author":"J Cardinal","year":"2010","unstructured":"Cardinal, J., Hoefer, M.: Non-cooperative facility location and covering games. Theor. Comput. Sci. 411(16-18), 1855\u20131876 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9587_CR9","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Gourves, L., Monnot, J.: On the impact of local taxes in a set cover game. In: Structural Information and Communication Complexity (SIROCCO), vol. 6058, p 2. Springer, New York (2010)","DOI":"10.1007\/978-3-642-13284-1_2"},{"issue":"2","key":"9587_CR10","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0166-218X(02)00458-4","volume":"131","author":"L Fleischer","year":"2003","unstructured":"Fleischer, L., Iwata, S.: A push-relabel framework for submodular function minimization and applications to parametric optimization. Discret. Appl. Math. 131(2), 311\u2013322 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9587_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(86)90016-8","volume":"15","author":"N Hall","year":"1986","unstructured":"Hall, N., Hochbaum, D.: A fast approximation algorithm for the multicovering problem. Discret. Appl. Math. 15(1), 35\u201340 (1986)","journal-title":"Discret. Appl. Math."},{"key":"9587_CR12","doi-asserted-by":"crossref","unstructured":"Harks, T., Peis, B.: Resource buying games. In: European Symposium on Algorithms (ESA), pp 563\u2013574 (2012)","DOI":"10.1007\/978-3-642-33090-2_49"},{"issue":"4","key":"9587_CR13","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s00453-009-9367-3","volume":"60","author":"M Hoefer","year":"2011","unstructured":"Hoefer, M.: Competitive cost sharing with economies of scale. Algorithmica 60(4), 743\u2013765 (2011)","journal-title":"Algorithmica"},{"key":"9587_CR14","doi-asserted-by":"crossref","unstructured":"Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: Foundations of Computer Science (FOCS), pp 671\u2013680. IEEE (2009)","DOI":"10.1109\/FOCS.2009.31"},{"key":"9587_CR15","doi-asserted-by":"crossref","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2- \u03b5. In: Computational Complexity, pp 379\u2013386. IEEE (2003)","DOI":"10.1109\/CCC.2003.1214437"},{"key":"9587_CR16","doi-asserted-by":"crossref","unstructured":"Koufogiannakis, C., Young, N.: Greedy \u0394-approximation algorithm for covering with arbitrary constraints and submodular cost. In: Automata, Languages and Programming, pp 634\u2013652. Springer (2009)","DOI":"10.1007\/978-3-642-02927-1_53"},{"key":"9587_CR17","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Symposium on Theoretical Aspects of Computer Science (STACS), pp 404\u2013413. Springer (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9587_CR18","unstructured":"Liang, J., Kumar, R., Ross, K.: The kazaa overlay: A measurement study. In: Proceedings of the 19th IEEE annual computer communications workshop, pp 2\u20139 (2004)"},{"key":"9587_CR19","doi-asserted-by":"crossref","unstructured":"Lo, V., Zhou, D., Liu, Y., GauthierDickey, C., Li, J.: Scalable supernode selection in peer-to-peer overlay networks. In: Proceedings of the 2nd International Workshop on Hot Topics in Peer-to-Peer Systems, pp. 18\u201327. IEEE Computer Society,Washington (2005)","DOI":"10.1109\/HOT-P2P.2005.17"},{"issue":"1","key":"9587_CR20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"9587_CR21","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: ACM Symposium on Theory of Computing (STOC), pp 513\u2013522. ACM (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"9587_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Schoppmann, F.: Local smoothness and the price of anarchy in atomic splittable congestion games. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 255\u2013267 (2011)","DOI":"10.1137\/1.9781611973082.22"},{"key":"9587_CR23","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin Heidelberg (2003)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9587-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9587-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9587-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T05:29:06Z","timestamp":1565933346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9587-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,19]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9587"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9587-z","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,19]]}}}