{"id":"https://openalex.org/W2154887416","doi":"https://doi.org/10.1109/icc.2011.5963273","title":"Stackelberg Game on the Boundary of Coexistence","display_name":"Stackelberg Game on the Boundary of Coexistence","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2154887416","doi":"https://doi.org/10.1109/icc.2011.5963273","mag":"2154887416"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2011.5963273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5963273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","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/A5081341971","display_name":"Kandasamy Illanko","orcid":null},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kandasamy Illanko","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ryerson University, Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ryerson University, Toronto, Canada","institution_ids":["https://openalex.org/I530967"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074463174","display_name":"Alagan Anpalagan","orcid":"https://orcid.org/0000-0002-6646-6052"},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alagan Anpalagan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ryerson University, Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ryerson University, Toronto, Canada","institution_ids":["https://openalex.org/I530967"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113663027","display_name":"D. Androutsos","orcid":null},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Dimitri Androutsos","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ryerson University, Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ryerson University, Toronto, Canada","institution_ids":["https://openalex.org/I530967"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I530967"],"apc_list":null,"apc_paid":null,"fwci":0.4475,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62946975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9998999834060669,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9997000098228455,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/stackelberg-competition","display_name":"Stackelberg competition","score":0.8943657875061035},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7000201940536499},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6028228998184204},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.6023401021957397},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5850756764411926},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.5421716570854187},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.46987420320510864},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4545423984527588},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.44833076000213623},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4179515540599823},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41354215145111084},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.32425355911254883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.250892698764801}],"concepts":[{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.8943657875061035},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7000201940536499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6028228998184204},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.6023401021957397},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5850756764411926},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.5421716570854187},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.46987420320510864},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4545423984527588},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.44833076000213623},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4179515540599823},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41354215145111084},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.32425355911254883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.250892698764801},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2011.5963273","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5963273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1506498270","https://openalex.org/W1530756071","https://openalex.org/W1968478388","https://openalex.org/W2002937495","https://openalex.org/W2017148445","https://openalex.org/W2068118751","https://openalex.org/W2100553541","https://openalex.org/W2102833882","https://openalex.org/W2111031232","https://openalex.org/W2112820013","https://openalex.org/W2117352219","https://openalex.org/W2143233961","https://openalex.org/W2148239500","https://openalex.org/W2151998746","https://openalex.org/W2153620960","https://openalex.org/W2156270936","https://openalex.org/W2158926121","https://openalex.org/W2162877972","https://openalex.org/W2166190941","https://openalex.org/W2296319761","https://openalex.org/W4250589301","https://openalex.org/W4303111783","https://openalex.org/W6630520024","https://openalex.org/W6682234961"],"related_works":["https://openalex.org/W1987562536","https://openalex.org/W4383533535","https://openalex.org/W2375814310","https://openalex.org/W4380353856","https://openalex.org/W2347216446","https://openalex.org/W2605497830","https://openalex.org/W3169439878","https://openalex.org/W2062756478","https://openalex.org/W2948291551","https://openalex.org/W3153752017"],"abstract_inverted_index":{"This":[0],"paper":[1],"combines":[2],"Convex":[3],"analysis":[4],"and":[5,88,150,165,175,199,203],"Game":[6,144],"theory":[7,145],"to":[8,101,113,128,135,137,146,193],"investigate":[9],"the":[10,14,21,40,45,50,53,58,71,77,81,85,89,97,104,114,123,132,138,152,161,167,170,176,181,195,200],"problem":[11],"of":[12,17,52,103,131,154,179],"maximizing":[13],"sum":[15,46,72,91],"rate":[16,47,73,92],"transceivers":[18,33],"operating":[19,34],"in":[20,121],"same":[22],"frequency":[23],"band.":[24],"In":[25,61],"our":[26,208],"earlier":[27],"work,":[28],"we":[29,64],"proved":[30],"that":[31,43,67],"for":[32,68],"under":[35],"a":[36,108,119,155],"total":[37],"power":[38,41,59,86,98,109,133,180],"constraint,":[39,87],"distribution":[42],"maximizes":[44],"lies":[48],"on":[49,76],"boundary":[51,78],"feasible":[54],"set":[55],"formed":[56,79],"by":[57,80],"constraint.":[60],"this":[62,148,187],"paper,":[63],"first":[65,124,171],"prove":[66,151],"two":[69],"users,":[70],"is":[74,93,99,111,126],"convex":[75],"line":[82],"segment":[83],"representing":[84],"maximum":[90],"achieved":[94],"when":[95],"all":[96],"allocated":[100,134],"one":[102],"users.":[105],"Obviously,":[106],"such":[107],"allocation":[110],"unfair":[112],"other":[115],"user.":[116,140],"We":[117,141,159,189],"consider":[118],"scenario":[120,149],"which":[122],"user":[125,172,183],"willing":[127],"sell":[129],"some":[130],"him":[136],"second":[139,182],"use":[142,191],"Stackelberg":[143],"analyze":[147],"existence":[153],"unique":[156],"competitive":[157],"equilibrium.":[158],"derive":[160],"best":[162,196],"response":[163,197],"functions,":[164],"determine":[166],"optimum":[168,177],"price":[169],"must":[173],"charge":[174],"amount":[178],"should":[184],"buy":[185],"at":[186],"price.":[188],"also":[190],"simulation":[192],"obtain":[194],"functions":[198],"equilibrium":[201],"point,":[202],"demonstrate":[204],"their":[205],"agreement":[206],"with":[207],"analytical":[209],"results.":[210]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
