메뉴 건너뛰기




Volumn 31, Issue 4, 2006, Pages 714-729

Auction algorithms for market equilibrium

Author keywords

Auction algorithm; Market equilibrium; Walrasian model

Indexed keywords

COST ACCOUNTING; FUNCTION EVALUATION; INDUSTRIAL ECONOMICS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

EID: 33847212445     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0216     Document Type: Article
Times cited : (34)

References (22)
  • 1
    • 0001436273 scopus 로고
    • Existence of an equilibrium for a competitive economy
    • Arrow, K. J., G. Debreu. 1954. Existence of an equilibrium for a competitive economy. Econometrica 22 265-290.
    • (1954) Econometrica , vol.22 , pp. 265-290
    • Arrow, K.J.1    Debreu, G.2
  • 2
    • 0001890851 scopus 로고
    • On the stability of the competetive equilibrium, II
    • Arrow, K. J., H. D. Block, L. Hurwicz. 1959. On the stability of the competetive equilibrium, II. Econometrica 27 82-109.
    • (1959) Econometrica , vol.27 , pp. 82-109
    • Arrow, K.J.1    Block, H.D.2    Hurwicz, L.3
  • 3
    • 34249831790 scopus 로고
    • Auction algorithms for network flow problems: A tutorial introduction
    • Bertsekas, Dimitri P. 1992. Auction algorithms for network flow problems: A tutorial introduction. Comput. Optim. Appl. 1 7-66.
    • (1992) Comput. Optim. Appl , vol.1 , pp. 7-66
    • Bertsekas, D.P.1
  • 4
    • 17044425010 scopus 로고    scopus 로고
    • How to compute equilibrium prices in 1891
    • Brainard, W. C., H. E. Scarf. 2005. How to compute equilibrium prices in 1891. Amer. J. Econom. Sociol. 64 57-83.
    • (2005) Amer. J. Econom. Sociol , vol.64 , pp. 57-83
    • Brainard, W.C.1    Scarf, H.E.2
  • 5
    • 0002281917 scopus 로고    scopus 로고
    • A convergent distributed implementation of general equilibrium outcomes
    • Cheng, John, Michael Wellman. 1998. A convergent distributed implementation of general equilibrium outcomes. Comput. Econom. 12(1) 1-24.
    • (1998) Comput. Econom , vol.12 , Issue.1 , pp. 1-24
    • Cheng, J.1    Wellman, M.2
  • 9
    • 33847219084 scopus 로고    scopus 로고
    • An improved approximation scheme for computing the Arrow-Debreu prices for the linear case
    • Proc. Foundations Software Tech. Theoret. Comput. Sci, FSTTCS 2003, Springer, Berlin, Germany
    • Devanur, Nikhil R., Vijay V. Vazirani. 2003. An improved approximation scheme for computing the Arrow-Debreu prices for the linear case. Proc. Foundations Software Tech. Theoret. Comput. Sci. (FSTTCS 2003). Lecture Notes in Computer Science, Vol. 2914. Springer, Berlin, Germany.
    • (2003) Lecture Notes in Computer Science , vol.2914
    • Devanur, N.R.1    Vazirani, V.V.2
  • 11
    • 0001392115 scopus 로고
    • A finite algorithm for the linear exchange model
    • Eaves, B. 1976. A finite algorithm for the linear exchange model. J. Math. Econom. 3(2) 197-203.
    • (1976) J. Math. Econom , vol.3 , Issue.2 , pp. 197-203
    • Eaves, B.1
  • 12
    • 0012573298 scopus 로고
    • Consensus of subjective probabilities: The pari-mutuel method
    • Eisenberg, E., D. Gale. 1959. Consensus of subjective probabilities: The pari-mutuel method. Ann. Math. Statist. 30 165-168.
    • (1959) Ann. Math. Statist , vol.30 , pp. 165-168
    • Eisenberg, E.1    Gale, D.2
  • 13
    • 17744369541 scopus 로고    scopus 로고
    • A polynomial time algorithm for computing the Arrow-Debreu market equilibrium for linear utilities
    • Rome, Italy. IEEE Computer Society, Washington, DC
    • Jain, Kamal. 2004. A polynomial time algorithm for computing the Arrow-Debreu market equilibrium for linear utilities. Proc. 45th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 2004), Rome, Italy. IEEE Computer Society, Washington, DC, 286-294.
    • (2004) Proc. 45th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 2004) , pp. 286-294
    • Jain, K.1
  • 14
    • 35248859791 scopus 로고    scopus 로고
    • Approximation, randomization, and combinatorial optimization: Algorithms for combinatorial optimization: Algorithms and approximation techniques
    • 6th Internat. Workshop Approximation Algorithms Combin. Optim. Problems APPROX 2003, Springer, Berlin, Germany
    • Jain, K., M. Mahdian, A. Saberi. 2003. Approximation, randomization, and combinatorial optimization: Algorithms for combinatorial optimization: Algorithms and approximation techniques. 6th Internat. Workshop Approximation Algorithms Combin. Optim. Problems (APPROX 2003). Lecture Notes in Computer Science, Vol. 2764. Springer, Berlin, Germany.
    • (2003) Lecture Notes in Computer Science , vol.2764
    • Jain, K.1    Mahdian, M.2    Saberi, A.3
  • 15
    • 0002719797 scopus 로고
    • The Hungarian method for the assignment problem
    • Kuhn, H. W. 1955. The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2 83-97.
    • (1955) Naval Res. Logist. Quart , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 16
    • 0010679604 scopus 로고
    • One algorithm for finding solutions of the Arrow-Debreu model
    • Nenakov, E. I., M. E. Primak. 1983. One algorithm for finding solutions of the Arrow-Debreu model. Kibernetica 3 127-128.
    • (1983) Kibernetica , vol.3 , pp. 127-128
    • Nenakov, E.I.1    Primak, M.E.2
  • 17
    • 17744371910 scopus 로고
    • Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models
    • Newman, D. J., M. E. Primak. 1992. Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models. Appl. Math. Comput. 52 223-231.
    • (1992) Appl. Math. Comput , vol.52 , pp. 223-231
    • Newman, D.J.1    Primak, M.E.2
  • 18
    • 0028459906 scopus 로고
    • On the complexity of the parity-argument and other inefficient proofs of existence
    • Papadimitriou, Christos H. 1994. On the complexity of the parity-argument and other inefficient proofs of existence. J. Comput. System Sci. 48(3) 498-532.
    • (1994) J. Comput. System Sci , vol.48 , Issue.3 , pp. 498-532
    • Papadimitriou, C.H.1
  • 19
    • 33847181351 scopus 로고
    • A converging algorithm for a linear exchange model
    • Primak, M. E. 1992. A converging algorithm for a linear exchange model. Appl. Math. Comput. 52 223-231.
    • (1992) Appl. Math. Comput , vol.52 , pp. 223-231
    • Primak, M.E.1
  • 22
    • 33847237379 scopus 로고    scopus 로고
    • A path to the Arrow-Debreu competitive market equilibrium
    • Forthcoming
    • Ye, Yinyu. 2006. A path to the Arrow-Debreu competitive market equilibrium. Math. Programming. Forthcoming.
    • (2006) Math. Programming
    • Ye, Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.