Piccione and Rubinstein (1997) present and analyse the sequential decision problem of an “absentminded driver”. The driver's absentmindedness (imperfect recall) leads him to time-inconsistent strategy evaluations. His original evaluation gets replaced by a new one under impact of the information that the circumstances have changed, notwithstanding the fact that this change in circumstances has been expected by him all along. The time inconsistency in strategy evaluation suggests that such an agent might have reason to renege on his adopted strategy. As (...) we shall see, however, this danger is only apparent. There is no serious problem of dynamic inconsistency in this case. My diagnosis of the case under consideration is in many respects similar to the one provided by Aumann, Hart and Perry (1997), but the analysis leading to this diagnosis is not quite the same. (shrink)

The Sleeping Beauty problem—first presented by A. Elga in a philosophical context—has captured much attention. The problem, we contend, is more aptly regarded as a paradox: apparently, there are cases where one ought to change one’s credence in an event’s taking place even though one gains no new information or evidence, or alternatively, one ought to have a credence other than 1/2 in the outcome of a future coin toss even though one knows that the coin is fair. In this (...) paper we argue for two claims. First, that Sleeping Beauty does gain potentially new relevant information upon waking up on Monday. Second, his credence shift is warranted provided it accords with a calculation that is a result of conditionalization on the relevant information: “this day is an experiment waking day” (a day within the experiment on which one is woken up). Since Sleeping Beauty knows what days d could refer to, he can calculate the probability that the referred to waking day is a Monday or a Tuesday providing an adequate resolution of the paradox. (shrink)

The puzzle of the absentminded driver combines an unstable decision problem with a version of the Sleeping Beauty problem. Its analysis depends on the choice between “halfing” and “thirding” as well as that between “evidential” and “causal” decision theory. I show that all four combinations lead to interestingly different solutions, and draw some general lessons about the formulation of causal decision theory, the interpretation of mixed strategies and the connection between rational credence and objective chance.

If we express our knowledge in sentences, we will find that these sentences are linked in complex patterns governed by our observations and our inferences from these observations. These inferences are to a large extent driven by logical rules. We ask whether the structure logic imposes on our knowledge restricts what we forget and what we remember. The model is a two period S5 logic. In this logic, we propose a memory loss operator: the agent forgets a sentence pif and (...) only if he knows pat time 1 and he does not know pat time 2. Equipped with the operator, we prove theorems on the relation between knowledge and memory loss. The main results point to classes of formulas that an agent cannot forget, and classes of formulas he must forget. A desirable feature is that most results hold in the S4 logic. The results illustrate bounds to memory loss, and thus to bounded rationality. We apply the model to single-agent conventions: conventions made between an agent and himself. (shrink)

The paper argues that the standard decision theoretic account of strategies and their rationality or optimality is much too narrow, that strategies should rather condition future action to future decision situations (a point of view already developed in my Grundlagen der Entscheidungstheorie, sect. 4.4), that practical deliberation must therefore essentially rely on a relation of superiority and inferiority between possible future decision situations, that all this allows to substantially broaden the theory of practical rationality, that a long list of points (...) attended to in the literature can be subsumed under the broadened perspective (including a novel view on the iterated prisoner's dilemma and on iterated Newcomb's problem, which, however, is revised in Spohn (2003) "Dependency Equilibria and the Causal Structure of Decision and Game Situation"), and that the task to complete and systematize this list indeed forms a fruitful research programme. (shrink)

In addition to being uncertain about what the world is like, one can also be uncertain about one’s own spatial or temporal location in the world. My aim is to pose a problem arising from the interaction between these two sorts of uncertainty, solve the problem, and draw two lessons from the solution.

Theories of rational decision making often abstract away from computational and other resource limitations faced by real agents. An alternative approach known as resource rationality puts such matters front and center, grounding choice and decision in the rational use of finite resources. Anticipated by earlier work in economics and in computer science, this approach has recently seen rapid development and application in the cognitive sciences. Here, the theory of rationality plays a dual role, both as a framework for normative assessment (...) and as a source of scientific hypotheses about how mental processes in fact work. The latter project, often called rational analysis, depends for its success on a fine-grained characterization of the computational problem facing a decision maker, which may in turn depend on realistic assumptions about what the relevant agent is like. As a consequence, resource rationality involves a delicate, but often fruitful interplay between the normative and the descriptive. (shrink)

