{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:03:40Z","timestamp":1760299420254,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"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_23","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"289-301","source":"Crossref","is-referenced-by-count":2,"title":["Bribeproof Mechanisms for Two-Values Domains"],"prefix":"10.1007","author":[{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: Proceedings of the IEEE FOCS, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"issue":"2","key":"23_CR2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/moor.1110.0534","volume":"37","author":"I Ashlagi","year":"2012","unstructured":"Ashlagi, I., Dobzinski, S., Lavi, R.: Optimal lower bounds for anonymous scheduling mechanisms. Math. Oper. Res. 37(2), 244\u2013258 (2012)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"23_CR3","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1016\/j.jet.2012.01.021","volume":"147","author":"J Chen","year":"2012","unstructured":"Chen, J., Micali, S.: Collusive dominant-strategy truthfulness. J. Econ. Theory 147(3), 1300\u20131312 (2012)","journal-title":"J. Econ. Theory"},{"issue":"4","key":"23_CR4","doi-asserted-by":"crossref","first-page":"1572","DOI":"10.1137\/120866038","volume":"42","author":"G Christodoulou","year":"2013","unstructured":"Christodoulou, G., Kov\u00e1cs, A.: A deterministic truthful PTAS for scheduling related machines. SIAM J. Comput. 42(4), 1572\u20131595 (2013)","journal-title":"SIAM J. Comput."},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.jet.2014.04.006","volume":"156","author":"S Dobzinski","year":"2015","unstructured":"Dobzinski, S., Nisan, N.: Multi-unit auctions: beyond roberts. J. Econ. Theory 156, 14\u201344 (2015)","journal-title":"J. Econ. Theory"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Gkatzelis, V., Roughgarden, T.: The performance of deferred-acceptance auctions. In: Proceedings of the 15th ACM EC, pp. 187\u2013204 (2014)","DOI":"10.1145\/2600057.2602861"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-540-77918-6_2","volume-title":"Approximation and Online Algorithms","author":"I Gamzu","year":"2008","unstructured":"Gamzu, I.: Improved lower bounds for non-utilitarian truthfulness. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 15\u201326. Springer, Heidelberg (2008)"},{"key":"23_CR8","unstructured":"Goldberg, A.V., Hartline, J.D.: Collusion-resistant mechanisms for single-parameter agents. In: Proceedings of the 16th SODA, pp. 620\u2013629 (2005)"},{"key":"23_CR9","unstructured":"Goldberg, P.W., Ventre, C.: Using lotteries to approximate the optimal revenue. In: Proceedings of the AAMAS, pp. 643\u2013650 (2013)"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.geb.2013.07.005","volume":"82","author":"R Juarez","year":"2013","unstructured":"Juarez, R.: Group strategyproof cost sharing: the role of indifferences. Games Econ. Behav. 82, 218\u2013239 (2013)","journal-title":"Games Econ. Behav."},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/978-3-540-74456-6_41","volume-title":"Mathematical Foundations of Computer Science 2007","author":"E Koutsoupias","year":"2007","unstructured":"Koutsoupias, E., Vidali, A.: A lower bound of 1 + $$\\phi $$ for truthful scheduling mechanisms. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 454\u2013464. Springer, Heidelberg (2007)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Lavi, R., Mu\u2019Alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: Proceedings of FOCS, pp. 574\u2013583 (2003)","DOI":"10.1109\/SFCS.2003.1238230"},{"issue":"1","key":"23_CR13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.geb.2008.08.001","volume":"67","author":"R Lavi","year":"2009","unstructured":"Lavi, R., Swamy, C.: Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. Games Econ. Behav. 67(1), 99\u2013124 (2009)","journal-title":"Games Econ. Behav."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Mihal\u00e1k, M., Penna, P., Widmayer, P.: Bribeproof mechanisms for two-values domains. CoRR, abs\/1512.04277 (2015)","DOI":"10.1007\/978-3-662-53354-3_23"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Milgrom, P., Segal, I.: Deferred-acceptance auctions and radio spectrum reallocation. In: Proceedings of the 15th ACM EC, pp. 185\u2013186 (2014)","DOI":"10.1145\/2600057.2602834"},{"issue":"1","key":"23_CR16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00199-002-0267-x","volume":"22","author":"H Mizukami","year":"2003","unstructured":"Mizukami, H.: On the constancy of bribe-proof solutions. Econ. Theory 22(1), 211\u2013217 (2003)","journal-title":"Econ. Theory"},{"issue":"2","key":"23_CR17","doi-asserted-by":"crossref","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. Soc. Choice Welfare 16(2), 279\u2013320 (1999)","journal-title":"Soc. Choice Welfare"},{"key":"23_CR18","unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: Proceedings of ACM SODA, pp. 1143\u20131152 (2007)"},{"issue":"2","key":"23_CR19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s00355-013-0733-3","volume":"42","author":"C Mukherjee","year":"2014","unstructured":"Mukherjee, C.: Fair and group strategy-proof good allocation with money. Soc. Choice Welfare 42(2), 289\u2013311 (2014)","journal-title":"Soc. Choice Welfare"},{"key":"23_CR20","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6, 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"key":"23_CR21","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35, 166\u2013196 (2001)","journal-title":"Games Econ. Behav."},{"issue":"3","key":"23_CR22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s001820000046","volume":"29","author":"S Ohseto","year":"2000","unstructured":"Ohseto, S.: Strategy-proof and efficient allocation of an indivisible good on finitely restricted preference domains. Int J. Game Theory 29(3), 365\u2013374 (2000)","journal-title":"Int J. Game Theory"},{"key":"23_CR23","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.geb.2012.09.002","volume":"86","author":"P Penna","year":"2014","unstructured":"Penna, P., Ventre, C.: Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. 86, 491\u2013509 (2014)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"23_CR24","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1007\/s00453-011-9602-6","volume":"63","author":"E Pountourakis","year":"2012","unstructured":"Pountourakis, E., Vidali, A.: A complete characterization of group-strategyproof mechanisms of cost-sharing. Algorithmica 63(4), 831\u2013860 (2012)","journal-title":"Algorithmica"},{"key":"23_CR25","unstructured":"Roberts, K.: The characterization of implementable choice rules. In:Aggregation and Revelation of Preferences, pp. 321\u2013348 (1979)"},{"issue":"2","key":"23_CR26","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1006\/game.1999.0718","volume":"30","author":"J Schummer","year":"2000","unstructured":"Schummer, J.: Eliciting preferences to assign positions and compensation. Games Econ. Behav. 30(2), 293\u2013318 (2000)","journal-title":"Games Econ. Behav."},{"issue":"3","key":"23_CR27","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jeth.1999.2618","volume":"91","author":"J Schummer","year":"2000","unstructured":"Schummer, J.: Manipulation through bribes. J. Econ. Theory 91(3), 180\u2013198 (2000)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"23_CR28","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s00355-006-0099-x","volume":"26","author":"S Serizawa","year":"2006","unstructured":"Serizawa, S.: Pairwise strategy-proofness and self-enforcing manipulation. Soc. Choice Welfare 26(2), 305\u2013331 (2006)","journal-title":"Soc. Choice Welfare"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Wakayama, T.: Bribe-proof division of a private good. SSRN 2349605 (2013). http:\/\/dx.doi.org\/10.2139\/ssrn.2349605","DOI":"10.2139\/ssrn.2349605"}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:43:51Z","timestamp":1749573831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}