{"id":"https://openalex.org/W7126466297","doi":"https://doi.org/10.5555/3709347.3743566","title":"Computing Efficient and Envy-Free Allocations under Dichotomous Preferences using SAT","display_name":"Computing Efficient and Envy-Free Allocations under Dichotomous Preferences using SAT","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7126466297","doi":"https://doi.org/10.5555/3709347.3743566"},"language":"en","primary_location":{"id":"pmh:oai:dare.uva.nl:openaire/849349d0-b64f-4235-bba6-087a034884b1","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/computing-efficient-and-envyfree-allocations-under-dichotomous-preferences-using-sat(849349d0-b64f-4235-bba6-087a034884b1).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conati, A, Niskanen, A, de Haan, R & J\u00e4rvisalo, M 2025, Computing Efficient and Envy-Free Allocations under Dichotomous Preferences using SAT. in AAMAS '25 : Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems : May 19-23, 2025, Detroit, Michigan, USA. pp. 510-518, 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2025, Detroit, United States, 19/05/25. < https://www.ifaamas.org/Proceedings/aamas2025/pdfs/p510.pdf >","raw_type":"info:eu-repo/semantics/conferenceObject"},"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dare.uva.nl/personal/pure/en/publications/computing-efficient-and-envyfree-allocations-under-dichotomous-preferences-using-sat(849349d0-b64f-4235-bba6-087a034884b1).html","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114301752","display_name":"Ari Conati","orcid":"https://orcid.org/0000-0003-3023-3991"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Conati, Ari","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089559958","display_name":"Andreas Niskanen","orcid":"https://orcid.org/0000-0003-3197-2075"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Niskanen, Andreas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124479122","display_name":"R. de Haan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"de Haan, R.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"J\u00e4rvisalo, Matti","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J\u00e4rvisalo, Matti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79858501,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.006800000090152025,"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/T11031","display_name":"Game Theory and Applications","score":0.003800000064074993,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6151000261306763},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4569999873638153},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4564000070095062},{"id":"https://openalex.org/keywords/refining","display_name":"Refining (metallurgy)","score":0.30379998683929443},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2777000069618225}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6189000010490417},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6151000261306763},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4569999873638153},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4564000070095062},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40959998965263367},{"id":"https://openalex.org/C60044698","wikidata":"https://www.wikidata.org/wiki/Q1283324","display_name":"Refining (metallurgy)","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2759999930858612},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2711000144481659},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25619998574256897}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:dare.uva.nl:openaire/849349d0-b64f-4235-bba6-087a034884b1","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/computing-efficient-and-envyfree-allocations-under-dichotomous-preferences-using-sat(849349d0-b64f-4235-bba6-087a034884b1).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conati, A, Niskanen, A, de Haan, R & J\u00e4rvisalo, M 2025, Computing Efficient and Envy-Free Allocations under Dichotomous Preferences using SAT. in AAMAS '25 : Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems : May 19-23, 2025, Detroit, Michigan, USA. pp. 510-518, 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2025, Detroit, United States, 19/05/25. < https://www.ifaamas.org/Proceedings/aamas2025/pdfs/p510.pdf >","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:openaire/849349d0-b64f-4235-bba6-087a034884b1","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/computing-efficient-and-envyfree-allocations-under-dichotomous-preferences-using-sat(849349d0-b64f-4235-bba6-087a034884b1).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conati, A, Niskanen, A, de Haan, R & J\u00e4rvisalo, M 2025, Computing Efficient and Envy-Free Allocations under Dichotomous Preferences using SAT. in AAMAS '25 : Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems : May 19-23, 2025, Detroit, Michigan, USA. pp. 510-518, 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2025, Detroit, United States, 19/05/25. < https://www.ifaamas.org/Proceedings/aamas2025/pdfs/p510.pdf >","raw_type":"info:eu-repo/semantics/conferenceObject"},"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,21,36,63],"study":[1],"the":[2,10,26,50,68,74],"problems":[3],"of":[4,12,24,28,60,67,85],"computing":[5,44,53,78],"envy-free":[6,29,45,79],"Pareto-efficient":[7,30,46,55,80],"allocations":[8,56,81],"in":[9],"context":[11],"fair":[13],"allocation":[14],"and":[15,48,70],"hedonic":[16],"games":[17],"under":[18,57],"dichotomous":[19],"preferences.":[20],"establish":[22],"\u03a3p2-completeness":[23],"deciding":[25],"existence":[27],"allocations,":[31,47],"refining":[32],"earlier":[33],"related":[34],"results.":[35],"also":[37],"develop":[38],"iterative":[39],"SAT-based":[40],"exact":[41],"algorithms":[42,69],"for":[43],"extend":[49],"approach":[51,75],"to":[52,77,83],"minimum-envy":[54],"different":[58],"combinations":[59],"aggregation":[61],"functions.":[62],"provide":[64],"open-source":[65],"implementations":[66],"show":[71],"empirically":[72],"that":[73],"scales":[76],"up":[82],"hundreds":[84],"agents.":[86]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-02-02T00:00:00"}