{"id":"https://openalex.org/W4226372317","doi":"https://doi.org/10.1145/3486622.3493990","title":"Course Allocation with Friendships as an Asymmetric Distributed Constraint Optimization Problem","display_name":"Course Allocation with Friendships as an Asymmetric Distributed Constraint Optimization Problem","publication_year":2021,"publication_date":"2021-12-14","ids":{"openalex":"https://openalex.org/W4226372317","doi":"https://doi.org/10.1145/3486622.3493990"},"language":"en","primary_location":{"id":"doi:10.1145/3486622.3493990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3486622.3493990","pdf_url":null,"source":{"id":"https://openalex.org/S4363608074","display_name":"IEEE/WIC/ACM International Conference on Web Intelligence","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/WIC/ACM International Conference on Web Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088106551","display_name":"Ilya Khakhiashvili","orcid":null},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Ilya Khakhiashvili","raw_affiliation_strings":["Ariel University, Israel"],"affiliations":[{"raw_affiliation_string":"Ariel University, Israel","institution_ids":["https://openalex.org/I52170813"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043399288","display_name":"Tal Grinshpoun","orcid":"https://orcid.org/0000-0002-4106-3169"},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Tal Grinshpoun","raw_affiliation_strings":["Ariel University, Israel"],"affiliations":[{"raw_affiliation_string":"Ariel University, Israel","institution_ids":["https://openalex.org/I52170813"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031334659","display_name":"Lihi Dery","orcid":"https://orcid.org/0000-0002-8710-3349"},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Lihi Dery","raw_affiliation_strings":["Ariel University, Israel"],"affiliations":[{"raw_affiliation_string":"Ariel University, Israel","institution_ids":["https://openalex.org/I52170813"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088106551"],"corresponding_institution_ids":["https://openalex.org/I52170813"],"apc_list":null,"apc_paid":null,"fwci":0.308,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48544414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"688","last_page":"693"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9983000159263611,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9836999773979187,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/computer-science","display_name":"Computer science","score":0.712367057800293},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5834603905677795},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.506316065788269},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4112080931663513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13326090574264526}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.712367057800293},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5834603905677795},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.506316065788269},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4112080931663513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13326090574264526},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3486622.3493990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3486622.3493990","pdf_url":null,"source":{"id":"https://openalex.org/S4363608074","display_name":"IEEE/WIC/ACM International Conference on Web Intelligence","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/WIC/ACM International Conference on Web Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.5699999928474426,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1987891901","https://openalex.org/W1989580616","https://openalex.org/W2007779524","https://openalex.org/W2068115726","https://openalex.org/W2141256287","https://openalex.org/W2163316275","https://openalex.org/W2287429606","https://openalex.org/W2617656804","https://openalex.org/W2896517909","https://openalex.org/W3035016142","https://openalex.org/W3103899647","https://openalex.org/W3123638799","https://openalex.org/W3124371033","https://openalex.org/W3138915529","https://openalex.org/W4241237680"],"related_works":["https://openalex.org/W2998813341","https://openalex.org/W1587227328","https://openalex.org/W2160425906","https://openalex.org/W1596201972","https://openalex.org/W1880774266","https://openalex.org/W1485627940","https://openalex.org/W2028061998","https://openalex.org/W2152433827","https://openalex.org/W1986253068","https://openalex.org/W2385146268"],"abstract_inverted_index":{"Course":[0],"allocation,":[1],"i.e.,":[2],"the":[3,19,33,46,71,100,104],"problem":[4,47],"of":[5,83,125],"assigning":[6],"students":[7],"to":[8,18,73,121,132],"courses,":[9],"is":[10,63,115,130],"a":[11,27,66,123],"difficult":[12],"problem.":[13,54],"Students":[14],"value":[15],"being":[16],"assigned":[17],"same":[20],"course":[21],"as":[22,48],"their":[23,40],"friends.":[24],"We":[25,44],"propose":[26],"model":[28,86,114],"that":[29,94],"considers":[30],"not":[31],"only":[32],"students\u2019":[34],"preferences":[35,41,77,90],"over":[36,42,91],"courses":[37,92],"but":[38],"also":[39],"classmates.":[43],"formulate":[45],"an":[49,58],"asymmetric":[50],"distributed":[51,67],"constraint":[52],"optimization":[53],"This":[55],"solution":[56,105],"has":[57],"additional":[59],"interesting":[60],"feature:":[61],"it":[62,95,129],"solved":[64],"in":[65],"manner,":[68],"thus":[69],"removing":[70],"need":[72],"directly":[74],"share":[75],"private":[76],"with":[78],"anyone.":[79],"An":[80],"extensive":[81],"evaluation":[82],"our":[84],"proposed":[85],"on":[87],"real-world":[88],"student":[89],"shows":[93],"obtains":[96],"high":[97],"utility":[98],"for":[99],"students,":[101],"while":[102],"keeping":[103],"fair":[106],"and":[107,117],"observing":[108],"courses\u2019":[109],"seat":[110],"capacity":[111],"limitations.":[112],"Our":[113],"general":[116],"can":[118],"be":[119],"adapted":[120],"solve":[122],"variety":[124],"multi-allocation":[126],"problems":[127],"where":[128],"required":[131],"consider":[133],"friendships.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}