{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:30:59Z","timestamp":1763469059379,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662484326"},{"type":"electronic","value":"9783662484333"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48433-3_12","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T11:07:03Z","timestamp":1443092823000},"page":"150-162","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Signaling of Features in Auction Design"],"prefix":"10.1007","author":[{"given":"Shaddin","family":"Dughmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"O\u2019Donnell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Yang","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M., Braverman, M., Feldman, V., Klivans, A.R., Pitassi, T.: Learnability and automatizability. In: FOCS, pp. 621\u2013630 (2004)","DOI":"10.1109\/FOCS.2004.36"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-45046-4_1","volume-title":"Web and Internet Economics","author":"N Alon","year":"2013","unstructured":"Alon, N., Feldman, M., Gamzu, I., Tennenholtz, M.: The asymmetric matrix partition problem. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 1\u201314. Springer, Heidelberg (2013)"},{"key":"12_CR3","unstructured":"Blum, A.: Relevant examples and relevant features: Thoughts from computational learning theory. In: AAAI Fall Symposium on \u2018Relevance\u2019 (1994)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A.: Open problem: Learning a function of $$r$$ relevant variables. In: Proceedings of COLT, pp. 731\u2013733 (2003)","DOI":"10.1007\/978-3-540-45167-9_54"},{"key":"12_CR5","unstructured":"Blum, A.: Tutorial on Machine Learning Theory given at FOCS 2003 (2003). http:\/\/www.cs.cmu.edu\/ avrim\/Talks\/FOCS03\/"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., Rudich, S.: Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In: Proceedings of STOC, pp 253\u2013262 (1994)","DOI":"10.1145\/195058.195147"},{"issue":"1\u20132","key":"12_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"A Blum","year":"1997","unstructured":"Blum, A., Langley, P.: Selection of relevant features and examples in machine learning. Artif. Intel. 97(1\u20132), 245\u2013271 (1997)","journal-title":"Artif. Intel."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Immorlica, N., Roth, A.: Constrained signaling in auction design. In: ACM Symposium on Discrete Algorithms (SODA) (2014)","DOI":"10.1137\/1.9781611973402.99"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Emek, Y., Feldman, M., Gamzu, I., Paes-Leme, R., Tennenholtz, M.: Signaling schemes for revenue maximization. In: ACM Conference on Electronic Commerce (EC) (2012)","DOI":"10.1145\/2229012.2229051"},{"key":"12_CR10","first-page":"273","volume":"19","author":"V Feldman","year":"2011","unstructured":"Feldman, V., Lee, H., Servedio, R.: Lower bounds and hardness amplification for learning shallow monotone formulas. J. Mach. Learn. Res. - COLT Proceedings 19, 273\u2013292 (2011)","journal-title":"J. Mach. Learn. Res. - COLT Proceedings"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/070684914","volume":"39","author":"V Feldman","year":"2009","unstructured":"Feldman, V., Gopalan, P., Khot, S., Ponnuswami, A.K.: On agnostic learning of parities, monomials, and halfspaces. SIAM J. Comput. 39(2), 606\u2013645 (2009)","journal-title":"SIAM J. Comput."},{"key":"12_CR12","unstructured":"Feldman, V., Kothari, P., Vondr\u00e1k, J.: Nearly tight bounds on $$\\ell _1$$ approximation of self-bounding functions. CoRR, abs\/1404.4702 (2014)"},{"key":"12_CR13","unstructured":"Guo, M., Deligkas, A.: Revenue maximization via hiding item attributes. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 157\u2013163. AAAI Press (2013)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.2307\/1911865","volume":"50","author":"P Milgrom","year":"1982","unstructured":"Milgrom, P., Weber, R.J.: A theory of auctions and competitive bidding. Econometrica 50, 1089\u20131122 (1982)","journal-title":"Econometrica"},{"key":"12_CR15","unstructured":"Miltersen, P.B., Sheffet, O.: Send mixed signals: earn more, work less. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 234\u2013247. ACM (2012)"},{"key":"12_CR16","unstructured":"Mossel, E., O\u2019Donnell, R., Servedio, R.: Learning functions of $$k$$ relevant variables. J. Comput. Syst. Sci., 69(3), 421\u2013434 (2004). Previously published as \u201cLearning juntas\""},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Valiant, G.: Finding correlations in subquadratic time, with applications to learning parities and juntas. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 11\u201320. IEEE (2012)","DOI":"10.1109\/FOCS.2012.27"}],"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-48433-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T19:57:38Z","timestamp":1748635058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48433-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662484326","9783662484333"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48433-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}