{"entities":{"Q6560813":{"pageid":14171968,"ns":120,"title":"Item:Q6560813","lastrevid":99820478,"modified":"2026-06-05T20:46:43Z","type":"item","id":"Q6560813","labels":{"en":{"language":"en","value":"The complexity of finding fair many-to-one matchings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7870237"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560813$1D818FDC-F417-4782-9406-AC7109E6C2AA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"cac68fe591ee535f561f69a3d8902c2bd74cac60","datavalue":{"value":{"text":"The complexity of finding fair many-to-one matchings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6560813$217B5B06-68AC-4188-A716-5F0E3F4FAC9B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4895b41ee9958729e70c5c6c7c0deba66fe0767b","datavalue":{"value":{"entity-type":"item","numeric-id":2109957,"id":"Q2109957"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560813$ADBA5DF1-DB17-4D56-B189-C17C896D0D76","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bce12ff2d10f07f95e62db80eccb79f1a20d4a7a","datavalue":{"value":{"entity-type":"item","numeric-id":2032276,"id":"Q2032276"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560813$D8F9E366-8BAF-4CA1-87F4-C748627EE9F0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"aad9968298383135691f4dcdd005dbce68275c0d","datavalue":{"value":{"time":"+2024-06-24T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6560813$0B577685-51B2-4D20-B202-AA3216382EF5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1a86519cb3571ebce07f2774b2a00a0f17e12c3e","datavalue":{"value":"68Nxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560813$C49F5F53-8AF8-44AD-A9DD-2CADDF85B77E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560813$8C133245-CD19-4812-A4DA-661A8D391EC2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"96036f1d1874c3ea890a73f8011d44cf7d74ad3b","datavalue":{"value":"7870237","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560813$45C65D77-078C-4D61-88EF-7EBBBBDC2464","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bdf4dc3db86d44e89a36d3ec12340c2571d04f06","datavalue":{"value":"graph theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560813$D9CA42AE-4084-4056-9CF2-4DF60C1468D3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1a92166f5adeebffc8c81c6abb980ed495030be8","datavalue":{"value":"polynomial-time algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560813$CC4892C7-EE48-4302-A92F-27BFB2778BAC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c7d5e4886aa4290eca104cd0d1da319d8b4d34c4","datavalue":{"value":"NP-hardness","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560813$C71E63F9-567A-416D-B6E5-72F3772B0987","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"13fb8d01458ba05f5ee2bac394b7becfbbe52731","datavalue":{"value":"FPT","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560813$16B5368C-FBF4-48A8-B8AA-EBC878A7757A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8016cd761509aafa73dd1280752a5ec5e0e91d2a","datavalue":{"value":"ILP","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560813$ABCC66DB-5EA4-47FE-973C-922C31A3FF93","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3e746ec79fe9ad6cf1b905e9cb591d4969df6b87","datavalue":{"value":"color coding","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560813$86616CA6-CD56-4ADD-A77D-9556EE1EB451","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c109232848076e9e43901191391ca6354d5ae46d","datavalue":{"value":"submodular and supermodular functions","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560813$088C2F09-1DAC-4D6A-B56C-E6216D9DA4F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ddcd7a42d38075ed3300851875590fe8340f5b3a","datavalue":{"value":"algorithmic fairness","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560813$0D3F2A38-E772-48BC-8F62-3F38A624666A","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560813$AE08795D-FA01-4782-9527-8ED2C1E55B41","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"21a8d751bf5ac191baf36c24a0ae4b7438b838b1","datavalue":{"value":"10.4230/LIPICS.ICALP.2022.27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560813$5636A369-2DFA-4A56-B747-10B7A53FD305","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The complexity of finding fair many-to-one matchings (scientific article; zbMATH DE number 7870237)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_complexity_of_finding_fair_many-to-one_matchings_(scientific_article;_zbMATH_DE_number_7870237)"}}}}}