Popular models for decision making under ambiguity assume that people use not one but multiple priors. This paper is a first attempt to experimentally elicit the min and the max of multiple priors directly. In an ambiguous scenario we measure a participant’s single prior, her min and max of multiple priors, and the valuation of an ambiguous asset with the same underlying states as the ambiguous...

We present a solution to the Maxmin u/E parameters estimation problem of possibility distributions in m-dimensional case. Our method is based on geometrical approach, where minimal area enclosing ellipsoid is constructed around the sample. Also we demonstrate that one can improve results of well-known algorithms in fuzzy model identification task using Maxmin u/E parameters estimation. Keywords...

In this paper, we consider network games with incomplete information. In particular, we apply a game-theoretic network model to analyze Bayesian games on a MaxMin router. The results show that the MaxMin mechanism induces desirable Nash equilibria.

We study a discounted maxmin control problem with general state space. The controller is unsure about his model in the sense that he also considers a class of approximate models as possibly true. The objective is to choose a maxmin strategy that will work under a range of different model specifications. This is done by dynamic programming techniques. Under relatively weak conditions, we show th...

Extensive-form games with imperfect recall are an important game-theoretic model that allows a compact representation of strategies in dynamic strategic interactions. Practical use of imperfect recall games is limited due to negative theoretical results: a Nash equilibrium does not have to exist, computing maxmin strategies is NP-hard, and they may require irrational numbers. We present the fir...

The problem of allocating maxmin rates with minimum rate constraints for connection-oriented networks is considered. This paper proves that the convergence of maxmin rate allocation satisfies a partial ordering in the bottleneck links. This partial ordering leads to a tighter lower bound for the convergence time for any maxmin protocol. An optimally fast maxmin rate allocation protocol called t...

There are many unavoidable noise interferences in image acquisition and transmission. To make it better for subsequent processing, the noise in the image should be removed in advance. There are many kinds of image noises, mainly including salt and pepper noise and Gaussian noise. This paper focuses on the research of the Gaussian noise removal. It introduces many wavelet threshold denoising alg...

We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes. The primary objective is to derive a distributed coordination method for schedule construction and modification for any wireless ad-hoc network that operates under a schedule where transmissions at each slot are explicitl...

The α–maxmin model is a prominent example of preferences under Knightian uncertainty as it allows to distinguish ambiguity and ambiguity attitude. These preferences are dynamically inconsistent for nontrivial versions of α. In this paper, we derive a recursive, dynamically consistent version of the α–maxmin model. In the continuous–time limit, the resulting dynamic utility function can be repre...

Throughput, fairness, and energy consumption are often conflicting objectives in multi-hop wireless networks. In this paper, we propose the notion of lexicographical maxmin energy efficiency throughput fairness that achieves throughput fairness per unit energy. Compared with maxmin throughput fairness and maxmin time fairness, the proposed scheme allocates more bandwidth to nodes with relay req...