Collected and edited by Noah Levin -/- Table of Contents: -/- UNIT ONE: INTRODUCTION TO CONTEMPORARY ETHICS: TECHNOLOGY, AFFIRMATIVE ACTION, AND IMMIGRATION 1 The “Trolley Problem” and Self-Driving Cars: Your Car’s Moral Settings (Noah Levin) 2 What is Ethics and What Makes Something a Problem for Morality? (David Svolba) 3 Letter from the Birmingham City Jail (Martin Luther King, Jr) 4 A Defense of Affirmative Action (Noah Levin) 5 The Moral Issues of Immigration (B.M. Wooldridge) 6 The Ethics of (...) our Digital Selves (Noah Levin) -/- UNIT TWO: TORTURE, DEATH, AND THE “GREATER GOOD” 7 The Ethics of Torture (Martine Berenpas) 8 What Moral Obligations do we have (or not have) to Impoverished Peoples? (B.M. Wooldridge) 9 Euthanasia, or Mercy Killing (Nathan Nobis) 10 An Argument Against Capital Punishment (Noah Levin) 11 Common Arguments about Abortion (Nathan Nobis & Kristina Grob) 12 Better (Philosophical) Arguments about Abortion (Nathan Nobis & Kristina Grob) -/- UNIT THREE: PERSONS, AUTONOMY, THE ENVIRONMENT, AND RIGHTS 13 Animal Rights (Eduardo Salazar) 14 John Rawls and the “Veil of Ignorance” (Ben Davies) 15 Environmental Ethics: Climate Change (Jonathan Spelman) 16 Rape, Date Rape, and the “Affirmative Consent” Law in California (Noah Levin) 17 The Ethics of Pornography: Deliberating on a Modern Harm (Eduardo Salazar) 18 The Social Contract (Thomas Hobbes) -/- UNIT FOUR: HAPPINESS 19 Is Pleasure all that Matters? Thoughts on the “Experience Machine” (Prabhpal Singh) 20 Utilitarianism (J.S. Mill) 21 Utilitarianism: Pros and Cons (B.M. Wooldridge) 22 Existentialism, Genetic Engineering, and the Meaning of Life: The Fifths (Noah Levin) 23 The Solitude of the Self (Elizabeth Cady Stanton) 24 Game Theory, the Nash Equilibrium, and the Prisoner’s Dilemma (Douglas E. Hill) -/- UNIT FIVE: RELIGION, LAW, AND ABSOLUTE MORALITY 25 The Myth of Gyges and The Crito (Plato) 26 God, Morality, and Religion (Kristin Seemuth Whaley) 27 The Categorical Imperative (Immanuel Kant) 28 The Virtues (Aristotle) 29 Beyond Good and Evil (Friedrich Nietzsche) 30 Other Moral Theories: Subjectivism, Relativism, Emotivism, Intuitionism, etc. (Jan F. Jacko). (shrink)

The consideration of ‘mutual benefits’ and partner cooperation have long been the accepted standpoint from which to draw inference about the onset, maintenance and breakdown of the coral‐algae endosymbiosis. In this paper, I review recent research into the climate‐induced breakdown of this important symbiosis (namely ‘coral bleaching’) that challenges the validity of this long‐standing belief. Indeed, I introduce a more parsimonious explanation, in which the coral host exerts a ‘controlled parasitism’ over its algal symbionts that is akin to an enforced (...) domestication arrangement. Far from being pathogenic, a range of well‐established cellular processes are reviewed that support the role of the coral host as an active ‘farmer’ of the energy‐rich photoassimilates from its captive symbionts. Importantly, this new paradigm reposes the deleterious bleaching response in terms of an envelope of environmental conditions in which the exploitative and captive measures of the coral host are severely restricted. The ramification of this new paradigm for developing management strategies that may assist the evolution of bleaching resistance in corals is discussed. (shrink)

ABSTRACT In this paper we define two logics, KLn and BLn, and present tableau-based decision procedures for both. KLn is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BLn is somewhat similar; it is a temporal logic that contains connectives for representing the beliefs of agents. In addition to a complete formal definition of the (...) two logics and their decision procedures, the paper includes a brief review of their applications in AI and mainstream computer science, correctness proofs for the decision procedures, a number of worked examples illustrating the decision procedures, and some pointers to further work. (shrink)

In this paper I challenge the notion that a healthy and resilient coral is (in all cases) a fast‐growing coral, and by inference, that a reef characterised by a fast trajectory toward high coral cover is necessarily a healthy and resilient reef. Instead, I explain how emerging evidence links fast skeletal extension rates with elevated coral‐algae (symbiotic) respiration rates, most‐often mediated by nutrient‐enlarged symbiont populations and/or rising sea temperatures. Elevated respiration rates can act to reduce the autotrophic capacity (photosynthesis:respiration ratio) (...) of the symbiosis. This restricts the capacity of the coral host to build and maintain sufficient energy reserves (e.g. lipids) needed to sustain essential homeostatic functions, including sexual reproduction and biophysical stress resistance. Moreover, it explains the somewhat paradoxical scenario, whereby at the ecological instant before the reef‐building capacity of the symbiosis is lost, a reef can look visually at its best and be accreting CaCO3 at its maximum. (shrink)

