Related papers: Menger 1934 revisited
The St. Petersburg paradox is the oldest paradox in decision theory and has played a pivotal role in the introduction of increasing concave utility functions embodying risk aversion and decreasing marginal utility of gains. All attempts to…
A resolution of the St. Petersburg paradox is presented. In contrast to the standard resolution, utility is not required. Instead, the time-average performance of the lottery is computed. The final result can be phrased mathematically…
The famous Saint Petersburg Paradox (St. Petersburg Paradox) shows that the theory of expected value does not capture the real-world economics of decision-making problems. Over the years, many economic theories were developed to resolve the…
A sentence from Carl Boyer's A History of Mathematics can be interpreted so that the full brothers Nicolaus II (02/06/1695 - 07/31/1726) and Daniel Bernoulli (02/08/1700 - 03/17/1782) are the authors of the St. Petersburg paradox. The…
The St. Petersburg Paradox, an important topic in probability theory, has not been solved in the last 280 years. Since Nicolaus Bernoulli proposed the St. Petersburg Paradox in 1738, many people had tried to solve it and had proposed…
The St. Petersburg paradox provides a simple paradigm for systems that show sensitivity to rare events. Here, we demonstrate a physical realization of this paradox using tensile fracture, experimentally verifying for six decades of spatial…
It is common in inventory theory to consider policies that minimize the expected cost of ordering and holding goods or materials. Nevertheless, the realized cost is a random variable, and, as the Saint Petersburg Paradox reminds us, the…
During a first St. Petersburg period Leonhard Euler, in his early twenties, became interested in the Basel problem: summing the series of inverse squares (posed by Pietro Mengoli in mid 17th century). In the words of Andre Weil (1989) "as…
From 1873 to 1897, Georg Cantor worked on developing set theory, and despite a strong initial resistance, it rapidly became accepted as the foundation of mathematics. In this work, however, we'll demonstrate that Cantor's use of infinity is…
We expand upon the notion of bottlenecking introduced in our earlier work, characterizing a spectrum of graphs and showing that this naturally extends to a concept of coarse bottlenecking. We show how the notion of bottlenecking provides a…
Menger's conjecture that Menger spaces are /sigma-compact is false; it is true for analytic subspaces of Polish spaces and undecidable for more complex definable subspaces of Polish spaces. For non-metrizable spaces, analytic Menger spaces…
This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…
The inconsistencies involved in the foundation of set theory were invariably caused by infinity and self-reference; and only with the opportune axiomatic restrictions could them be obviated. Throughout history, both concepts have proved to…
By closely rereading the original Turing's 1936 article, we can gain insight about that it is based on the claim to have defined a number which is not computable, arguing that there can be no machine computing the diagonal on the…
Around 1930, K. Menger expressed his interest in the concept of abstract angle function. He introduced a general definition of this notion for metric and semi-metric spaces. He also proposed two problems concerning conformal embeddability…
The Ellsberg and Machina paradoxes reveal that expected utility theory is problematical when real subjects take decisions under uncertainty. Suitable generalizations of expected utility exist which attempt to solve the Ellsberg paradox, but…
Muchnik's paradox says that enumerable betting strategies are not always reducible to enumerable strategies whose bets are restricted to either even rounds or odd rounds. In other words, there are outcome sequences x where an effectively…
We obtain variants of the classical von Neumann-Morgenstern expected utility theorem, with and without the completeness axiom, in which the derived Bernoulli utility functions are Lipschitz. The prize space in these results is an arbitrary…
This is an English translation of Ludwig Bieberbach's paper ``Remarks on Hilbert's Thirteenth Problem" originally written in German and originally published in Journal f\"ur die Reine und Angewandte Mathematik - 165 (89-92) 1931, along with…
We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…