Hilary Greaves and David Wallace argue that conditionalization maximizes expected accuracy and so is a rational requirement, but their argument presupposes a particular picture of the bridge between rationality and accuracy: the Best-Plan-to-Follow picture. And theorists such as Miriam Schoenfield and Robert Steel argue that it's possible to motivate an alternative picture—the Best-Plan-to-Make picture—that does not vindicate conditionalization. I show that these theorists are mistaken: it turns out that, if an update procedure maximizes expected accuracy on the Best-Plan-to-Follow picture, it's (...) guaranteed to maximize expected accuracy on the Best-Plan-to-Make picture as well, in which case moving from the former to the latter can't help us avoid the conclusion that conditionalization is a rational requirement. If there's a problem with Greaves and Wallace’s argument, it must lie elsewhere. (shrink)

I give a Dutch book argument for CDT thirders in the context of a generalized Sleeping Beauty scenario. In combination with the Briggs (2010) Dutch book for EDT thirders, this amounts to a purely decision-theoretic argument for halfing in Sleeping Beauty. In combination with the Hitchcock (2004) Dutch book for CDT halfers, this amounts to a Dutch book argument against CDT. The combined Dutch book against CDT invites a plausible diagnosis of the reasons for CDT’s failure: CDT is incompatible with (...) the Dutch book requirement because it allows the values of epistemically impossible outcomes influence one’s decision. (shrink)

When does it make sense to act randomly? A persuasive argument from Bayesian decision theory legitimizes randomization essentially only in tie-breaking situations. Rational behaviour in humans, non-human animals, and artificial agents, however, often seems indeterminate, even random. Moreover, rationales for randomized acts have been offered in a number of disciplines, including game theory, experimental design, and machine learning. A common way of accommodating some of these observations is by appeal to a decision-maker’s bounded computational resources. Making this suggestion both precise (...) and compelling is surprisingly difficult. Toward this end, I propose two fundamental rationales for randomization, drawing upon diverse ideas and results from the wider theory of computation. The first unifies common intuitions in favour of randomization from the aforementioned disciplines. The second introduces a deep connection between randomization and memory: access to a randomizing device is provably helpful for an agent burdened with a finite memory. Aside from fit with ordinary intuitions about rational action, the two rationales also make sense of empirical observations in the biological world. Indeed, random behaviour emerges more or less where it should, according to the proposal. (shrink)

Poza niepewnością co do tego, jaki jest świat, można być także niepewnym swojego przestrzennego lub czasowgo położenia w świecie. Celem artykułu jest postawienie problemu wynikającego z połączenia tych dwóch rodzajów niepewności, a następnie rozwiązanie go i wyciągnięcie dwóch lekcji z tego rozwiązania.

The Sleeping Beauty Problem attracts so much attention because it connects to a wide variety of unresolved issues in formal epistemology, decision theory, and the philosophy of science. The problem raises unanswered questions concerning relative frequencies, objective chances, the relation between self-locating and non-self-locating information, the relation between self-location and updating, Dutch Books, accuracy arguments, memory loss, indifference principles, the existence of multiple universes, and many-worlds interpretations of quantum mechanics. After stating the problem, this article surveys its connections to all (...) of these areas. (shrink)

One interpretation of the conditional If P then Q is as saying that the probability of Q given P is high. This is an interpretation suggested by Adams (1966) and pursued more recently by Edgington (1995). Of course, this probabilistic conditional is nonmonotonic, that is, if the probability of Q given P is high, and R implies P, it need not follow that the probability of Q given R is high. If we were confident of concluding Q from the fact (...) that we knew P, and we have stronger information R, we can no longer be confident of Q. We show nonetheless that usually we would still be justified in concluding Q from R. In other words, probabilistic conditionals are mostly monotonic. (shrink)

It is a popular view thatpractical deliberation excludes foreknowledge of one's choice. Wolfgang Spohn and Isaac Levi have argued that not even a purely probabilistic self-predictionis available to thedeliberator, if one takes subjective probabilities to be conceptually linked to betting rates. It makes no sense to have a betting rate for an option, for one's willingness to bet on the option depends on the net gain from the bet, in combination with the option's antecedent utility, rather than on the offered (...) odds. And even apart from this consideration, assigning probabilities to the options among which one is choosing is futile since such probabilities could be of no possible use in choice. The paper subjects these arguments to critical examination and suggests that, appearances notwithstanding, practical deliberation need not crowd outself-prediction. (shrink)

