{"id":"https://openalex.org/W4415428011","doi":"https://doi.org/10.3233/faia251269","title":"Facilitating Matches on Allocation Platforms","display_name":"Facilitating Matches on Allocation Platforms","publication_year":2025,"publication_date":"2025-10-21","ids":{"openalex":"https://openalex.org/W4415428011","doi":"https://doi.org/10.3233/faia251269"},"language":null,"primary_location":{"id":"doi:10.3233/faia251269","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251269","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/faia251269","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012592879","display_name":"Yohai Trabelsi","orcid":"https://orcid.org/0000-0002-3533-5017"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yohai Trabelsi","raw_affiliation_strings":["Harvard University"],"affiliations":[{"raw_affiliation_string":"Harvard University","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019703184","display_name":"Abhijin Adiga","orcid":"https://orcid.org/0000-0002-9770-034X"},"institutions":[{"id":"https://openalex.org/I4210151352","display_name":"Biocom","ror":"https://ror.org/03ymdxs56","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210151352"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abhijin Adiga","raw_affiliation_strings":["Biocomplexity Institute, University of Virginia"],"affiliations":[{"raw_affiliation_string":"Biocomplexity Institute, University of Virginia","institution_ids":["https://openalex.org/I4210151352"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052726191","display_name":"Yonatan Aumann","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yonatan Aumann","raw_affiliation_strings":["Dept. of Computer Science, Bar-Ilan University"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Bar-Ilan University","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103213461","display_name":"Sarit Kraus","orcid":"https://orcid.org/0000-0003-4672-623X"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Sarit Kraus","raw_affiliation_strings":["Dept. of Computer Science, Bar-Ilan University"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Bar-Ilan University","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086740853","display_name":"S. S. Ravi","orcid":"https://orcid.org/0000-0002-0893-4364"},"institutions":[{"id":"https://openalex.org/I4210151352","display_name":"Biocom","ror":"https://ror.org/03ymdxs56","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210151352"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S.S. Ravi","raw_affiliation_strings":["Biocomplexity Institute, University of Virginia"],"affiliations":[{"raw_affiliation_string":"Biocomplexity Institute, University of Virginia","institution_ids":["https://openalex.org/I4210151352"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5012592879"],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.72364217,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.926800012588501,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.926800012588501,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5939000248908997},{"id":"https://openalex.org/keywords/facilitator","display_name":"Facilitator","score":0.590499997138977},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5745999813079834},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.5194000005722046},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5047000050544739},{"id":"https://openalex.org/keywords/preference-elicitation","display_name":"Preference elicitation","score":0.3831999897956848},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.34380000829696655},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.33889999985694885}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6506999731063843},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5939000248908997},{"id":"https://openalex.org/C2776831358","wikidata":"https://www.wikidata.org/wiki/Q1150166","display_name":"Facilitator","level":2,"score":0.590499997138977},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5745999813079834},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.5194000005722046},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5047000050544739},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4004000127315521},{"id":"https://openalex.org/C2777868144","wikidata":"https://www.wikidata.org/wiki/Q7239817","display_name":"Preference elicitation","level":3,"score":0.3831999897956848},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.33889999985694885},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.3174999952316284},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.27959999442100525},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C112930515","wikidata":"https://www.wikidata.org/wiki/Q4389547","display_name":"Risk analysis (engineering)","level":1,"score":0.2653999924659729},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia251269","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251269","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia251269","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251269","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,83,109,127,141,161],"consider":[1,84,136],"a":[2,17,67,111,129],"setting":[3],"where":[4],"goods":[5],"are":[6,106],"allocated":[7],"to":[8,24,38,81,96,98,121],"agents":[9,37,53],"by":[10,32,66],"way":[11],"of":[12,29,35,76,89,94,114,131,149,165,173],"an":[13,91],"allocation":[14,31,158],"platform":[15],"(e.g.,":[16],"matching":[18],"platform).":[19],"An":[20],"\u201callocation":[21],"facilitator\u201d":[22],"aims":[23],"increase":[25],"the":[26,30,45,48,61,72,85,101,115,118,123,150,163,171,174],"overall":[27],"utility/social-good":[28],"encouraging":[33],"(some":[34,40],"the)":[36],"relax":[39,99],"of)":[41],"their":[42],"restrictions.":[43],"At":[44],"same":[46],"time,":[47],"advice":[49],"must":[50],"not":[51],"hurt":[52],"who":[54],"would":[55],"otherwise":[56],"be":[57,64],"better":[58],"off.":[59],"Additionally,":[60],"facilitator":[62,124],"may":[63,79],"constrained":[65],"\u201cbound\u201d":[68],"(a.k.a.":[69],"\u2018budget\u2019),":[70],"limiting":[71],"number":[73],"and/or":[74],"type":[75],"restrictions":[77,95],"it":[78],"seek":[80],"relax.":[82],"facilitator\u2019s":[86],"optimization":[87,152],"problem":[88],"choosing":[90],"optimal":[92],"set":[93],"request":[97],"under":[100],"aforementioned":[102],"constraints.":[103],"Our":[104],"contributions":[105],"three-fold:":[107],"(i)":[108],"provide":[110,142],"formal":[112],"definition":[113],"problem,":[116],"including":[117,154],"participation":[119,132,176],"guarantees":[120,133],"which":[122],"should":[125],"adhere.":[126],"define":[128],"hierarchy":[130],"and":[134,156,168,170],"also":[135],"several":[137],"social-good":[138],"functions.":[139],"(ii)":[140],"polynomial":[143],"algorithms":[144],"for":[145],"solving":[146],"various":[147],"versions":[148],"associated":[151],"problems,":[153],"one-to-one":[155],"many-to-one":[157],"settings.":[159],"(iii)":[160],"demonstrate":[162],"benefits":[164],"such":[166],"facilitation":[167],"relaxation,":[169],"implications":[172],"different":[175],"guarantees,":[177],"using":[178],"extensive":[179],"experimentation":[180],"on":[181],"three":[182],"real-world":[183],"datasets.":[184]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-24T00:00:00"}
