Skip to main content
SpringerLink
Log in
Book cover

The Map and the Territory pp 419–429Cite as

Two Algorithms for NP-Complete Problems and Their Relevance to Economics

  • Chapter
  • First Online:

Part of the book series: The Frontiers Collection ((FRONTCOLL))

Abstract

Maps and territory suggest problems which have to do with the opening of pathways in some poorly explored domain.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    We quote a translation of Menger’s text.

References

  • P. Arestis, C.A. Cosenza, Hierarchy models for the organization of economic spaces. Preprint Land Department Economy, Cambridge University, UK (2009)

    Google Scholar 

  • T. Baker, J. Gill, R. Solovay, Relativizations of the \(P=?NP\) question. SIAM J. Comp. 4, 431–442 (1975)

    Article  MATH  Google Scholar 

  • R. Baron, J. Durieu, H. Haller, P. Solal, Finding a Nash equilibrium in spatial games is an \(NP\)-complete problem. Econ. Theory 23, 445–454 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  • R. Bartholo, C.A. Cosenza, F.A. Doria, C. Lessa, Can economic systems be seen as computing devices? J. Econ. Behav. Organ. 70, 72–80 (2009)

    Article  Google Scholar 

  • R. Bartholo, C.A. Cosenza, F.A. Doria, M. Doria, A heuristic algorithmic procedure to solve allocation problems with fuzzy evaluations. Preprint (2010)

    Google Scholar 

  • R. Bartholo, C.A. Cosenza, F.A. Doria, M. Doria, A. Teixeira, On exact and approximate solutions for hard problems in economics: an alternative look. Preprint Fuzzylab–UFRJ (2011)

    Google Scholar 

  • S. Ben–David, S. Halevi, On the independence of \(P\,vs.\,NP\). Technical Report no.  699, Technion (1991)

    Google Scholar 

  • V. Conitzer, T. Sandholm, Computing Shapley values, manipulating value division schemes, and checking core membership in multi–issue domains, in Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04). (San Jose, California, USA, 2004), pp. 219–225

    Google Scholar 

  • C.A.N. Cosenza, Industrial Location Model: A Proposal. preprint (Martin Centre, Cambridge U., Cambridge, 1981)

    Google Scholar 

  • C.A.N. Cosenza, Brazil’s Biodiesel Project (Oxford University, Centre for Brazilian Studies, 2005)

    Google Scholar 

  • C.A.N. Cosenza, C. Neves, F. Rodrigues Lima, A decision–making method for the selection of biodiesel sites in Brazilian regional planning. Internal report, PIT–Coppe (2005)

    Google Scholar 

  • C.A.N. Cosenza, M.E. Cosenza-Andraus, C.F. Andraus, S. Leon, R.G. Nunes, Monitoración prolongada por vídeo eeg de pacientes con diagnostico ambulatorial de epilepsía del lobo frontal de difícil control. Rev. Neurología de Barcelona 43, 1–20 (2006)

    Google Scholar 

  • C.A.N. Cosenza, R.C.M. Nobre, O.C. Rotunno, W.J. Mansur, M.M.M. Nobre, Ground water vulnerability and risk mapping using gis modeling and a fuzzy logic tool. J. Contam. Hydrol. 1, 1–36 (2007)

    Google Scholar 

  • N.C.A. da Costa, F.A. Doria, Computing the future, in Computability, Complexity and Constructivity in Economic Analysis, ed. by K.V. Velupillai. (Blackwell, 2005), pp. 15–50

    Google Scholar 

  • N.C.A. da Costa, F.A. Doria, On the O’Donnell algorithm for \(NP\)-complete problems. Rev. Behav. Econ. 3, 221–242 (2016)

    Article  Google Scholar 

  • X. Deng, Ch. Papadimitriou, On the complexity of cooperative solution concepts. Math. Oper. Res. 19, 257–266 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  • B. Huberman, R.M. Lukose, T. Hogg, An economics approach to hard computational problems. Science 275, 51–54 (1997)

    Article  Google Scholar 

  • M. Machtey, P. Young, An Introduction to the General Theory of Algorithms (North–Holland, 1979)

    Google Scholar 

  • K. Menger, Das Botenproblem, in Ergebnisse eines Mathematischen Kolloquiums, ed. by K. Menger, Vol. 2 (1932), pp. 11–12

    Google Scholar 

  • M. O’Donnell, A programming language theorem which is independent of Peano Arithmetic, in Proceedings of the 11th Annual ACM Symposium on the Theory of Computation (1979), pp. 176–188

    Google Scholar 

  • J. R. Robinson, “On the Hamiltonian game (a traveling salesman problem,” rand Research Memorandum rm–303 (1949)

    Google Scholar 

  • M. Tsuji, N.C.A. da Costa, F.A. Doria, The incompleteness of theories of games. J. Phil. Logic 27, 553–563 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  • K.V. Velupillai, A computable economist’s perspective on computational complexity, in The Handbook of Complexity Research, ed. by J. Barkley Rosser Jr., Ch. 4, 36–83. (Edward Elgar Publishing Ltd, 2009)

    Google Scholar 

Download references

Acknowledgements

The ongoing research program that led to this text has been sponsored by the Advanced Studies Group, Production Engineering Program, COPPE-UFRJ, Rio, Brazil. FAD acknowledges support from the Brazilian Academy of Philosophy and its chairman Professor J. R. Moderno. The same author acknowledges partial support from CNPq, Philosophy Section.

Author information

Authors and Affiliations

  1. Advanced Studies Research Group and Fuzzy Sets Laboratory, PEP-COPPE, UFRJ, 68507, Rio RJ, 21945-972, Brazil

    C. A. Cosenza & Francisco Antonio Doria

Authors
  1. C. A. Cosenza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco Antonio Doria
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to C. A. Cosenza .

Editor information

Editors and Affiliations

  1. R. N. Podar School, Mumbai, India

    Shyam Wuppuluri

  2. Advanced Studies Research Group, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil

    Francisco Antonio Doria

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Cosenza, C.A., Doria, F.A. (2018). Two Algorithms for NP-Complete Problems and Their Relevance to Economics. In: Wuppuluri, S., Doria, F. (eds) The Map and the Territory. The Frontiers Collection. Springer, Cham. https://doi.org/10.1007/978-3-319-72478-2_23

Download citation

Publish with us

Policies and ethics

Search

Navigation