{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:42:34Z","timestamp":1725864154640},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_26","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"327-339","source":"Crossref","is-referenced-by-count":2,"title":["Designing Cost-Sharing Methods for Bayesian Games"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[]},{"given":"Alkmini","family":"Sgouritsa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-662-44777-2_2","volume-title":"Algorithms - ESA 2014","author":"F Abed","year":"2014","unstructured":"Abed, F., Correa, J.R., Huang, C.-C.: Optimal coordination mechanisms for multi-job scheduling games. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 13\u201324. Springer, Heidelberg (2014)"},{"issue":"4","key":"26_CR2","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","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. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-662-43948-7_16","volume-title":"Automata, Languages, and Programming","author":"S Bhattacharya","year":"2014","unstructured":"Bhattacharya, S., Kulkarni, J., Mirrokni, V.: Coordination mechanisms for selfish routing over time on a tree. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 186\u2013197. Springer, Heidelberg (2014)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Flammini, M., Moscardelli, L.: The price of stability for undirected broadcast network design with fair cost allocation is constant. In: FOCS, pp. 638\u2013647. IEEE (2013)","DOI":"10.1109\/FOCS.2013.74"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: An improved LP-based approximation for steiner tree. In: STOC, pp. 583\u2013592. ACM (2010)","DOI":"10.1145\/1806689.1806769"},{"issue":"5","key":"26_CR6","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"H Chen","year":"2010","unstructured":"Chen, H., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM J. Comput. 39(5), 1799\u20131832 (2010)","journal-title":"SIAM J. Comput."},{"issue":"36","key":"26_CR7","doi-asserted-by":"crossref","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. Theor. Comput. Sci. 410(36), 3327\u20133336 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1007\/978-3-540-70575-8_67","volume-title":"Automata, Languages and Programming","author":"G Christodoulou","year":"2008","unstructured":"Christodoulou, G., Kov\u00e1cs, A., Schapira, M.: Bayesian combinatorial auctions. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 820\u2013832. Springer, Heidelberg (2008)"},{"issue":"3","key":"26_CR9","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s00453-013-9753-8","volume":"69","author":"G Christodoulou","year":"2014","unstructured":"Christodoulou, G., Mehlhorn, K., Pyrga, E.: Improving the price of anarchy for selfish routing via coordination mechanisms. Algorithmica 69(3), 619\u2013640 (2014)","journal-title":"Algorithmica"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Sgouritsa, A.: Designing networks with good equilibria under uncertainty. In: SODA, pp. 72\u201389. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch6"},{"issue":"3","key":"26_CR11","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"26_CR12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.dss.2004.08.004","volume":"39","author":"NR Devanur","year":"2005","unstructured":"Devanur, N.R., Mihail, M., Vazirani, V.V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. Decis. Support Syst. 39(1), 11\u201322 (2005)","journal-title":"Decis. Support Syst."},{"issue":"1","key":"26_CR13","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/moor.1120.0567","volume":"38","author":"P Falkenhausen von","year":"2013","unstructured":"von Falkenhausen, P., Harks, T.: Optimal cost sharing for resource selection games. Math. Oper. Res. 38(1), 184\u2013208 (2013)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"26_CR14","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial walrasian equilibrium. In: STOC, pp. 61\u201370. ACM (2013)","DOI":"10.1145\/2488608.2488617"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial auctions via posted prices. In: SODA, pp. 123\u2013135. SIAM (2015)","DOI":"10.1137\/1.9781611973730.10"},{"key":"26_CR17","unstructured":"Garg, N., Gupta, A., Leonardi, S., Sankowski, P.: Stochastic analyses for online combinatorial optimization problems. In: SODA, pp. 942\u2013951. SIAM (2008)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-319-13129-0_6","volume-title":"Web and Internet Economics","author":"V Gkatzelis","year":"2014","unstructured":"Gkatzelis, V., Kollias, K., Roughgarden, T.: Optimal cost-sharing in weighted congestion games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 72\u201388. Springer, Heidelberg (2014)"},{"issue":"3","key":"26_CR19","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/100802888","volume":"42","author":"F Grandoni","year":"2013","unstructured":"Grandoni, F., Gupta, A., Leonardi, S., Miettinen, P., Sankowski, P., Singh, M.: Set covering with our eyes closed. SIAM J. Comput. 42(3), 808\u2013830 (2013)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"26_CR20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1006\/jeth.1999.2531","volume":"87","author":"F Gul","year":"1999","unstructured":"Gul, F., Stacchetti, E.: Walrasian equilibrium with gross substitutes. J. Econ. Theory 87(1), 95\u2013124 (1999)","journal-title":"J. Econ. Theory"},{"issue":"5","key":"26_CR21","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/mnsc.14.5.320","volume":"14","author":"JC Harsanyi","year":"1968","unstructured":"Harsanyi, J.C.: Games with incomplete information played by \u201cBayesian\u201d players, i-iii. part ii. Bayesian equilibrium points. Manage. Sci. 14(5), 320\u2013334 (1968)","journal-title":"Manage. Sci."},{"issue":"2","key":"26_CR22","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/1361192.1361201","volume":"4","author":"N Immorlica","year":"2008","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms 4(2), 24 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"26_CR23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"F Kelly","year":"1997","unstructured":"Kelly, F.: Charging and rate control for elastic traffic. Eur. Trans. Telecomm. 8(1), 33\u201337 (1997)","journal-title":"Eur. Trans. Telecomm."},{"issue":"6","key":"26_CR24","doi-asserted-by":"crossref","first-page":"1483","DOI":"10.2307\/1913392","volume":"50","author":"AS Kelso","year":"1982","unstructured":"Kelso, A.S., Crawford, V.P.: Job matching, coalition formation, and gross substitutes. Econometrica 50(6), 1483\u20131504 (1982)","journal-title":"Econometrica"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"15","key":"26_CR26","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1016\/j.ipl.2009.04.015","volume":"109","author":"J Li","year":"2009","unstructured":"Li, J.: An o(log(n)\/log(log(n))) upper bound on the price of stability for undirected shapley network design games. Inf. Process. Lett. 109(15), 876\u2013878 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"26_CR27","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Econ. Theory 18(3), 511\u2013533 (2001)","journal-title":"Econ. Theory"},{"issue":"1","key":"26_CR28","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/2737816","volume":"3","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. ACM Trans. Econ. Comput. 3(1), 6 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-3-540-68891-4_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"D Shmoys","year":"2008","unstructured":"Shmoys, D., Talwar, K.: A constant approximation algorithm for the a priori traveling salesman problem. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 331\u2013343. Springer, Heidelberg (2008)"},{"key":"26_CR30","unstructured":"Syrgkanis, V.: Price of stability in games of incomplete information. CoRR (2015)"},{"issue":"6","key":"26_CR31","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.orl.2007.02.005","volume":"35","author":"DP Williamson","year":"2007","unstructured":"Williamson, D.P., van Zuylen, A.: A simpler and better derandomization of an approximation algorithm for single source rent-or-buy. Oper. Res. Lett. 35(6), 707\u2013712 (2007)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:59:49Z","timestamp":1498341589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}