{"id":"https://openalex.org/W6944699959","doi":"https://doi.org/10.21227/yk16-zc80","title":"Preallocation simulation data (CA) for Multiconnective URLLC (Matlab)","display_name":"Preallocation simulation data (CA) for Multiconnective URLLC (Matlab)","publication_year":2022,"publication_date":"2022-03-25","ids":{"openalex":"https://openalex.org/W6944699959","doi":"https://doi.org/10.21227/yk16-zc80"},"language":"en","primary_location":{"id":"doi:10.21227/yk16-zc80","is_oa":true,"landing_page_url":"https://doi.org/10.21227/yk16-zc80","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"dataset"},"type":"dataset","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.21227/yk16-zc80","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Csercsik, D\u00e1vid","orcid":null},"institutions":[{"id":"https://openalex.org/I4210155320","display_name":"ELTE Centre for Economic and Regional Studies","ror":"https://ror.org/051ea1411","country_code":"HU","type":"facility","lineage":["https://openalex.org/I106118109","https://openalex.org/I4210155320"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Csercsik, D\u00e1vid","raw_affiliation_strings":["Centre for Economic and Regional Studies of the Hungarian Academy of Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Economic and Regional Studies of the Hungarian Academy of Sciences","institution_ids":["https://openalex.org/I4210155320","https://openalex.org/I7597260"]}]},{"author_position":"last","author":{"id":null,"display_name":"Jorswieck, Eduard","orcid":null},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jorswieck, Eduard","raw_affiliation_strings":["TU Braunschweig, Institute for Communications Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Braunschweig, Institute for Communications Technology","institution_ids":["https://openalex.org/I94509681"]}]}],"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":false,"cited_by_count":0,"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.7228000164031982},{"id":"https://openalex.org/keywords/auction-algorithm","display_name":"Auction algorithm","score":0.642799973487854},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6190999746322632},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5916000008583069},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4528000056743622},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.38850000500679016}],"concepts":[{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.7228000164031982},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6801000237464905},{"id":"https://openalex.org/C74979957","wikidata":"https://www.wikidata.org/wiki/Q4819604","display_name":"Auction algorithm","level":5,"score":0.642799973487854},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6190999746322632},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5916000008583069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.460999995470047},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4528000056743622},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4262000024318695},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.38850000500679016},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.37610000371932983},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3440000116825104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21227/yk16-zc80","is_oa":true,"landing_page_url":"https://doi.org/10.21227/yk16-zc80","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"dataset"}],"best_oa_location":{"id":"doi:10.21227/yk16-zc80","is_oa":true,"landing_page_url":"https://doi.org/10.21227/yk16-zc80","pdf_url":null,"source":{"id":"https://openalex.org/S7407051695","display_name":"IEEE DataPort","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"dataset"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Combinatorial":[0],"auction":[1,28,60,126],"algorithms":[2,104],"are":[3],"successfully":[4],"applied":[5],"for":[6,33],"channel":[7,35],"assignment":[8,36],"in":[9,140,168],"wireless":[10],"networks.":[11],"However,":[12],"their":[13],"computational":[14,94,159],"complexity":[15],"grows":[16],"fast":[17],"with":[18],"the":[19,45,55,59,66,79,83,86,92,111,115,124,133,141,144],"number":[20,46,87],"of":[21,40,47,58,68,82,88,114,123,135,143],"users":[22],"and":[23,52,91,102,119,150,156,170],"resources.":[24],"Therefore,":[25],"preallocation-based":[26],"combinatorial":[27,125],"represents":[29],"a":[30,120],"promising":[31],"approach":[32],"these":[34],"problems.":[37],"The":[38],"aim":[39],"preallocation":[41,70],"is":[42,130],"to":[43,75,98,162],"constrain":[44],"bids":[48],"submitted":[49],"by":[50],"participants,":[51],"thus":[53],"allow":[54],"numerical":[56],"feasibility":[57],"problem.In":[61],"this":[62],"paper":[63],"we":[64,109],"compare":[65],"performance":[67],"various":[69,76],"approaches":[71],"via":[72],"simulation":[73],"according":[74],"measures,":[77],"namely":[78],"total":[80,174],"utility":[81],"resulting":[84,167],"allocation,":[85],"unassigned":[89],"channels":[90],"required":[93],"time.":[95],"In":[96],"addition":[97],"simple":[99,163],"iterative":[100,164],"random":[101],"semi-random":[103],"which":[105,129],"serve":[106],"as":[107],"baseline,":[108],"consider":[110],"many-to-many":[112],"version":[113,122],"Gale-Shapley":[116],"(M2MGS)":[117],"algorithm":[118],"relaxed":[121],"(RCA)":[127],"algorithm,":[128],"based":[131],"on":[132],"clustering":[134],"channels.":[136],"We":[137],"conclude":[138],"that":[139],"case":[142],"most":[145],"complex":[146],"setups":[147],"analyzed,":[148],"M2MGS":[149],"RCA":[151],"can":[152],"bring":[153],"even":[154],"89.8":[155],"82.7":[157],"\\%":[158,172],"gain":[160],"compared":[161],"methods,":[165],"while":[166],"9.5":[169],"2.8":[171],"higher":[173],"utility.":[175]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}