{"id":"https://openalex.org/W2007607403","doi":"https://doi.org/10.1109/icassp.2010.5496080","title":"Pareto-optimal solutions of Nash bargaining resource allocation games with spectral mask and total power constraints","display_name":"Pareto-optimal solutions of Nash bargaining resource allocation games with spectral mask and total power constraints","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2007607403","doi":"https://doi.org/10.1109/icassp.2010.5496080","mag":"2007607403"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2010.5496080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2010.5496080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5086403520","display_name":"Jie Gao","orcid":"https://orcid.org/0000-0001-6095-2968"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jie Gao","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, T6G 2V4, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, T6G 2V4, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055234860","display_name":"Sergiy A. Vorobyov","orcid":"https://orcid.org/0000-0001-7249-647X"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sergiy A. Vorobyov","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, T6G 2V4, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, T6G 2V4, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022850202","display_name":"Hai Jiang","orcid":"https://orcid.org/0000-0003-1042-4897"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hai Jiang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, T6G 2V4, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, T6G 2V4, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3146","last_page":"3149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9980000257492065,"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/T12592","display_name":"Opinion Dynamics and Social Influence","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7160530090332031},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7133487462997437},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.6322976350784302},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6037248969078064},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5680735111236572},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.5673624873161316},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.5418400168418884},{"id":"https://openalex.org/keywords/bargaining-problem","display_name":"Bargaining problem","score":0.5117497444152832},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5031933188438416},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.4623613953590393},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43583494424819946},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4160485565662384},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.2254319190979004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2116982340812683},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17016929388046265},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08203557133674622}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7160530090332031},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7133487462997437},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6322976350784302},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6037248969078064},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5680735111236572},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.5673624873161316},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.5418400168418884},{"id":"https://openalex.org/C90376892","wikidata":"https://www.wikidata.org/wiki/Q1516247","display_name":"Bargaining problem","level":2,"score":0.5117497444152832},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5031933188438416},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.4623613953590393},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43583494424819946},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4160485565662384},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.2254319190979004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2116982340812683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17016929388046265},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08203557133674622},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icassp.2010.5496080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2010.5496080","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.866.3753","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.866.3753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Sergiy_Vorobyov/publication/220731891_Pareto-optimal_solutions_of_Nash_bargaining_resource_allocation_games_with_spectral_mask_and_total_power_constraints/links/0c96051ffc98f6b5cb000000.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.877.3484","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.877.3484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.ualberta.ca/%7Evorobyov/ICASSP10a.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2100553541","https://openalex.org/W2123144456","https://openalex.org/W2139518987","https://openalex.org/W2157537016","https://openalex.org/W2165391318"],"related_works":["https://openalex.org/W1963790170","https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W2090178682","https://openalex.org/W2586328217","https://openalex.org/W2049264236","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W2073147994","https://openalex.org/W1588199609"],"abstract_inverted_index":{"The":[0,22],"problem":[1,23],"of":[2,59,66],"resource":[3],"allocation":[4,36],"among":[5],"multiple":[6],"users":[7],"with":[8],"total":[9],"power":[10,33],"and":[11,26,34,49,68],"spectral":[12],"mask":[13],"constraints":[14],"is":[15,24,72,87,92],"studied":[16],"based":[17],"on":[18],"cooperative":[19],"game-theoretic":[20],"approach.":[21],"non-convex,":[25],"finding":[27],"the":[28,45,81,90],"optimal":[29],"solution":[30,82],"requires":[31],"joint":[32],"bandwidth":[35],"that":[37,80],"renders":[38],"high-complexity":[39],"algorithms.":[40],"Therefore,":[41],"we":[42],"first":[43],"categorize":[44],"systems":[46],"to":[47,52],"bandwidth-dominant":[48],"power-dominant":[50],"according":[51],"their":[53],"bottleneck":[54],"resources.":[55],"Then,":[56],"different":[57],"manners":[58],"cooperation":[60],"are":[61],"adopted":[62],"for":[63,74],"each":[64,75,85],"type":[65],"systems,":[67],"a":[69],"two-user":[70],"algorithm":[71],"developed":[73],"case.":[76],"Such":[77],"categorization":[78],"guarantees":[79],"obtained":[83],"in":[84],"case":[86],"Pareto-optimal,":[88],"while":[89],"complexity":[91],"significantly":[93],"reduced.":[94]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}