Sciweavers

SYNTHESE
2010
102views more  SYNTHESE 2010»
13 years 2 months ago
Coherent choice functions under uncertainty
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...
FLAIRS
2000
13 years 5 months ago
A Deterministic Algorithm for Solving Imprecise Decision Problems
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...
Håkan L. S. Younes, Love Ekenberg
ALT
2010
Springer
13 years 5 months ago
Optimal Online Prediction in Adversarial Environments
: 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 ...
Peter L. Bartlett
ECAI
2006
Springer
13 years 7 months ago
Decision with Uncertainties, Feasibilities, and Utilities: Towards a Unified Algebraic Framework
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...
Cédric Pralet, Gérard Verfaillie, Th...
FSTTCS
1992
Springer
13 years 7 months ago
Structural Average Case Complexity
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...
Rainer Schuler, Tomoyuki Yamakami
PKC
2001
Springer
95views Cryptology» more  PKC 2001»
13 years 8 months ago
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
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...
Tatsuaki Okamoto, David Pointcheval
ISAAC
2009
Springer
87views Algorithms» more  ISAAC 2009»
13 years 8 months ago
Parameterizing Cut Sets in a Graph by the Number of Their Components
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 ...
Takehiro Ito, Marcin Kaminski, Daniël Paulusm...
FORMATS
2003
Springer
13 years 8 months ago
Folk Theorems on the Determinization and Minimization of Timed Automata
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...
Stavros Tripakis
HICSS
2003
IEEE
154views Biometrics» more  HICSS 2003»
13 years 9 months ago
A Framework for Argumentation of Decision Task Generation and Identification
AbstractAbstractAbstract Decision task and its features are defined in order to distinguish motions, decision purposes, decision problems, alternatives, etc. Indicators of decision...
Jingle Sun, Pengzhu Zhang, Shaochuan Cheng
TARK
2005
Springer
13 years 9 months ago
Individual error, group error, and the value of information
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...
Itai Sher