{"id":"https://openalex.org/W4232862337","doi":"https://doi.org/10.1109/cdc.2012.6426002","title":"On Games with Coupled Constraints","display_name":"On Games with Coupled Constraints","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W4232862337","doi":"https://doi.org/10.1109/cdc.2012.6426002"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2012.6426002","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426002","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","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/A5072860374","display_name":"G\u00fcrdal Arslan","orcid":"https://orcid.org/0000-0002-8295-1509"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gurdal Arslan","raw_affiliation_strings":["Department of Electrical Engineering, University of Hawaii, Manoa, Honolulu, HI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Hawaii, Manoa, Honolulu, HI, USA","institution_ids":["https://openalex.org/I117965899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068961280","display_name":"M.F. Demirkol","orcid":"https://orcid.org/0000-0001-7631-0185"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Fatih Demirkol","raw_affiliation_strings":["Avea \u0130letisim Hizmetleri, A.S., Istanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Avea \u0130letisim Hizmetleri, A.S., Istanbul, Turkey","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005401257","display_name":"Serdar Y\u00fcksel","orcid":"https://orcid.org/0000-0001-6099-5001"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Serdar Yuksel","raw_affiliation_strings":["Department of Mathematics and Statistics, Queen's University, Kingston, ONT, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Queen's University, Kingston, ONT, Canada","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2498,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65988788,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"7151","last_page":"7156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9814000129699707,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6989460587501526},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6363890767097473},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5865522027015686},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5774434804916382},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5028974413871765},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.47945109009742737},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4625816345214844},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.4287901818752289},{"id":"https://openalex.org/keywords/utility-maximization-problem","display_name":"Utility maximization problem","score":0.4219702482223511},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41566002368927},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4117628335952759},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.37402117252349854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22572368383407593},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.1110907793045044}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6989460587501526},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6363890767097473},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5865522027015686},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5774434804916382},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5028974413871765},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.47945109009742737},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4625816345214844},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.4287901818752289},{"id":"https://openalex.org/C2779044140","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization problem","level":3,"score":0.4219702482223511},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41566002368927},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4117628335952759},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.37402117252349854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22572368383407593},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.1110907793045044},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2012.6426002","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426002","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W19180870","https://openalex.org/W1534416612","https://openalex.org/W1568846557","https://openalex.org/W1994325510","https://openalex.org/W2123668221","https://openalex.org/W2125859497","https://openalex.org/W2130509920","https://openalex.org/W2147077179","https://openalex.org/W4302033101"],"related_works":["https://openalex.org/W4312141693","https://openalex.org/W1536009559","https://openalex.org/W2103821767","https://openalex.org/W1969185016","https://openalex.org/W2037619003","https://openalex.org/W2111030377","https://openalex.org/W1965856819","https://openalex.org/W2267645079","https://openalex.org/W2316903755","https://openalex.org/W2139921619"],"abstract_inverted_index":{"We":[0,134,166,190,214],"study":[1],"the":[2,40,54,93,101,124,136,143,148,159,173,180,193,216,220,223,229,234],"problem":[3],"of":[4,42,75,86,95,103,126,138,145,147,172,175,182,222],"cost":[5,30,41,62,105,125,132,154,184,206,225],"minimization":[6,19,31,106,207,226],"in":[7,20,33,80,113,179],"competitive":[8],"resource":[9,44,128],"allocation":[10],"problems,":[11],"motivated":[12],"by":[13,186],"our":[14],"previous":[15],"work":[16],"on":[17,196,231],"power":[18],"MIMO":[21],"interference":[22],"systems.":[23],"Our":[24],"setup":[25],"leads":[26],"to":[27,38,118,152],"a":[28,48,72,83,104,109,131,187,198,204],"general":[29,81],"game":[32,107,112,150,161,208,227],"which":[34,79,114,209],"each":[35,115],"player":[36,55,116],"wishes":[37,117],"minimize":[39],"its":[43,120,127],"consumption":[45,129],"while":[46,122],"achieving":[47,197,233],"target":[49,76,199,235],"utility":[50,66,77,89,97,110,121,140,177,200,236],"level.":[51],"In":[52],"general,":[53],"strategies":[56],"are":[57],"coupled":[58],"through":[59,219],"both":[60],"their":[61,65],"functions":[63,185],"and":[64,156,202],"functions.":[67],"Equilibrium":[68],"exists":[69],"only":[70],"for":[71],"certain":[73],"set":[74,85,94,137,144,174],"levels":[78,141,178,237],"is":[82],"proper":[84],"all":[87,153],"achievable":[88],"levels.":[90],"To":[91],"characterize":[92],"equilibrium":[96,139,146,176],"levels,":[98],"we":[99],"introduce":[100,203],"dual":[102,149,160],"called":[108],"maximization":[111],"maximize":[119],"keeping":[123],"below":[130],"threshold.":[133],"associate":[135],"with":[142],"corresponding":[151],"thresholds,":[155],"show":[157],"that":[158],"always":[162,210],"possesses":[163,211],"an":[164,169,212],"equilibrium.":[165,213],"also":[167],"obtain":[168],"inner":[170],"estimate":[171],"case":[181],"decoupled":[183],"minimax":[188],"approach.":[189],"then":[191],"relax":[192],"hard":[194],"constraint":[195],"level,":[201],"weighted":[205,224],"recover":[215],"original":[217],"equilibria":[218,221],"as":[228],"penalty":[230],"not":[232],"increases.":[238]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}