Stirling, W - Satisficing Games And Decision Making With Applications To Engineering And Computer Science Cup.pdf

This page intentionally left blank
Satisficing Games and Decision Making
In our day to day lives we constantly make decisions that are simply “good enough” rather than
optimal – a type of decision for which Professor Wynn Stirling has adopted the word “satisficing.”
puter-based decision-making algorithms, on the other hand, doggedly seek only the optimal
solution based on rigid criteria, and reject any others. In this book, Professor Stirling outlines an
alternative approach, using novel algorithms and techniques which can be used to find satisficing
solutions. Building on traditional decision and game theory, these techniques allow decision-making
systems to cope with more subtle situations where self and group interest conflict, perfect solutions
can’t be found and human issues need to be taken into account – in short, more closely modeling
the way humans make decisions. The book will therefore be of great interest to engineers, computer
scientists, and mathematicians working on artificial intelligence and expert systems.
Wynn C. Stirling is a Professor of Electrical puter Engineering at Brigham Young University,
where he teaches stochastic processes, control theory, and signal processing. His research interests
include decision theory, multi-agent control theory, detection and estimation theory, information
theory, and stochastic processes.
Satisficing Games and
Decision Making
With applications to engineering puter science
Wynn C. Stirling
Brigham Young University

Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, São Paulo
Cambridge University Press
The Edinburgh Building, Cambridge , United Kingdom
Published in the United States of America by Cambridge University Press, New York
Information on this title: 0521817240
© Cambridge University Press 2003
This book is in copyright. Subject to statutory exception and to the provision of
relevant collective licensing agreements, no repr