{"id":"https://openalex.org/W6894416151","doi":"https://doi.org/10.5555/3545946.3599039","title":"The Complexity of Minimizing Envy in House Allocation","display_name":"The Complexity of Minimizing Envy in House Allocation","publication_year":2023,"publication_date":"2023-05-30","ids":{"openalex":"https://openalex.org/W6894416151","doi":"https://doi.org/10.5555/3545946.3599039"},"language":"en","primary_location":{"id":"pmh:oai:eprints.gla.ac.uk:293012","is_oa":true,"landing_page_url":"https://eprints.gla.ac.uk/view/author/67482.html>,","pdf_url":"https://eprints.gla.ac.uk/293012/2/293012.pdf","source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"},"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://eprints.gla.ac.uk/293012/2/293012.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Madathil, Jayakrishnan","orcid":null},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Madathil, Jayakrishnan","raw_affiliation_strings":["University of Glasgow Glasgow , United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Glasgow Glasgow , United Kingdom","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Misra, Neeldhara","orcid":null},"institutions":[{"id":"https://openalex.org/I27674431","display_name":"Indian Institute of Technology Gandhinagar","ror":"https://ror.org/0036p5w23","country_code":"IN","type":"education","lineage":["https://openalex.org/I27674431"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Misra, Neeldhara","raw_affiliation_strings":["IIT Gandhinagar Gandhinagar , India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Gandhinagar Gandhinagar , India","institution_ids":["https://openalex.org/I27674431"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sethia, Aditi","orcid":null},"institutions":[{"id":"https://openalex.org/I27674431","display_name":"Indian Institute of Technology Gandhinagar","ror":"https://ror.org/0036p5w23","country_code":"IN","type":"education","lineage":["https://openalex.org/I27674431"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sethia, Aditi","raw_affiliation_strings":["IIT Gandhinagar Gandhinagar , India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Gandhinagar Gandhinagar , India","institution_ids":["https://openalex.org/I27674431"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9483000040054321,"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.9483000040054321,"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/T11182","display_name":"Auction Theory and Applications","score":0.027499999850988388,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.013299999758601189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8723000288009644},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.47690001130104065},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.47429999709129333},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.34119999408721924},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3384000062942505},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.33079999685287476}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8723000288009644},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.47690001130104065},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.47429999709129333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4740999937057495},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42820000648498535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42419999837875366},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.390500009059906},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:eprints.gla.ac.uk:293012","is_oa":true,"landing_page_url":"https://eprints.gla.ac.uk/view/author/67482.html>,","pdf_url":"https://eprints.gla.ac.uk/293012/2/293012.pdf","source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"}],"best_oa_location":{"id":"pmh:oai:eprints.gla.ac.uk:293012","is_oa":true,"landing_page_url":"https://eprints.gla.ac.uk/view/author/67482.html>,","pdf_url":"https://eprints.gla.ac.uk/293012/2/293012.pdf","source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4226183444","display_name":"Beyond One Solution in Combinatorial Optimisation","funder_award_id":"EP/V032305/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320318581","display_name":"Indian Institute of Technology Gandhinagar","ror":"https://ror.org/0036p5w23"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6894416151.pdf","grobid_xml":"https://content.openalex.org/works/W6894416151.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,22,78],"house":[1,64,74],"allocation":[2,48],"problem":[3,104],"asks":[4],"for":[5,143,192,212],"m":[6],"houses":[7,28,51,165],"to":[8,52,76,98],"be":[9,30],"allocated":[10,75],"among":[11],"n":[12],"agents":[13,26,91,113],"so":[14],"that":[15,66,93,108,154],"every":[16],"agent":[17,55,58,85],"receives":[18,62],"exactly":[19],"one":[20],"house.":[21],"preferences":[23],"of":[24,35,50,80,90,105,112,128,138,164,169,179,204],"the":[25,73,88,102,110,117,125,136,162,167,177,180,187,193,202],"over":[27],"can":[29],"modeled":[31],"as":[32,147,149],"weak":[33],"orders,":[34],"which":[36],"two":[37],"special":[38],"cases":[39],"are":[40,115,157],"strict":[41,145],"rankings":[42,146],"and":[43,166,190,207],"binary":[44,150],"valuations.":[45,151],"Given":[46],"an":[47,54,84],"\u03a6":[49],"agents,":[53],"a":[56,61,63,86],"envies":[57,95],"b":[59,92],"if":[60],"\u03a6(a)":[65],"they":[67],"like":[68],"strictly":[69],"less":[70],"than":[71],"\u03a6(b),":[72],"b.":[77],"amount":[79,127],"envy":[81,119,129],"experienced":[82,120,130],"by":[83,121,131,161,173],"is":[87],"number":[89,111,163,168],"it":[94],"with":[96],"respect":[97],"\u03a6.":[99],"We":[100,134,152,196],"consider":[101,198],"computational":[103],"finding":[106],"allocations":[107],"minimize:":[109],"who":[114],"envious,":[116],"maximum":[118],"any":[122],"agent,":[123],"or":[124],"total":[126],"all":[132,139],"agents.":[133,170],"investigate":[135],"complexity":[137],"three":[140],"optimization":[141,181],"objectives":[142],"both":[144],"well":[148],"show":[153],"these":[155,199,213],"problems":[156,214],"FPT":[158],"when":[159],"parameterized":[160,172],"When":[171],"solution":[174],"size,":[175],"ie,":[176],"value":[178],"objective,":[182],"we":[183],"demonstrate":[184],"W-hardness":[185],"in":[186,201],"first":[188],"objective":[189],"para-NP-hardness":[191],"last":[194],"objective.":[195],"also":[197,208],"questions":[200],"setting":[203],"restricted":[205],"domains":[206],"suggest":[209],"practical":[210],"approaches":[211],"via":[215],"ILP":[216],"formulations.":[217]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-07-02T06:12:58.138171","created_date":"2025-10-10T00:00:00"}