Notes on Computational Complexity

Kumaraswamy Velupillai

in Computable Economics

Published in print January 2000 | ISBN: 9780198295273
Published online November 2003 | e-ISBN: 9780191596988 | DOI:
 Notes on Computational Complexity

More Like This

Show all results sharing this subject:

  • Macroeconomics and Monetary Economics


Show Summary Details


A characterization of dynamic choice attributable to Marshall is used as the vehicle through which to discuss the computational complexity of sequentially rational behaviour. Khachiyan's famous results on polynomial time complexity of an ellipsoid algorithm is also described and used in the context of the choice by a ‘Marshallian consumer’. Some general background remarks on the computational complexity of the simplex algorithm are also given.

Keywords: computational complexity; dynamic choice; ellipsoid algorithm; L.G. Khachiyan; Alfred Marshall; Marshallian consumer; sequential behaviour; simplex algorithm

Chapter.  4510 words.  Illustrated.

Subjects: Macroeconomics and Monetary Economics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.