{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:51:38Z","timestamp":1762102298621,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030015534"},{"type":"electronic","value":"9783030015541"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01554-1_13","type":"book-chapter","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T15:47:56Z","timestamp":1537890476000},"page":"227-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multi-sided Advertising Markets: Dynamic Mechanisms and Incremental User Compensations"],"prefix":"10.1007","author":[{"given":"Moran","family":"Feldman","sequence":"first","affiliation":[]},{"given":"Gonen","family":"Frim","sequence":"additional","affiliation":[]},{"given":"Rica","family":"Gonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.geb.2008.11.005","volume":"67","author":"I Ashlagi","year":"2009","unstructured":"Ashlagi, I., Monderer, D., Tennenholtz, M.: Mediators in position auctions. Games Econ. Behav. 67, 2\u201321 (2009)","journal-title":"Games Econ. Behav."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/1.9781611973068.135","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Moshe Babaioff","year":"2009","unstructured":"Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: SODA, pp. 1245\u20131254 (2009)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/2841227","volume":"4","author":"M Babaioff","year":"2016","unstructured":"Babaioff, M., Feldman, M., Tennenholtz, M.: Mechanism design with strategic mediators. ACM Trans. Econ. Comput. 4, 7:1\u20137:48 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"key":"13_CR4","unstructured":"Blum, A., Sandholm, T., Zinkevich, M.: Online algorithms for market clearing. In: SODA, pp. 971\u2013980 (2002)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1613\/jair.2303","volume":"30","author":"J Bredin","year":"2007","unstructured":"Bredin, J., Parkes, D., Duong, Q.: Chain: a dynamic double auction framework for matching patient agents. J. Artif. Intell. Res. 30, 133\u2013179 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-44777-2_22","volume-title":"Algorithms - ESA 2014","author":"M Charikar","year":"2014","unstructured":"Charikar, M., Henzinger, M., Nguyen, H.L.: Online bipartite matching with decomposable weights. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 260\u2013271. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_22"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1287\/mksc.1110.0691","volume":"31","author":"V Conitzer","year":"2012","unstructured":"Conitzer, V., Taylor, C.R., Wagman, L.: Hide and seek: costly consumer privacy in a market with repeat purchases. Mark. Sci. 31(2), 277\u2013292 (2012)","journal-title":"Mark. Sci."},{"key":"13_CR8","unstructured":"Facebook: CEO Mark Zuckerberg Testifies Before Senate on User Data (2018). https:\/\/m.youtube.com\/watch?v=qAZiDRonYZI"},{"key":"13_CR9","unstructured":"Feldman, M., Gonen, R.: Markets with strategic multi-minded mediators. CoRR abs\/1603.08717 (2016). http:\/\/arxiv.org\/abs\/1603.08717"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-99660-8_15","volume-title":"Algorithmic Game Theory","author":"M Feldman","year":"2018","unstructured":"Feldman, M., Gonen, R.: Removal and threshold pricing: truthful two-sided markets with multi-dimensional participants. In: Deng, X. (ed.) SAGT 2018. LNCS, vol. 11059, pp. 163\u2013175. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99660-8_15"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-22935-0_19","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M Feldman","year":"2011","unstructured":"Feldman, M., Naor, J.S., Schwartz, R.: Improved competitive ratios for submodular secretary problems (extended abstract). In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2011. LNCS, vol. 6845, pp. 218\u2013229. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22935-0_19"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1287\/moor.2017.0876","volume":"43","author":"M Feldman","year":"2018","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: A simple $$O$$(log log (rank))-competitive algorithm for the matroid secretary problem. Math. Oper. Res. 43(2), 638\u2013650 (2018)","journal-title":"Math. Oper. Res."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Gonen, M., Gonen, R., Pavlov, E.: Generalized trade reduction mechanisms. In: EC, pp. 20\u201329. ACM, New York (2007)","DOI":"10.1145\/1250910.1250914"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0531(92)90091-U","volume":"56","author":"RP McAfee","year":"1992","unstructured":"McAfee, R.P.: dominant strategy double auction. J. Econ. Theory 56, 434\u2013450 (1992)","journal-title":"J. Econ. Theory"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(83)90048-0","volume":"29","author":"RB Myerson","year":"1983","unstructured":"Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. J. Econ. Theory 29, 265\u2013281 (1983)","journal-title":"J. Econ. Theory"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: MUDA: a truthful multi-unit double-auction mechanism. In: Proceeding of AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11450"},{"key":"13_CR18","unstructured":"Stavrogiannis, L.C., Gerding, E.H., Polukarov, M.: Auction mechanisms for demand-side intermediaries in online advertising exchanges. In: AAMAS, pp. 5\u20139. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2014)"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/3040230.3040232","volume":"44","author":"R Vaze","year":"2016","unstructured":"Vaze, R., Coupechoux, M.: Online budgeted truthful matching. SIGMETRICS Perform. Eval. Rev. 44(3), 3\u20136 (2016)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0167-9236(98)00060-8","volume":"24","author":"P Wurman","year":"1998","unstructured":"Wurman, P., Walsh, W., Wellman, M.: Flexible double auctions for electronic commerce: theory and implementation. Decis. Support Syst. 24, 17\u201327 (1998)","journal-title":"Decis. Support Syst."}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01554-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:53:51Z","timestamp":1709823231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-01554-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030015534","9783030015541"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01554-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"26 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GameSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Decision and Game Theory for Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.gamesec-conf.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Three of the full papers and two of the short papers were submitted to a special track on Adversarial AI.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}