This volume represents an advanced, comprehensive state-of-the-art survey of the field of rational agency as it stands today. It covers the philosophical foundations of rational agency, logical and decision-theoretic approaches to rational agency, multi-agent aspects of rational agency and a number of approaches to programming rational agents. It will be of interest to researchers in logic, mainstream computer science, the philosophy of rational action and agency, and economics.

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time Temporal Logic (ATL). The key insight (...) in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as group can cooperate to bring about iff it is common knowledge in that . The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems. (shrink)

As they are conventionally formulated, Boolean games assume that players make their choices in ignorance of the choices being made by other players – they are games of simultaneous moves. For many settings, this is clearly unrealistic. In this paper, we show how Boolean games can be enriched by dependency graphs which explicitly represent the informational dependencies between variables in a game. More precisely, dependency graphs play two roles. First, when we say that variable x depends on variable y, then (...) we mean that when a strategy assigns a value to variable x, it can be informed by the value that has been assigned to y. Second, and as a consequence of the first property, they capture a richer and more plausible model of concurrency than the simultaneous-action model implicit in conventional Boolean games. Dependency graphs implicitly define a partial ordering of the run-time events in a game: if x is dependent on y, then the assignment of a value to y must precede the assignment of a value to x; if x and y are independent, however, then we can say nothing about the ordering of assignments to these variables—the assignments may occur concurrently. We refer to Boolean games with dependency graphs as partial-order Boolean games. After motivating and presenting the partial-order Boolean games model, we explore its properties. We show that while some problems associated with our new games have the same complexity as in conventional Boolean games, for others the complexity blows up dramatically. We also show that the concurrency in partial-order Boolean games can be modelled using a closure-operator semantics, and conclude by considering the relationship of our model to Independence-Friendly logic. (shrink)

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give a (...) complete axiomatization. To demonstrate the value of the logic, we show in particular how it can be applied to the problem of determining whether a social choice function is strategy-proof. (shrink)

Understanding the flow of knowledge in multi-agent protocols is essential when proving the correctness or security of such protocols. Current logical approaches, often based on model checking, are well suited for modeling knowledge in systems where agents do not act strategically. Things become more complicated in strategic settings. In this paper we show that such situations can be understood as a special type of game – a knowledge condition game – in which a coalition “wins” if it is able to (...) bring about some epistemic condition. This paper summarizes some results relating to these games. Two proofs are presented for the computational complexity of deciding whether a coalition can win a knowledge condition game with and without opponents (Σ2P-complete and NP-complete respectively). We also consider a variant of knowledge condition games in which agents do not know which strategies are played, and prove that under this assumption, the presence of opponents does not affect the complexity. The decision problem without opponents is still NP-complete, but requires a different proof. (shrink)

Rational agents are important objects of study in several research communities, including economics, philosophy, cognitive science, and most recently computer science and artificial intelligence. Crudely, a rational agent is an entity that is capable of acting on its environment, and which chooses to act in such a way as to further its own best interests. There has recently been much interest in the use of mathematical logic for developing formal theories of such agents. Such theories view agents as practical reasoning (...) systems, deciding moment by moment which action to perform next, given the beliefs they have about the world and their desires with respect to how they would like the world to be. In this article, we survey the state of the art in developing logical theories of rational agency. Following a discussion on the dimensions along which such theories can vary, we briefly survey the logical tools available in order to construct such theories. We then review and critically assess three of the best known theories of rational agency: Cohen and Levesque's intention logic, Rao and Georgeff's BDI logics, and the KARO framework of Meyer et al. We then discuss the various roles that such logics can play in helping us to engineer rational agents, and conclude with a discussion of open problems. (shrink)

Photography’s initial claim to represent has been derived from a privileging of the visible world, which, it might be argued, is reinforced by the limited visibility of the camera. The proliferations of utilitarian photographies, therefore, are necessarily also the elimination of the non-visible. Such a notion of visibility, when contested, might provide the starting point for a reconception of the photographic in which the apparently indexical medium is filtered through alternative relationships to representation, transparency and, ultimately, even the discourse of (...) realism. This article proposes that an alternative conception of realism might sceptically underline the limitation of the photographic apparatus in relating to but also limiting the world. (shrink)

We address the issue of manipulating games through communication. In the specific setting we consider (a variation of Boolean games), we assume there is some set of environment variables, the values of which are not directly accessible to players; the players have their own beliefs about these variables, and make decisions about what actions to perform based on these beliefs. The communication we consider takes the form of (truthful) announcements about the values of some environment variables; the effect of an (...) announcement is the modification of the beliefs of the players who hear the announcement so that they accurately reflect the values of the announced variables. By choosing announcements appropriately, it is possible to perturb the game away from certain outcomes and towards others. We specifically focus on the issue of stabilisation: making announcements that transform a game from having no stable states to one that has stable configurations. (shrink)

