{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:13:34Z","timestamp":1742919214285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030307929"},{"type":"electronic","value":"9783030307936"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30793-6_42","type":"book-chapter","created":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T23:05:00Z","timestamp":1571267100000},"page":"733-750","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Truthful Mechanisms for Multi Agent Self-interested Correspondence Selection"],"prefix":"10.1007","author":[{"given":"Nan","family":"Zhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terry R.","family":"Payne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Krysta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,17]]},"reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-44803-8_2","volume-title":"Algorithmic Game Theory","author":"M Adamczyk","year":"2014","unstructured":"Adamczyk, M., Sankowski, P., Zhang, Q.: Efficiency of truthful and symmetric mechanisms in one-sided matching. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 13\u201324. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44803-8_2"},{"issue":"1","key":"42_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10458-011-9184-3","volume":"26","author":"E Anshelevich","year":"2013","unstructured":"Anshelevich, E., Das, S., Naamad, Y.: Anarchy, stability, and utopia: creating better matchings. Auton. Agent. Multi-Agent Syst. 26(1), 120\u2013140 (2013)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.websem.2011.12.001","volume":"12","author":"M Atencia","year":"2012","unstructured":"Atencia, M., Schorlemmer, W.M.: An interaction-based approach to semantic alignment. J. Web Semant. 12, 131\u2013147 (2012)","journal-title":"J. Web Semant."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Roughgarden, T.: Welfare guarantees for combinatorial auctions with item bidding. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 700\u2013709. SIAM (2011)","DOI":"10.1137\/1.9781611973082.55"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: STOC, pp. 39\u201348 (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"42_CR6","unstructured":"Chocron, P., Schorlemmer, M.: Vocabulary alignment in openly specified interactions. In: International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 1064\u20131072 (2017)"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. LNCS, vol. 5125, pp. 820\u2013832. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_67"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 610\u2013618. ACM (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Euzenat, J.: Interaction-based ontology alignment repair with expansion and relaxation. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 185\u2013191 (2017)","DOI":"10.24963\/ijcai.2017\/27"},{"key":"42_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38721-0","volume-title":"Ontology Matching","author":"J Euzenat","year":"2013","unstructured":"Euzenat, J., Shvaiko, P.: Ontology Matching, 2nd edn. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38721-0","edition":"2"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fu, H., Gravin, N., Lucier, B.: Simultaneous auctions are (almost) efficient. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 201\u2013210. ACM (2013)","DOI":"10.1145\/2488608.2488634"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1613\/jair.3579","volume":"45","author":"BC Grau","year":"2012","unstructured":"Grau, B.C., Motik, B.: Reasoning over ontologies with hidden content: the import-by-query approach. J. Artif. Intell. Res. 45, 197\u2013255 (2012)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"42_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1006\/knac.1993.1008","volume":"5","author":"TR Gruber","year":"1993","unstructured":"Gruber, T.R.: A translation approach to portable ontology specifications. Knowl. Acquis. 5(2), 199\u2013220 (1993)","journal-title":"Knowl. Acquis."},{"key":"42_CR14","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"42_CR15","unstructured":"Jim\u00e9nez-Ruiz, E., Payne, T.R., Solimando, A., Tamma, V.: Limiting consistency and conservativity violations through negotiation. In: The 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), pp. 217\u2013226 (2016)"},{"key":"42_CR16","unstructured":"Jim\u00e9nez-Ruiz, E., Meilicke, C., Grau, B.C., Horrocks, I.: Evaluating mapping repair systems with large biomedical ontologies. In: 26th International Workshop on Description Logics, July 2013"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Krysta, P., Manlove, D., Rastegari, B., Zhang, J.: Size versus truthfulness in the house allocation problem. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 453\u2013470. ACM (2014)","DOI":"10.1145\/2600057.2602868"},{"issue":"1\u20132","key":"42_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. logist. Q."},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Laera, L., Blacoe, I., Tamma, V., Payne, T., Euzenat, J., Bench-Capon, T.: Argumentation over ontology correspondences in MAS. In: International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 1285\u20131292 (2007)","DOI":"10.1145\/1329125.1329400"},{"issue":"5","key":"42_CR20","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"DJ Lehmann","year":"2002","unstructured":"Lehmann, D.J., O\u2019Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5), 577\u2013602 (2002)","journal-title":"J. ACM"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Lucier, B., Borodin, A.: Price of anarchy for greedy auctions. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 537\u2013553. Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.46"},{"key":"42_CR22","unstructured":"Meilicke, C., Stuckenschmidt, H.: Analyzing mapping extraction approaches. In: Proceedings of the 2nd International Conference on Ontology Matching, pp. 25\u201336 (2007)"},{"key":"42_CR23","unstructured":"Mitra, P., Lin, P., Pan, C.: Privacy-preserving ontology matching. In: AAAI Workshop on Context and Ontologies, vol. WS-05-01, pp. 88\u201391 (2005)"},{"issue":"2","key":"42_CR24","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.geb.2007.12.009","volume":"64","author":"A Mu\u2019alem","year":"2008","unstructured":"Mu\u2019alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. Games Econ. Behav. 64(2), 612\u2013631 (2008)","journal-title":"Games Econ. Behav."},{"key":"42_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory, vol. 1. Cambridge University Press, Cambridge (2007)"},{"key":"42_CR26","unstructured":"Payne, T.R., Tamma, V.: Negotiating over ontological correspondences with asymmetric and incomplete knowledge. In: International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 517\u2013524 (2014)"},{"issue":"1","key":"42_CR27","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/TKDE.2011.253","volume":"25","author":"P Shvaiko","year":"2013","unstructured":"Shvaiko, P., Euzenat, J.: Ontology matching: state of the art and future challenges. IEEE Trans. Knowl. Data Eng. 25(1), 158\u2013176 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30793-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T23:16:47Z","timestamp":1729120607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30793-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307929","9783030307936"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30793-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semweb2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2019.semanticweb.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single- and Double 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":"283","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":"74","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":"0","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":"26% - 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":"3-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":"1-3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}