{"id":"https://openalex.org/W2053060972","doi":"https://doi.org/10.1145/1806689.1806731","title":"Improved algorithms for computing fisher's market clearing prices","display_name":"Improved algorithms for computing fisher's market clearing prices","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2053060972","doi":"https://doi.org/10.1145/1806689.1806731","mag":"2053060972"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806731","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","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/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["M.I.T., Cambridge, MA, USA","M.I.T, Cambridge, MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"M.I.T., Cambridge, MA, USA","institution_ids":[]},{"raw_affiliation_string":"M.I.T, Cambridge, MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072685560"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":46.7803,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.99691406,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"291","last_page":"300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9983000159263611,"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.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"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/T11031","display_name":"Game Theory and Applications","score":0.9927999973297119,"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/time-complexity","display_name":"Time complexity","score":0.6550931930541992},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6042992472648621},{"id":"https://openalex.org/keywords/clearing","display_name":"Clearing","score":0.5265622138977051},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5234671831130981},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5116918087005615},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5005559921264648},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4679051339626312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44707411527633667},{"id":"https://openalex.org/keywords/market-clearing","display_name":"Market clearing","score":0.43867412209510803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40205642580986023},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35017070174217224},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.11388567090034485},{"id":"https://openalex.org/keywords/finance","display_name":"Finance","score":0.11375540494918823}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6550931930541992},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6042992472648621},{"id":"https://openalex.org/C134697681","wikidata":"https://www.wikidata.org/wiki/Q1609677","display_name":"Clearing","level":2,"score":0.5265622138977051},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5234671831130981},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5116918087005615},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5005559921264648},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4679051339626312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44707411527633667},{"id":"https://openalex.org/C14981831","wikidata":"https://www.wikidata.org/wiki/Q1713661","display_name":"Market clearing","level":2,"score":0.43867412209510803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40205642580986023},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35017070174217224},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.11388567090034485},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.11375540494918823},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1806689.1806731","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/17"}],"awards":[{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1494581082","https://openalex.org/W1503068524","https://openalex.org/W1515368227","https://openalex.org/W1977545325","https://openalex.org/W1980938853","https://openalex.org/W1995770143","https://openalex.org/W2036174679","https://openalex.org/W2039010276","https://openalex.org/W2084224084","https://openalex.org/W2118008360","https://openalex.org/W2149342630","https://openalex.org/W2156036190","https://openalex.org/W2165807407","https://openalex.org/W2492477926","https://openalex.org/W4234277722","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W594425727","https://openalex.org/W3194269262","https://openalex.org/W152986835","https://openalex.org/W2154990532","https://openalex.org/W3124059947","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W2887154986","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":{"We":[0,21,61,85],"give":[1],"the":[2,13,88,103],"first":[3,62],"strongly":[4],"polynomial":[5,66],"time":[6,67,107],"algorithm":[7,68,89],"for":[8,12,53],"computing":[9],"an":[10,43],"equilibrium":[11],"linear":[14],"utilities":[15],"case":[16],"of":[17,29,35,48,56,108],"Fisher's":[18],"market":[19],"model.":[20],"consider":[22],"a":[23,26,32,64],"problem":[24],"with":[25,42],"set":[27,33],"B":[28],"buyers":[30],"and":[31],"G":[34],"divisible":[36],"goods.":[37],"Each":[38],"buyer":[39,54],"i":[40,55],"starts":[41],"initial":[44],"integral":[45,51],"allocation":[46],"ei":[47],"money.":[49],"The":[50],"utility":[52],"good":[57],"j":[58],"is":[59],"Uij.":[60],"develop":[63],"weakly":[65],"that":[69,91],"runs":[70,93],"in":[71,94],"O(n4":[72,95],"log":[73,96,110,114],"Umax":[74,111],"+":[75,83,112],"n3":[76],"emax)":[77],"time,":[78],"where":[79],"n":[80],"=":[81],"|B|":[82],"|G|.":[84],"further":[86],"modify":[87],"so":[90],"it":[92],"n)":[97],"time.":[98],"These":[99],"algorithms":[100],"improve":[101],"upon":[102],"previous":[104],"best":[105],"running":[106],"O(n8":[109],"n7":[113],"emax),":[115],"due":[116],"to":[117],"Devanur":[118],"et":[119],"al.":[120]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}