English
Related papers

Related papers: Dominance in the Monty Hall Problem

200 papers

Unaided human decision making appears to systematically violate consistency constraints imposed by normative theories; these biases in turn appear to justify the application of formal decision-analytic models. It is argued that both claims…

Artificial Intelligence · Computer Science 2013-04-08 Marvin S. Cohen

I describe a Bayesian persuasion problem where Receiver has a private type representing a cutoff for choosing Sender's preferred action, and Sender has maxmin preferences over all Receiver type distributions with known mean and bounds. This…

Theoretical Economics · Economics 2025-09-03 Eitan Sapiro-Gheiler

Stochastic dominance is a fundamental concept in decision-making under uncertainty and quantitative finance, yet its practical application is hindered by computational intractability due to infinitely many constraints. We introduce the…

Optimization and Control · Mathematics 2025-02-27 Rajmadan Lakshmanan , Alois Pichler

Weak selection, which means a phenotype is slightly advantageous over another, is an important limiting case in evolutionary biology. Recently it has been introduced into evolutionary game theory. In evolutionary game dynamics, the…

Populations and Evolution · Quantitative Biology 2010-10-15 Bin Wu , Philipp M. Altrock , Long Wang , Arne Traulsen

A central problem in online learning and decision making -- from bandits to reinforcement learning -- is to understand what modeling assumptions lead to sample-efficient learning guarantees. We consider a general adversarial decision making…

Machine Learning · Computer Science 2022-06-28 Dylan J. Foster , Alexander Rakhlin , Ayush Sekhari , Karthik Sridharan

The Transience objective is not to visit any state infinitely often. While this is not possible in finite Markov Decision Process (MDP), it can be satisfied in countably infinite ones, e.g., if the transition graph is acyclic. We prove the…

Probability · Mathematics 2021-07-06 Stefan Kiefer , Richard Mayr , Mahsa Shirmohammadi , Patrick Totzke

The game theoretic concepts of rationalizability and iterated dominance are closely related and provide characterizations of each other. Indeed, the equivalence between them implies that in a two player finite game, the remaining set of…

Computer Science and Game Theory · Computer Science 2024-05-28 Roy Long

If scale invariance is a classical symmetry then both the Planck scale and the weak scale should emerge as quantum effects. We show that this can be realized in simple scale invariant theories with a hidden sector. The weak/Planck scale…

High Energy Physics - Phenomenology · Physics 2008-11-26 Robert Foot , Archil Kobakhidze , Kristian L. McDonald , Raymond R. Volkas

We consider the Moran process with two populations competing under an iterated Prisoners' Dilemma in the presence of mutation, and concentrate on the case where there are multiple Evolutionarily Stable Strategies. We perform a complete…

Dynamical Systems · Mathematics 2015-12-23 Lee DeVille , Meghan Galiardi

Bounded rationality, that is, decision-making and planning under resource limitations, is widely regarded as an important open problem in artificial intelligence, reinforcement learning, computational neuroscience and economics. This paper…

Machine Learning · Statistics 2015-12-22 Pedro A. Ortega , Daniel A. Braun , Justin Dyer , Kee-Eung Kim , Naftali Tishby

The problem of estimating a normal covariance matrix is considered from a decision-theoretic point of view, where the dimension of the covariance matrix is larger than the sample size. This paper addresses not only the nonsingular case but…

Statistics Theory · Mathematics 2015-06-03 Hisayuki Tsukuma

We consider a multidimensional random walk in a product random environment with bounded steps, transience in some spatial direction, and high enough moments on the regeneration time. We prove an invariance principle, or functional central…

Probability · Mathematics 2015-05-13 Firas Rassoul-Agha , Timo Seppalainen

We consider the problem of variable selection in linear models when $p$, the number of potential regressors, may exceed (and perhaps substantially) the sample size $n$ (which is possibly small).

Computational and complexity theory are core components of the computer science curriculum, and in the vast majority of cases are taught using decision problems as the main paradigm. For experienced practitioners, decision problems are the…

Computers and Society · Computer Science 2017-12-11 John MacCormick

Most of the stochastic orders for comparing random variables, considered in the literature, are afflicted with two main drawbacks: (i) lack of connex property and (ii) lack of consideration of any dependence structure between the random…

Methodology · Statistics 2021-03-03 Sugata Ghosh , Asok K. Nanda

Bayesian Networks (BN) provide robust probabilistic methods of reasoning under uncertainty, but despite their formal grounds are strictly based on the notion of conditional dependence, not much attention has been paid so far to their use in…

Artificial Intelligence · Computer Science 2013-01-30 Luigi Portinale , Andrea Bobbio

This paper deals with the representation and solution of asymmetric Bayesian decision problems. We present a formal framework, termed asymmetric influence diagrams, that is based on the influence diagram and allows an efficient…

Artificial Intelligence · Computer Science 2013-01-18 Thomas D. Nielsen , Finn Verner Jensen

We consider the problem of rational decision making in the presence of nonlinear constraints. By using tools borrowed from spin glass and random matrix theory, we focus on the portfolio optimisation problem. We show that the number of…

Disordered Systems and Neural Networks · Physics 2015-06-25 Stefano Galluccio , Jean-Philippe Bouchaud , Marc Potters

In many security and healthcare systems a sequence of features/sensors/tests are used for detection and diagnosis. Each test outputs a prediction of the latent state, and carries with it inherent costs. Our objective is to {\it learn}…

Machine Learning · Computer Science 2016-10-19 Manjesh Hanawal , Csaba Szepesvari , Venkatesh Saligrama

Condorcet domains are subsets of permutations arising in voting theory: regarding their permutations as preference orders on a list of candidates, one avoids Condorcet's paradox when aggregating the preferences via a simple majority…

Combinatorics · Mathematics 2025-09-25 Victor Reiner , Bridget Eileen Tenner