{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:08Z","timestamp":1725541808041},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_24","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"256-267","source":"Crossref","is-referenced-by-count":7,"title":["Pseudonyms in Cost-Sharing Games"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Penna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Schoppmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Fiat, A., Goldberg, A.V., Hartline, J.D., Immorlica, N., Sudan, M.: Derandomization of auctions. In: Proc. of 37th STOC (2005)","DOI":"10.1145\/1060590.1060682"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/11758471_19","volume-title":"Algorithms and Complexity","author":"Y. Bleischwitz","year":"2006","unstructured":"Bleischwitz, Y., Monien, B.: Fair cost-sharing methods for scheduling jobs on parallel machines. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 175\u2013186. Springer, Heidelberg (2006)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-77105-0_55","volume-title":"Internet and Network Economics","author":"Y. Bleischwitz","year":"2007","unstructured":"Bleischwitz, Y., Monien, B., Schoppmann, F.: To be or not to be (served). In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 515\u2013528. Springer, Heidelberg (2007)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-540-74456-6_58","volume-title":"Mathematical Foundations of Computer Science 2007","author":"Y. Bleischwitz","year":"2007","unstructured":"Bleischwitz, Y., Monien, B., Schoppmann, F., Tiemann, K.: The power of two prices: Beyond cross-monotonicity. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 657\u2013668. Springer, Heidelberg (2007)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, A., Friedman, E.: Sybilproof reputation mechanisms. In: Proc. of the 3rd Workshop on Economics of Peer-to-Peer Systems (P2PECON), pp. 128\u2013132 (2005)","DOI":"10.1145\/1080192.1080202"},{"key":"24_CR6","unstructured":"Cohen, B.: Incentives Build Robustness in BitTorrent. In: Proc. of the 1st Workshop on Economics of Peer-to-Peer Systems, P2PECON (2003)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Conitzer, V.: Limited verification of identities to induce false-name-proofness. In: Proc. of the 11th TARK, pp. 102\u2013111 (2007)","DOI":"10.1145\/1324249.1324265"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-79309-0_29","volume-title":"Algorithmic Game Theory","author":"S. Dobzinski","year":"2008","unstructured":"Dobzinski, S., Mehta, A., Roughgarden, T., Sundararajan, M.: Is Shapley Cost Sharing Optimal? In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 327\u2013336. Springer, Heidelberg (2008)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J.R. Douceur","year":"2002","unstructured":"Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 251\u2013260. Springer, Heidelberg (2002)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, M., Papadimitriou, C., Chuang, J., Stoica, I.: Free-riding and whitewashing in peer-to-peer systems. In: Proc. of ACM SIGCOMM workshop PINS, pp. 228\u2013236 (2004)","DOI":"10.1145\/1016527.1016539"},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/105864001300122476","volume":"10","author":"E. Friedman","year":"2001","unstructured":"Friedman, E., Resnick, P.: The social cost of cheap pseudonyms. Journal of Economics and Management Strategy\u00a010(2), 173\u2013199 (2001)","journal-title":"Journal of Economics and Management Strategy"},{"key":"24_CR12","unstructured":"Goldberg, A., Hartline, J.: Collusion-resistant mechanisms for single-parameter agents. In: Proc. of the 16th SODA, pp. 620\u2013629 (2005)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Gottlieb, D.H.: A certain class of incidence matrices. In: Proc. Amer. Math. Soc., pp. 1233\u20131237 (1966)","DOI":"10.1090\/S0002-9939-1966-0204305-9"},{"key":"24_CR14","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost sharing schemes. In: Proc. of the 16th SODA, pp. 602\u2013611 (2005)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Passive and Active Network Measurement","author":"M. Izal","year":"2004","unstructured":"Izal, M., Urvoy-Keller, G., Biersack, E., Felber, P., Hamra, A., Garces-Erice, L.: Dissecting BitTorrent: Five Months in a Torrent\u2019s Lifetime. In: Barakat, C., Pratt, I. (eds.) PAM 2004. LNCS, vol.\u00a03015, pp. 1\u201311. Springer, Heidelberg (2004)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Applications of approximation algorithms to cooperative games. In: Proc. of the 33rd STOC, pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"24_CR17","unstructured":"Juarez, R.: Collusion-proof cost sharing. Technical report, Mimeo University of Hawaii (2007)"},{"key":"24_CR18","unstructured":"Juarez, R.: Group strategyproof cost sharing: the role of indifferences. Technical report, Mimeo University of Hawaii (2008)"},{"key":"24_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics With Applications in Computer Science","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics With Applications in Computer Science. Springer, Heidelberg (2001)"},{"issue":"5","key":"24_CR20","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1137\/050646408","volume":"37","author":"J. K\u00f6nemann","year":"2008","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G., van Zwam, S.H.M.: A group-strategyproof cost sharing mechanism for the steiner forest game. SIAM J. Comput.\u00a037(5), 1319\u20131341 (2008)","journal-title":"SIAM J. Comput."},{"key":"24_CR21","unstructured":"Locher, T., Moor, P., Schmid, S., Wattenhofer, R.: Free Riding in BitTorrent is Cheap. In: Proc. of the 5th HotNets (2006)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Mehta, A., Roughgarden, T., Sundararajan, M.: Beyond Moulin Mechanisms. In: Proc. of ACM EC, pp. 1\u201310 (2007)","DOI":"10.1145\/1250910.1250912"},{"issue":"2","key":"24_CR23","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s003550050145","volume":"16","author":"H. Moulin","year":"1999","unstructured":"Moulin, H.: Incremental cost sharing: characterization by coalition strategy-proofness. Social Choice and Welfare\u00a016(2), 279\u2013320 (1999)","journal-title":"Social Choice and Welfare"},{"issue":"3","key":"24_CR24","doi-asserted-by":"publisher","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. Economic Theory\u00a018(3), 511\u2013533 (2001)","journal-title":"Economic Theory"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Newsome, J., Shi, E., Song, D., Perrig, A.: The sybil attack in sensor networks: analysis & defenses. In: Proc. of the 3rd IPSN, pp. 259\u2013268 (2004)","DOI":"10.1145\/984622.984660"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Penna, P., Schoppmann, F., Silvestri, R., Widmayer, P.: Pseudonyms in cost-sharing games. Technical report, AEOLUS (2009), http:\/\/aeolus.ceid.upatras.gr\/","DOI":"10.1007\/978-3-642-10841-9_24"},{"key":"24_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-31833-0_10","volume-title":"Approximation and Online Algorithms","author":"P. Penna","year":"2005","unstructured":"Penna, P., Ventre, C.: More powerful and simpler cost-sharing methods. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 97\u2013110. Springer, Heidelberg (2005)"},{"key":"24_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11672142_27","volume-title":"STACS 2006","author":"P. Penna","year":"2006","unstructured":"Penna, P., Ventre, C.: The algorithmic structure of group strategyproof budget-balanced cost-sharing mechanisms. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 337\u2013348. Springer, Heidelberg (2006)"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: New trade-offs in cost-sharing mechanisms. In: Proc. of the 38th STOC, pp. 79\u201388 (2006)","DOI":"10.1145\/1132516.1132528"},{"key":"24_CR30","unstructured":"Wagman, L., Conitzer, V.: Optimal false-name-proof voting rules with costly voting. In: Proc. of 23rd AAAI, pp. 190\u2013195 (2008)"},{"key":"24_CR31","unstructured":"Yokoo, M.: Characterization of Strategy\/False-name Proof Combinatorial Auction Protocols: Price-oriented, Rationing-free Protocol. In: Proc. of the 18th IJCAI, pp. 733\u2013742 (2003)"},{"issue":"1","key":"24_CR32","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/S0899-8256(03)00045-9","volume":"46","author":"M. Yokoo","year":"2004","unstructured":"Yokoo, M., Sakurai, Y., Matsubara, S.: The Effect of False-name Bids in Combinatorial Auctions: New Fraud in Internet Auctions. Games and Economic Behavior\u00a046(1), 174\u2013188 (2004)","journal-title":"Games and Economic Behavior"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:35:33Z","timestamp":1606185333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}