Jump to ContentJump to Main Navigation
Computing Possible Futures$
Users without a subscription are not able to see the full content.

William B. Rouse

Print publication date: 2019

Print ISBN-13: 9780198846420

Published to Oxford Scholarship Online: September 2019

DOI: 10.1093/oso/9780198846420.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 06 December 2019

Introduction

Introduction

Chapter:
(p.1) Chapter 1 Introduction
Source:
Computing Possible Futures
Author(s):

William B. Rouse

Publisher:
Oxford University Press
DOI:10.1093/oso/9780198846420.003.0001

Chapter 1 provides the introduction to this book. Predictions can seldom specify what will happen, so, inevitably, one addresses what might happen. There are often many possible futures, with leading indicators and potential tipping points for each scenario. Computational models can be used to explore designs of systems and policies to determine whether these designs will likely be effective and to aid in decision-making. Models are means to ends rather then ends in themselves. Decision-makers seldom crave models. They want their questions answered in an evidence-based manner. Decision-makers want insights that provide them with a competitive advantage. They want to understand possible futures to formulate robust and resilient strategies for addressing these futures.

Keywords:   prediction, future, model, decision-making, competitive advantage, strategy

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .