Jump to ContentJump to Main Navigation
Computable EconomicsThe Arne Ryde Memorial Lectures$
Users without a subscription are not able to see the full content.

K. Velupillai

Print publication date: 2000

Print ISBN-13: 9780198295273

Published to Oxford Scholarship Online: November 2003

DOI: 10.1093/0198295278.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 19 January 2022

Notes on Computational Complexity

Notes on Computational Complexity

Chapter:
(p.134) 8 Notes on Computational Complexity
Source:
Computable Economics
Author(s):

Kumaraswamy Velupillai

Publisher:
Oxford University Press
DOI:10.1093/0198295278.003.0008

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

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.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .