A formal proof of the Born rule from decision-theoretic assumptions

I develop the decision-theoretic approach to quantum probability, originally proposed by David Deutsch, into a mathematically rigorous proof of the Born rule in (Everett-interpreted) quantum mechanics. I sketch the argument informally, then prove it formally, and lastly consider a number of proposed ``counter-examples'' to show exactly which premises of the argument they violate.Comment: 36 pages. To appear (under the title "How to prove the Born rule") in Saunders, Barrett, Kent and Wallace, "Many Worlds? Everett, Quantum Theory, and Reality" (Oxford University Press

A hybrid multiagent approach for global trajectory optimization

In this paper we consider a global optimization method for space trajectory design problems. The method, which actually aims at finding not only the global minimizer but a whole set of low-lying local minimizers(corresponding to a set of different design options), is based on a domain decomposition technique where each subdomain is evaluated through a procedure based on the evolution of a population of agents. The method is applied to two space trajectory design problems and compared with existing deterministic and stochastic global optimization methods

Hybrid behavioural-based multi-objective space trajectory optimization

In this chapter we present a hybridization of a stochastic based search approach for multi-objective optimization with a deterministic domain decomposition of the solution space. Prior to the presentation of the algorithm we introduce a general formulation of the optimization problem that is suitable to describe both single and multi-objective problems. The stochastic approach, based on behaviorism, combinedwith the decomposition of the solutions pace was tested on a set of standard multi-objective optimization problems and on a simple but representative case of space trajectory design

Branching Space-Times and Parallel Processing

There is a remarkable similarity between some mathematical objects used in the Branching Space-Times framework and those appearing in computer science in the fields of event structures for concurrent processing and Chu spaces. This paper introduces the similarities and formulates a few open questions for further research, hoping that both BST theorists and computer scientists can benefit from the project

Everettian quantum mechanics without branching time

In this paper I assess the prospects for combining contemporary Everettian quantum mechanics (EQM) with branching-time semantics in the tradition of Kripke, Prior, Thomason and Belnap. I begin by outlining the salient features of ‘decoherence-based’ EQM, and of the ’consistent histories’ formalism that is particularly apt for conceptual discussions in EQM. This formalism permits of both ‘branching worlds’and ‘parallel worlds’ interpretations; the metaphysics of EQM is in this sense underdetermined by the physics. A prominent argument due to David Lewis [1986] supports the non-branching interpretation. Belnap et al. [2001] refer to Lewis’ argument as the ’Assertion problem’, and propose a pragmatic response to it. I argue that their response is unattractively ad hoc and complex, and that it prevents an Everettian who adopts branching-time semantics from making clear sense of objective probability. The upshot is that Everettians are better off without branching-time semantics. I conclude by discussing and rejecting an alternative possible motivation for branching time

Time Critical Social Mobilization: The DARPA Network Challenge Winning Strategy

It is now commonplace to see the Web as a platform that can harness the collective abilities of large numbers of people to accomplish tasks with unprecedented speed, accuracy and scale. To push this idea to its limit, DARPA launched its Network Challenge, which aimed to "explore the roles the Internet and social networking play in the timely communication, wide-area team-building, and urgent mobilization required to solve broad-scope, time-critical problems." The challenge required teams to provide coordinates of ten red weather balloons placed at different locations in the continental United States. This large-scale mobilization required the ability to spread information about the tasks widely and quickly, and to incentivize individuals to act. We report on the winning team's strategy, which utilized a novel recursive incentive mechanism to find all balloons in under nine hours. We analyze the theoretical properties of the mechanism, and present data about its performance in the challenge.Comment: 25 pages, 6 figure

Papers, Please and the systemic approach to engaging ethical expertise in videogames

Papers, Please, by Lucas Pope (2013), explores the story of a customs inspector in the fictional political regime of Arstotzka. In this paper we explore the stories, systems and moral themes of Papers, Please in order to illustrate the systemic approach to designing videogames for moral engagement. Next, drawing on the Four Component model of ethical expertise from moral psychology, we contrast this systemic approach with the more common scripted approach. We conclude by demonstrating the different strengths and weaknesses that these two approaches have when it comes to designing videogames that engage the different aspects of a player’s moral expertise