Local, general and universal prediction strategies: A game-theoretical approach to the problem of induction

In this paper I present a game-theoretical approach to the problem of induction. I investigate the comparative success of prediction methods by mathematical analysis and computer programming. Hume's problem lies in the fact that although the success of object-inductive prediction strategies is quite robust, they cannot be universally optimal. My proposal towards a solution of the problem of induction is meta-induction. I show that there exist meta-inductive prediction strategies whose success is universally optimal, modulo short-run losses which are upper-bounded. I then turn to the implications of my approach for the evolution of cognition. In the final section I suggest a revision of the paradigm of bounded rationality by introducing the distinction between local, general and universal prediction strategies.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,812
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
56 ( #106,065 of 2,231,615 )

Recent downloads (6 months)
5 ( #120,178 of 2,231,615 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature