Notes on Computational Complexity
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.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.