We discuss several features of coherent choice functions – where the admissible options in a decision problem are exactly those which maximize expected utility for some probabil...
Teddy Seidenfeld, Mark J. Schervish, Joseph B. Kad...
Today there are numerous tools for decision analysis, suitable both for human and artificial decision makers. Most of these tools require the decision maker to provide precise num...
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
AbstractAbstractAbstract Decision task and its features are defined in order to distinguish motions, decision purposes, decision problems, alternatives, etc. Indicators of decision...
Abstract This paper studies the interaction of error and information both in a single-person setting and in an interactive setting. In contrast to Blackwell’s Theorem, which says...