{"id":"https://openalex.org/W2920104647","doi":"https://doi.org/10.1109/infocom.2019.8737448","title":"Mechanism Design for Network Utility Maximization with Private Constraint Information","display_name":"Mechanism Design for Network Utility Maximization with Private Constraint Information","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2920104647","doi":"https://doi.org/10.1109/infocom.2019.8737448","mag":"2920104647"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2019.8737448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","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/A5110110743","display_name":"Meng Zhang","orcid":"https://orcid.org/0009-0006-7505-2341"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Meng Zhang","raw_affiliation_strings":["Dept. of Information Engineering, The Chinese University of Hong Kong, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Engineering, The Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062346297","display_name":"Jianwei Huang","orcid":"https://orcid.org/0000-0001-6631-1096"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianwei Huang","raw_affiliation_strings":["School of Engineering and Science, The Chinese University of Hong Kong, Shenzhen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Science, The Chinese University of Hong Kong, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6624,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.90308734,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"919","last_page":"927"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.996999979019165,"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.996999979019165,"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/T11182","display_name":"Auction Theory and Applications","score":0.9965999722480774,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9950000047683716,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6996645927429199},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.6441766023635864},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.629776120185852},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5644466876983643},{"id":"https://openalex.org/keywords/complete-information","display_name":"Complete information","score":0.49933600425720215},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.4839623272418976},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.48075056076049805},{"id":"https://openalex.org/keywords/private-information-retrieval","display_name":"Private information retrieval","score":0.4546355605125427},{"id":"https://openalex.org/keywords/rationality","display_name":"Rationality","score":0.44967204332351685},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.44532787799835205},{"id":"https://openalex.org/keywords/mechanism","display_name":"Mechanism (biology)","score":0.4191526174545288},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.417539119720459},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41648420691490173},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.4143143892288208},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.22816693782806396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13710340857505798},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11171811819076538},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.10062432289123535},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.09365689754486084}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6996645927429199},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.6441766023635864},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.629776120185852},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5644466876983643},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.49933600425720215},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.4839623272418976},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.48075056076049805},{"id":"https://openalex.org/C99221444","wikidata":"https://www.wikidata.org/wiki/Q1532069","display_name":"Private information retrieval","level":2,"score":0.4546355605125427},{"id":"https://openalex.org/C201717286","wikidata":"https://www.wikidata.org/wiki/Q938185","display_name":"Rationality","level":2,"score":0.44967204332351685},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.44532787799835205},{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.4191526174545288},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.417539119720459},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41648420691490173},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.4143143892288208},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.22816693782806396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13710340857505798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11171811819076538},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.10062432289123535},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.09365689754486084},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2019.8737448","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W36205293","https://openalex.org/W1583497301","https://openalex.org/W1968406976","https://openalex.org/W1988057691","https://openalex.org/W1997949764","https://openalex.org/W2007575094","https://openalex.org/W2015007620","https://openalex.org/W2044212084","https://openalex.org/W2045152269","https://openalex.org/W2053959597","https://openalex.org/W2076428552","https://openalex.org/W2078945272","https://openalex.org/W2080637564","https://openalex.org/W2081127991","https://openalex.org/W2097179809","https://openalex.org/W2106901427","https://openalex.org/W2108653052","https://openalex.org/W2119493606","https://openalex.org/W2123966196","https://openalex.org/W2144319308","https://openalex.org/W2157007424","https://openalex.org/W2158893758","https://openalex.org/W2162986857","https://openalex.org/W2165275149","https://openalex.org/W2204461383","https://openalex.org/W2317289349","https://openalex.org/W2514508171","https://openalex.org/W2581520476","https://openalex.org/W2605376076","https://openalex.org/W2792854086","https://openalex.org/W2795808086","https://openalex.org/W2803962691","https://openalex.org/W3105360609","https://openalex.org/W4250589301","https://openalex.org/W4251083239","https://openalex.org/W6661872478"],"related_works":["https://openalex.org/W2901356298","https://openalex.org/W3123600988","https://openalex.org/W2156665530","https://openalex.org/W3007590317","https://openalex.org/W2133880097","https://openalex.org/W3123804163","https://openalex.org/W2725417023","https://openalex.org/W3121538842","https://openalex.org/W1923149708","https://openalex.org/W2097005077"],"abstract_inverted_index":{"Network":[0],"utility":[1,106,250],"maximization":[2],"(NUM)":[3],"is":[4,28,113,219],"a":[5,24,96,181,205,224,238,255],"general":[6,97],"framework":[7],"for":[8,94,237],"optimally":[9],"allocating":[10],"constrained":[11],"resources":[12],"in":[13],"many":[14],"networked":[15],"applications.":[16],"When":[17],"agents":[18],"have":[19,45],"asymmetric":[20],"and":[21,69,107,151,161,198,241],"private":[22,54,105,132],"information,":[23],"fundamental":[25],"economic":[26,47,155],"challenge":[27],"how":[29],"to":[30,78,114,119,134,178,204,232,254],"solve":[31],"the":[32,36,57,62,88,91,116,128,140,144,165,170,191,194,201,214,229,234,244,248],"NUM":[33,101,207,235],"Problem":[34],"considering":[35,103],"self-interests":[37],"of":[38,64,99,130,196,200],"strategic":[39],"agents.":[40],"Many":[41],"previous":[42],"related":[43,58,72],"works":[44],"proposed":[46],"mechanisms":[48],"that":[49,139,199,218,243],"can":[50],"cope":[51],"with":[52],"agents'":[53],"utilities.":[55],"However,":[56,164],"literature":[59],"largely":[60],"neglected":[61],"issue":[63],"information":[65,133],"asymmetries":[66],"regarding":[67],"constraints,":[68],"limited":[70],"closely":[71],"studies":[73],"provided":[74],"solutions":[75],"only":[76],"applicable":[77],"specific":[79],"application":[80],"scenarios.":[81],"To":[82,184],"tackle":[83],"this":[84,186],"issue,":[85,187],"we":[86,188,212,227],"propose":[87],"DeNUM":[89,141,216,230,245],"Mechanism,":[90],"first":[92],"mechanism":[93,142],"solving":[95,233],"class":[98],"decomposable":[100],"Problems":[102],"both":[104],"constraint":[108],"information.":[109],"The":[110],"key":[111],"idea":[112],"decentralize":[115],"decision":[117],"process":[118],"agents,":[120],"who":[121],"will":[122],"make":[123],"resource":[124],"allocation":[125],"decisions":[126],"without":[127],"need":[129],"revealing":[131],"others.":[135],"We":[136],"further":[137,189],"show":[138,242],"yields":[143],"network-utility":[145],"maximizing":[146],"solution":[147,168,203],"at":[148],"an":[149],"equilibrium,":[150],"achieves":[152],"other":[153],"desirable":[154],"properties":[156],"(such":[157],"as":[158,223],"individual":[159],"rationality":[160],"budget":[162],"balance).":[163],"corresponding":[166],"equilibrium":[167,173],"concept,":[169],"generalized":[171],"Nash":[172],"(GNE),":[174],"makes":[175],"it":[176],"difficult":[177],"achieve":[179],"through":[180],"distributed":[182],"algorithm.":[183],"address":[185],"establish":[190],"connection":[192],"between":[193],"structure":[195],"GNE":[197],"primal-dual":[202],"reformulated":[206],"problem,":[208],"based":[209],"on":[210],"which":[211],"present":[213],"convergent":[215],"Algorithm":[217],"provably":[220],"convergent.":[221],"Finally,":[222],"case":[225],"study,":[226],"apply":[228],"Mechanism":[231],"problem":[236],"user-provided":[239],"network,":[240],"algorithm":[246],"improves":[247],"network":[249],"by":[251],"17%":[252],"compared":[253],"non-cooperation":[256],"benchmark.":[257]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}