Abstract
A lot of decisions that are made during an agent’s behavior computation include randomized choices (e.g., see Chap. 2 and 5). This chapter argues in favor of a “fair” random choice and points out that the computation of an alternative’s utility should be focused instead of empirically tuning choice parameters of less informed selection methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2001). Choice Randomization. In: Constraint-Based Agents. Lecture Notes in Computer Science(), vol 2062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45746-1_10
Download citation
DOI: https://doi.org/10.1007/3-540-45746-1_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42258-7
Online ISBN: 978-3-540-45746-6
eBook Packages: Springer Book Archive