Knowledge, probability, and adversaries
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Given a class of adversaries, it is shown how to assign probability spaces to agents in a way most appropriate for that class, where “most appropriate” is made precise in terms this betting game.
Abstract
Article Knowledge, probability, and adversaries Share on Authors: J. Y. Halpern IBM Almaden Research Center, San Jose, CA IBM Almaden Research Center, San Jose, CAView Profile , M. R. Tuttle MIT Laboratory for Computer Science, Cambridge, MA MIT Laboratory for Computer Science, Cambridge, MAView Profile Authors Info & Claims PODC '89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computingJune 1989 Pages 103–118https://doi.org/10.1145/72981.72988Published:01 June 1989 10citation253DownloadsMetricsTotal Citations10Total Downloads253Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access