{"id":"https://openalex.org/W4415428050","doi":"https://doi.org/10.3233/faia251234","title":"Approximately Stable Matching","display_name":"Approximately Stable Matching","publication_year":2025,"publication_date":"2025-10-21","ids":{"openalex":"https://openalex.org/W4415428050","doi":"https://doi.org/10.3233/faia251234"},"language":"en","primary_location":{"id":"doi:10.3233/faia251234","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251234","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/faia251234","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006325981","display_name":"Angelo Fanelli","orcid":"https://orcid.org/0000-0002-4896-6889"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Angelo Fanelli","raw_affiliation_strings":["CNRS, LAMSADE, University of Paris Dauphine-PSL, France"],"affiliations":[{"raw_affiliation_string":"CNRS, LAMSADE, University of Paris Dauphine-PSL, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108478652","display_name":"Luca Moscardelli","orcid":null},"institutions":[{"id":"https://openalex.org/I39387349","display_name":"University of Chieti-Pescara","ror":"https://ror.org/00qjgza05","country_code":"IT","type":"education","lineage":["https://openalex.org/I39387349"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Moscardelli","raw_affiliation_strings":["University of Chieti-Pescara, Italy"],"affiliations":[{"raw_affiliation_string":"University of Chieti-Pescara, Italy","institution_ids":["https://openalex.org/I39387349"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006325981"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.50401034,"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/T11269","display_name":"Algorithms and Data Compression","score":0.8596000075340271,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8596000075340271,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.854200005531311,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.8324000239372253,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.745199978351593},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6636999845504761},{"id":"https://openalex.org/keywords/stable-marriage-problem","display_name":"Stable marriage problem","score":0.6478000283241272},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.48570001125335693},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.46149998903274536},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.3968999981880188},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.37869998812675476}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.745199978351593},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6636999845504761},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.6478000283241272},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5874000191688538},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.525600016117096},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.48570001125335693},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.46149998903274536},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3968999981880188},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39640000462532043},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.37869998812675476},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3625999987125397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.299699991941452},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28060001134872437},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.2662000060081482},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.26179999113082886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25459998846054077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2531000077724457},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/faia251234","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251234","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"},{"id":"pmh:oai:HAL:hal-05368668v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05368668","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"The European Conference on Artificial Intelligence (ECAI 2025), Oct 2025, Bologna, Italy. ⟨10.3233/faia251234⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"doi:10.3233/faia251234","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251234","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":{"Many":[0],"allocation":[1],"and":[2,189],"matching":[3,23,36,129,226],"problems":[4,24],"(e.g.,":[5],"student-school":[6],"assignments,":[7],"job":[8],"allocation,":[9],"organ":[10],"donation)":[11],"involve":[12],"coupling":[13],"agents":[14,52,73,143],"based":[15],"on":[16,225],"mutual":[17],"preferences.":[18],"A":[19],"central":[20],"requirement":[21],"in":[22,103,156],"is":[25,30,37,48,99],"that":[26,29,62,172,206],"of":[27,51,115,121,142,191,210],"stability,":[28,116,212],"classically":[31],"defined":[32],"as":[33,95,130,198,200],"follows:":[34],"a":[35,45,49,67,112,128,163,179,219],"stable":[38,86,123,132,193],"if":[39,78,133],"no":[40,136,140],"blocking":[41,46],"pair":[42,47,50,141],"exists,":[43],"where":[44],"preferring":[53],"each":[54],"other":[55],"over":[56],"their":[57,148,157,196,201],"assigned":[58,149],"partners.":[59],"We":[60,181,204],"assume":[61],"matchings":[63,87],"are":[64,80,88],"constrained":[65],"by":[66,82,151,161],"given":[68],"undirected":[69],"acceptability":[70],"graph:":[71],"two":[72],"may":[74,176],"be":[75],"matched":[76],"only":[77],"they":[79],"connected":[81],"an":[83],"edge.":[84],"While":[85],"guaranteed":[89],"for":[90,222],"specific":[91],"graph":[92],"topologies,":[93],"such":[94],"bipartite":[96],"graphs,":[97],"stability":[98],"not":[100,177],"always":[101],"achievable":[102],"more":[104],"general":[105],"scenarios.":[106],"In":[107],"this":[108],"paper,":[109],"we":[110,126],"introduce":[111],"relaxed":[113],"notion":[114,209],"yielding":[117],"to":[118],"the":[119,170,187,207],"study":[120],"approximately":[122,131,192],"matching.":[124],"Specifically,":[125],"define":[127],"there":[134],"exists":[135],"k-blocking":[137],"pair,":[138],"i.e.,":[139],"who":[144],"could":[145],"both":[146],"improve":[147],"partners":[150],"at":[152],"least":[153],"k":[154],"positions":[155],"respective":[158],"preference":[159],"rankings,":[160],"forming":[162],"new":[164],"match":[165],"together.":[166],"This":[167],"refinement":[168],"captures":[169],"idea":[171],"small":[173],"agent":[174],"gains":[175],"justify":[178],"deviation.":[180],"provide":[182],"some":[183],"theoretical":[184],"results":[185],"about":[186],"existence":[188],"computability":[190],"matchings,":[194],"revealing":[195],"strengths":[197],"well":[199],"inherent":[202],"limitations.":[203],"believe":[205],"introduced":[208],"approximate":[211],"along":[213],"with":[214],"our":[215],"foundational":[216],"findings,":[217],"constitute":[218],"solid":[220],"basis":[221],"future":[223],"research":[224],"problems.":[227]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-24T00:00:00"}