{"id":"https://openalex.org/W2127161588","doi":"https://doi.org/10.1109/acc.2011.5991436","title":"Pseudo-polynomial auction algorithm for Nonlinear Resource Allocation","display_name":"Pseudo-polynomial auction algorithm for Nonlinear Resource Allocation","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2127161588","doi":"https://doi.org/10.1109/acc.2011.5991436","mag":"2127161588"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2011.5991436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2011.5991436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 American Control Conference","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/A5086188217","display_name":"Ajay Kumar Bangla","orcid":null},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ajay Kumar Bangla","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Boston University, USA","Dept of Electrical and Computer Engineering, Boston University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Boston University, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Dept of Electrical and Computer Engineering, Boston University, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103073490","display_name":"David A. Casta\u00f1\u00f3n","orcid":"https://orcid.org/0000-0002-9635-9776"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David A. Castanon","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Boston University, USA","Dept of Electrical and Computer Engineering, Boston University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Boston University, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Dept of Electrical and Computer Engineering, Boston University, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086188217"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10804637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3880","last_page":"3885"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13371","display_name":"Military Defense Systems Analysis","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T13371","display_name":"Military Defense Systems Analysis","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9617000222206116,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9592000246047974,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.6556439399719238},{"id":"https://openalex.org/keywords/auction-algorithm","display_name":"Auction algorithm","score":0.6355209350585938},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.6293290853500366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6217416524887085},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5817066431045532},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5664649605751038},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5412883162498474},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5371758341789246},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5049422383308411},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5016112327575684},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.49598821997642517},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.45228809118270874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44607076048851013},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4117621183395386},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3493805527687073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25880682468414307},{"id":"https://openalex.org/keywords/auction-theory","display_name":"Auction theory","score":0.20229065418243408},{"id":"https://openalex.org/keywords/revenue-equivalence","display_name":"Revenue equivalence","score":0.15426784753799438},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.1496318280696869}],"concepts":[{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6556439399719238},{"id":"https://openalex.org/C74979957","wikidata":"https://www.wikidata.org/wiki/Q4819604","display_name":"Auction algorithm","level":5,"score":0.6355209350585938},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.6293290853500366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6217416524887085},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5817066431045532},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5664649605751038},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5412883162498474},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5371758341789246},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5049422383308411},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5016112327575684},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.49598821997642517},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.45228809118270874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44607076048851013},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4117621183395386},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3493805527687073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25880682468414307},{"id":"https://openalex.org/C11276805","wikidata":"https://www.wikidata.org/wiki/Q771334","display_name":"Auction theory","level":3,"score":0.20229065418243408},{"id":"https://openalex.org/C143684077","wikidata":"https://www.wikidata.org/wiki/Q431186","display_name":"Revenue equivalence","level":4,"score":0.15426784753799438},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.1496318280696869},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acc.2011.5991436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2011.5991436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 American Control Conference","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":9,"referenced_works":["https://openalex.org/W1573199930","https://openalex.org/W1935186273","https://openalex.org/W1975967782","https://openalex.org/W1986581867","https://openalex.org/W2069384116","https://openalex.org/W2083040867","https://openalex.org/W2086427885","https://openalex.org/W2118008360","https://openalex.org/W2141818029"],"related_works":["https://openalex.org/W2077314575","https://openalex.org/W4315701745","https://openalex.org/W1990290471","https://openalex.org/W4380682190","https://openalex.org/W2005710836","https://openalex.org/W2102386043","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W2144598035","https://openalex.org/W3098429833"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,17],"problem":[3],"of":[4],"optimally":[5],"assigning":[6],"N":[7],"divisible":[8],"resources":[9],"to":[10,66],"M":[11],"competing":[12],"tasks.":[13],"This":[14],"is":[15],"called":[16],"Nonlinear":[18],"Resource":[19],"Allocation":[20],"Problem":[21],"(RAP).":[22],"Recently,":[23],"we":[24,57],"proposed":[25],"a":[26,34,50],"new":[27],"algorithm,":[28],"RAP":[29,64],"Auction":[30,65],"[1],":[31],"which":[32,62],"finds":[33],"near":[35],"optimal":[36],"solution":[37],"in":[38],"finite":[39],"time.":[40],"It":[41],"works":[42],"for":[43],"monotonic":[44],"convex":[45],"cost":[46],"functions":[47],"and":[48],"has":[49],"simple":[51],"computation":[52],"structure.":[53],"In":[54],"this":[55],"paper,":[56],"propose":[58],"an":[59],"elegant":[60],"extension":[61],"enables":[63],"have":[67],"pseudo-polynomial":[68],"complexity.":[69]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}