We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs of Quantified Coalition Logic (QCL) allow us to express such properties as “every coalition satisfying property P can achieve φ” and “there exists a coalition C satisfying property P such that C can achieve φ”. We give an axiomatisation of QCL, and show that while it is no more expressive than Coalition Logic, it is (...) nevertheless exponentially more succinct. The complexity of QCL model checking for symbolic and explicit state representations is shown to be no worse than that of Coalition Logic, and satisfiability for QCL is shown to be no worse than satisfiability for Coalition Logic. We illustrate the formalism by showing how to succinctly specify such social choice mechanisms as majority voting, which in Coalition Logic require specifications that are exponentially long in the number of agents. (shrink)

A fundamental problem in game theory is the possibility of reaching equilibrium outcomes with undesirable properties, e.g., inefficiency. The economics literature abounds with models that attempt to modify games in order to avoid such undesirable properties, for example through the use of subsidies and taxation, or by allowing players to undergo a bargaining phase before their decision. In this paper, we consider the effect of such transformations in Boolean games with costs, where players control propositional variables that they can set (...) to true or false, and are primarily motivated to seek the satisfaction of some goal formula, while secondarily motivated to minimise the costs of their actions. We adopt preparation sets as our basic solution concept. A preparation set is a set of outcomes that contains for every player at least one best response to every outcome in the set. Prep sets are well-suited to the analysis of Boolean games, because we can naturally represent prep sets as propositional formulas, which in turn allows us to refer to prep formulas. The preference structure of Boolean games with costs makes it possible to distinguish between hard and soft prep sets. The hard prep sets of a game are sets of valuations that would be prep sets in that game no matter what the cost function of the game was. The properties defined by hard prep sets typically relate to goal-seeking behaviour, and as such these properties cannot be eliminated from games by, for example, taxation or subsidies. In contrast, soft prep sets can be eliminated by an appropriate system of incentives. Besides considering what can happen in a game by unrestricted manipulation of players’ cost function, we also investigate several mechanisms that allow groups of players to form coalitions and eliminate undesirable outcomes from the game, even when taxes or subsidies are not a possibility. (shrink)

Causal reasoning and game-theoretic reasoning are fundamental topics in artificial intelligence, among many other disciplines: this paper is concerned with their intersection. Despite their importance, a formal framework that supports both these forms of reasoning has, until now, been lacking. We offer a solution in the form of (structural) causal games, which can be seen as extending Pearl's causal hierarchy to the game-theoretic domain, or as extending Koller and Milch's multi-agent influence diagrams to the causal domain. We then consider three (...) key questions: i) How can the (causal) dependencies in games - either between variables, or between strategies - be modelled in a uniform, principled manner? ii) How may causal queries be computed in causal games, and what assumptions does this require? iii) How do causal games compare to existing formalisms? To address question i), we introduce mechanised games, which encode dependencies between agents' decision rules and the distributions governing the game. In response to question ii), we present definitions of predictions, interventions, and counterfactuals, and discuss the assumptions required for each. Regarding question iii), we describe correspondences between causal games and other formalisms, and explain how causal games can be used to answer queries that other causal or game-theoretic models do not support. Finally, we highlight possible applications of causal games, aided by an extensive open-source Python library. (shrink)

In this paper, we reflect on current notions of engineering practice by examining some of the motives for engineered solutions to the problem of climate change. We draw on fields such as science and technology studies, the philosophy of technology, and environmental ethics to highlight how dominant notions of apoliticism and ahistoricity are ingrained in contemporary engineering practice. We argue that a solely technological response to climate change does not question the social, political, and cultural tenet of infinite material growth, (...) one of the root causes of climate change. In response to the contemporary engineering practice, we define an activist engineer as someone who not only can provide specific engineered solutions, but who also steps back from their work and tackles the question, What is the real problem and does this problem “require” an engineering intervention? Solving complex problems like climate change requires radical cultural change, and a significant obstacle is educating engineers about how to conceive of and create “authentic alternatives,” that is, solutions that differ from the paradigm of “technologically improving” our way out of problems. As a means to realize radically new solutions, we investigate how engineers might deploy the concept of praxis, which raises awareness in engineers of the inherent politics of technological design. Praxis empowers engineers with a more comprehensive understanding of problems, and thus transforms technologies, when appropriate, into more socially just and ecologically sensitive interventions. Most importantly, praxis also raises a radical alternative rarely considered—not “engineering a solution.” Activist engineering offers a contrasting method to contemporary engineering practice and leads toward social justice and ecological protection through problem solving by asking not, How will we technologize our way out of the problems we face? but instead, What really needs to be done? (shrink)