{"id":"https://openalex.org/W1985717133","doi":"https://doi.org/10.1137/s0097539705447384","title":"A Polynomial Time Algorithm for Computing an Arrow\u2013Debreu Market Equilibrium for Linear Utilities","display_name":"A Polynomial Time Algorithm for Computing an Arrow\u2013Debreu Market Equilibrium for Linear Utilities","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1985717133","doi":"https://doi.org/10.1137/s0097539705447384","mag":"1985717133"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539705447384","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705447384","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5041706388","display_name":"Kamal Jain","orcid":"https://orcid.org/0000-0001-5153-0405"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kamal Jain","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041706388"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.4434,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.97605979,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"37","issue":"1","first_page":"303","last_page":"318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9718999862670898,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9319000244140625,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"Ellipsoid method","score":0.68918776512146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5708386301994324},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5015826225280762},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4983689785003662},{"id":"https://openalex.org/keywords/quasiconvex-function","display_name":"Quasiconvex function","score":0.46964022517204285},{"id":"https://openalex.org/keywords/danskins-theorem","display_name":"Danskin's theorem","score":0.4668493866920471},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.45553991198539734},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.43704575300216675},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42983436584472656},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4202789068222046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4196883738040924},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.41546687483787537},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37865227460861206},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35216960310935974},{"id":"https://openalex.org/keywords/fixed-point-theorem","display_name":"Fixed-point theorem","score":0.3151113986968994},{"id":"https://openalex.org/keywords/brouwer-fixed-point-theorem","display_name":"Brouwer fixed-point theorem","score":0.256226509809494}],"concepts":[{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.68918776512146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5708386301994324},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5015826225280762},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4983689785003662},{"id":"https://openalex.org/C80278974","wikidata":"https://www.wikidata.org/wiki/Q1126412","display_name":"Quasiconvex function","level":5,"score":0.46964022517204285},{"id":"https://openalex.org/C48540410","wikidata":"https://www.wikidata.org/wiki/Q5221089","display_name":"Danskin's theorem","level":4,"score":0.4668493866920471},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.45553991198539734},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.43704575300216675},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42983436584472656},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4202789068222046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4196883738040924},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.41546687483787537},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37865227460861206},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35216960310935974},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.3151113986968994},{"id":"https://openalex.org/C146147875","wikidata":"https://www.wikidata.org/wiki/Q1144897","display_name":"Brouwer fixed-point theorem","level":3,"score":0.256226509809494},{"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.1137/s0097539705447384","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705447384","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1976317489","https://openalex.org/W1979240183","https://openalex.org/W1980938853","https://openalex.org/W1987497363","https://openalex.org/W1999625879","https://openalex.org/W2014465065","https://openalex.org/W2066466209","https://openalex.org/W2089282360","https://openalex.org/W2169359757","https://openalex.org/W4234277722","https://openalex.org/W4241055107"],"related_works":["https://openalex.org/W2105474056","https://openalex.org/W2202033387","https://openalex.org/W2053616442","https://openalex.org/W2095699450","https://openalex.org/W2001725593","https://openalex.org/W2351069524","https://openalex.org/W2039410269","https://openalex.org/W4233172824","https://openalex.org/W4234856521","https://openalex.org/W212391553"],"abstract_inverted_index":{"We":[0,108],"provide":[1],"the":[2,15,30,44,53,73,78,171,192],"first":[3],"polynomial":[4],"time":[5],"exact":[6],"algorithm":[7,21,32,86],"for":[8,14,116,127],"computing":[9],"an":[10,83,101],"Arrow\u2013Debreu":[11,117],"market":[12],"equilibrium":[13,49,54,102,115],"case":[16],"of":[17,46,75,114,173,199,204],"linear":[18],"utilities.":[19],"Our":[20,59,121,134],"is":[22,50,62,185,203],"based":[23,103],"on":[24,104],"solving":[25],"a":[26,38,69,138,197],"convex":[27,51,60,106,122,194],"program":[28,61,123],"using":[29],"ellipsoid":[31],"and":[33,52,64,118,131,148,153,168,176],"simultaneous":[34],"diophantine":[35],"approximation.":[36],"As":[37],"side":[39],"result,":[40],"we":[41],"prove":[42],"that":[43],"set":[45,74],"assignments":[47],"at":[48],"prices":[55],"themselves":[56],"are":[57],"log\u2010convex.":[58],"explicit":[63],"intuitive,":[65],"which":[66],"allows":[67],"maximizing":[68],"concave":[70],"function":[71],"over":[72],"equilibria.":[76],"On":[77],"practical":[79],"side,":[80],"Ye":[81],"developed":[82],"interior":[84],"point":[85],"[Lecture":[87],"Notes":[88],"in":[89,143,170,182],"Comput.":[90],"Sci.":[91],"3521,":[92],"Springer,":[93],"New":[94],"York,":[95],"2005,":[96],"pp.":[97],"3\u20135]":[98],"to":[99,186,189],"find":[100],"our":[105],"program.":[107],"also":[109,136],"derive":[110],"separate":[111],"combinatorial":[112,177],"characterizations":[113],"Fisher":[119],"cases.":[120],"can":[124],"be":[125],"extended":[126],"many":[128],"nonlinear":[129],"utilities":[130],"production":[132],"models.":[133],"paper":[135],"makes":[137],"powerful":[139,164],"theorem":[140,202],"(Theorem":[141],"6.4.1":[142],"[M.":[144],"Grotschel,":[145],"L.":[146],"Lovasz,":[147],"A.":[149],"Schrijver,":[150],"Geometric":[151],"Algorithms":[152],"Combinatorial":[154],"Optimization,":[155],"2nd":[156],"ed.,":[157],"Springer\u2010Verlag,":[158],"Berlin,":[159],"Heidelberg,":[160],"1993])":[161],"even":[162],"more":[163],"(in":[165],"Theorems":[166],"12":[167],"13)":[169],"area":[172],"geometric":[174],"algorithms":[175],"optimization.":[178],"The":[179],"main":[180],"idea":[181],"this":[183],"generalization":[184],"allow":[187],"ellipsoids":[188],"contain":[190],"not":[191],"whole":[193],"region":[195],"but":[196],"part":[198],"it.":[200],"This":[201],"independent":[205],"interest.":[206]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}