An information completion of an extensive game is obtained by extending the information partition of every player from the set of her decision nodes to the set of all nodes. The extended partition satisfies Memory of Past Knowledge (MPK) if at any node a player remembers what she knew at earlier nodes. It is shown that MPK can be satisfied in a game if and only if the game is von Neumann (vN) and satisfies memory at decision nodes (the restriction (...) of MPK to a player's own decision nodes). A game is vN if any two decision nodes that belong to the same information set of a player have the same number of predecessors. By providing an axiom for MPK we also obtain a syntactic characterization of the said class of vN games. (shrink)

In this paper we explore the absentminded driver problem using two different scenarios. In the first scenario we assume that the driver is capable of reasoning about his degree of absentmindedness before he hits the highway. This leads to a Savage-style model where the states are mutually exclusive and the act-state independence is in place. In the second we employ centred possibilities, by modelling the states (i.e. the events about which the driver is uncertain) as the possible final destinations indexed (...) by a time period. The optimal probability we find for continuing at an exit is different from almost all papers in the literature. In this scenario, act-state independence is still violated, but states are mutually exclusive and the driver arrives at his optimal choice probability via Bayesian updating. We show that our solution is the only one guaranteeing immunity from sure loss via a Dutch strategy, and that – despite initial appearances – it is time consistent. This raises important implications for the rationality of commitment in such scenarios. (shrink)

I defend the suggestion that the rational probability in the Sleeping Beauty paradox is one third. The reasoning in its favour is familiar: for every heads-waking, there are two tails-wakings. To complete the defense, I rebut the reasoning which purports to justify the competing suggestion – that the correct probability is half – by undermining its premise, that no new information has been received.

I defend a general rule for updating beliefs that takes into account both the impact of new evidence and changes in the subject’s location. The rule combines standard conditioning with a shifting operation that moves the center of each doxastic possibility forward to the next point where information arrives. I show that well-known arguments for conditioning lead to this combination when centered information is taken into account. I also discuss how my proposal relates to other recent proposals, what results it (...) delivers for puzzles like the Sleeping Beauty problem, and whether there are diachronic constraints on rational belief at all. (shrink)

Hintikka and Sandu’s independence-friendly logic is a conservative extension of first-order logic that allows one to consider semantic games with imperfect information. In the present article, we first show how several variants of the Monty Hall problem can be modeled as semantic games for IF sentences. In the process, we extend IF logic to include semantic games with chance moves and dub this extension stochastic IF logic. Finally, we use stochastic IF logic to analyze the Sleeping Beauty problem, leading to (...) the conclusion that the thirders are correct while identifying the main error in the halfers’ argument. (shrink)

Analyses of the Sleeping Beauty Problem are polarised between those advocating the “1/2 view” (“halfers”) and those endorsing the “1/3 view” (“thirders”). The disagreement concerns the evidential relevance of self-locating information. Unlike halfers, thirders regard self-locating information as evidentially relevant in the Sleeping Beauty Problem. In the present study, we systematically manipulate the kind of information available in different formulations of the Sleeping Beauty Problem. Our findings indicate that patterns of judgment on different formulations of the Sleeping Beauty Problem do (...) not fit either the “1/2 view” or the “1/3 view.” Human reasoners tend to acknowledge self-locating evidence as relevant, but discount its weight significantly. Accordingly, self-locating information may trigger more cautious judgments of confirmation than familiar kinds of statistical evidence. We also discuss how these results can advance the debate by providing a more nuanced and empirically grounded account or explication of the evidential impact of self-locating information. (shrink)

The Sleeping Beauty problem is presented in a formalized framework which summarizes the underlying probability structure. The two rival solutions proposed by Elga and Lewis differ by a single parameter concerning her prior probability. They can be supported by considering, respectively, that Sleeping Beauty is “fuzzy-minded” and “blank-minded”, the first interpretation being more natural than the second. The traditional absent -minded driver problem is reinterpreted in this framework and sustains Elga’s solution.

In the Sleeping Beauty problem, Beauty is uncertain whether the outcome of a certain coin toss was heads or tails. One argument suggests that her degree of belief in heads should be 1/3, while a second suggests that it should be 1/2. Prima facie, the argument for 1/2 appears to be stronger. I offer a diachronic Dutch Book argument in favor of 1/3. Even for those who are not routinely persuaded by diachronic Dutch Book arguments, this one has some important (...) morals. (shrink)

In this paper we study connections between game theoretical concepts and results, and features of IF-predicate logic, extending observations from J. van Benthem (2001) for IF-propositional logic. We highlight how both characteristics of perfect recall can fail in the semantic games for IF-formulas, and we discuss the four Thompson transformations in relation with IF-logic. Many (strong) equivalence schemes for IF-logic correspond to one or more of the transformations. However, we also find one equivalence that does not fit in this picture, (...) by the type of imperfect recall involved. We point out that the connection between the transformations and logical equivalence schemes is less direct in IF-first order logic than in the propositional case. The transformations do not generate a reduced normal form for IF-logic, because the IF-language is not flexible enough. (shrink)

We analyze the sequential structure of dynamic games with perfect information. A three-stage account is proposed, that species setup, reasoning and play stages. Accordingly, we define a player as a set of agents corresponding to these three stages. The notion of agent connectedness is introduced into a type-based epistemic model. Agent connectedness measures the extent to which agents' choices are sequentially stable. Thus describing dynamic games allows to more fully understand strategic interaction over time. In particular, we provide suffcient conditions (...) for backward induction in terms of agent connectedness. Also, our framework makes explicit that the epistemic independence assumption involved in backward induction reasoning is stronger than usually presumed, and makes accessible multiple-self interpretations for dynamic games. (shrink)

from now on , was to point out that the model commonly used to describe . a decision problem with imperfect recall suffers from major ambiguities in its interpretation. We claimed that several issues which were immaterial in decision problems with perfect recall may be of importance in the analysis of decision problems with imperfect recall. The issues that we raised can be summarized by the following questions.

The notion of perfect recall in extensive games was introduced by Kuhn (1953), who interpreted it as "equivalent to the assertion that each player is allowed by the rules of the game to remember everything he knew at previous moves and all of his choices at those moves''. We provide a characterization and axiomatization of perfect recall based on two notions of memory: (1) memory of past knowledge and (2) memory of past actions.

Decision theorists disagree about how instrumentally rational agents, i.e., agents trying to achieve some goal, should behave in so-called Newcomb-like problems, with the main contenders being causal and evidential decision theory. Since the main goal of artificial intelligence research is to create machines that make instrumentally rational decisions, the disagreement pertains to this field. In addition to the more philosophical question of what the right decision theory is, the goal of AI poses the question of how to implement any given (...) decision theory in an AI. For example, how would one go about building an AI whose behavior matches evidential decision theory’s recommendations? Conversely, we can ask which decision theories describe the behavior of any existing AI design. In this paper, we study what decision theory an approval-directed agent, i.e., an agent whose goal it is to maximize the score it receives from an overseer, implements. If we assume that the overseer rewards the agent based on the expected value of some von Neumann–Morgenstern utility function, then such an approval-directed agent is guided by two decision theories: the one used by the agent to decide which action to choose in order to maximize the reward and the one used by the overseer to compute the expected utility of a chosen action. We show which of these two decision theories describes the agent’s behavior in which situations. (shrink)

Diachronic uncertainty, uncertainty about where an agent falls in time, poses interesting conceptual difficulties. Although the agent is uncertain about where she falls in time, this uncertainty can only obtain at a particular moment in time. We resolve this conceptual tension by providing a transformation from models with diachronic uncertainty relations into “equivalent” models with only synchronic uncertainty relations. The former are interpreted as capturing the causal structure of a situation, while the latter are interpreted as capturing its epistemic structure. (...) The models are equivalent in the sense that agents pass through the same information sets in the same order, In this paper, we investigate how such a transformation may be used to define an appropriate notion of equivalence, which we call epistemic equivalence. Although our project is motivated by problems which have arisen in a variety of disciplines, especially philosophy and game theory, our formal development takes place within the general and flexible framework provided by epistemic temporal logic. (shrink)

In a stimulating paper, Piccione and Rubinstein (1997) argued how a decision maker could undertake dynamically inconsistent choices when, in an extensive form decision problem, she has a particular type of imperfect recall named absentmindedness. Such memory limitation obtains whenever information sets include decision histories along the same decision path. Starting from work focusing on the absentminded driver example, and independently developed by Segal (2000) and Dimitri (1999), the main theorem of this article provides a general result of dynamically consistent (...) choices, valid for a large class of finite extensive form decision problems without nature. (shrink)