A framework for robustness to ambiguity of higher-order beliefs

Stauber, Ronald
August 2014
International Journal of Game Theory;Aug2014, Vol. 43 Issue 3, p525
Academic Journal
Standard type spaces induce belief structures defined by precise beliefs. This paper proposes and analyzes simple procedures for constructing perturbations of such belief structures in which beliefs have a degree of ambiguity. Specifically, we construct ambiguous type spaces whose induced (ambiguous) belief hierarchies approximate the standard, precise, belief hierarchies corresponding to the initial type space. Based on a metric that captures the resulting approximation, two alternative procedures to construct such perturbations are introduced, and are shown to yield a simple and intuitive characterization of convergence to the initial unperturbed environment. As a special case, one of these procedures is shown to characterize the set of all finite perturbations. The introduced perturbations and their convergence properties provide conceptual foundations for the analysis of robustness to ambiguity of various solutions concepts, and for various decision rules under ambiguity.


Related Articles

  • Robust exponential convergence of hp FEM for singularly perturbed reaction–diffusion systems with multiple scales. Melenk, J. M.; Xenophontos, C.; Oberbroeckling, L. // IMA Journal of Numerical Analysis;Apr2013, Vol. 33 Issue 2, p609 

    We consider a coupled system of two singularly perturbed reaction–diffusion equations in one dimension. Associated with the two singular perturbation parameters 0 < ɛ ≤ μ ≤ 1 are boundary layers of length scales (ɛ) and (μ). We propose and analyse...

  • A discussion on the Hölder and robust finite-time partial stabilizability of Brockett’s integrator. Jammazi, Chaker // ESAIM: Control, Optimisation & Calculus of Variations;Apr2012, Vol. 18 Issue 2, p360 

    We consider chained systems that model various systems of mechanical or biological origin. It is known according to Brockett that this class of systems, which are controllable, is not stabilizable by continuous stationary feedback (i.e. independent of time). Various approaches have been proposed...

  • Convergence and perturbation resilience of dynamic string-averaging projection methods. Censor, Yair; Zaslavski, Alexander // Computational Optimization & Applications;Jan2013, Vol. 54 Issue 1, p65 

    We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of string-averaging projection (SAP) methods for the CFP, analyzing their convergence and their perturbation resilience. In the past, SAP methods were formulated with a single predetermined set of...

  • Balanced POD for linear PDE robust control computations. Singler, John; Batten, Belinda // Computational Optimization & Applications;Sep2012, Vol. 53 Issue 1, p227 

    A mathematical model of a physical system is never perfect; therefore, robust control laws are necessary for guaranteed stabilization of the nominal model and also 'nearby' systems, including hopefully the actual physical system. We consider the computation of a robust control law for...

  • On Inverse Optimal Control Problems of Human Locomotion: Stability and Robustness of the Minimizers. Chittaro, F.; Jean, F.; Mason, P. // Journal of Mathematical Sciences;Dec2013, Vol. 195 Issue 3, p269 

    In recent papers, models of human locomotion by means of optimal control problems have been proposed. In this paradigm, the trajectories are assumed to be solutions of an optimal control problem whose cost has to be determined. The purpose of the present paper is to analyze the class of optimal...

  • A robust recurrent simultaneous perturbation stochastic approximation training algorithm for recurrent neural networks. Xu, Zhao; Song, Qing; Wang, Danwei // Neural Computing & Applications;Jun2014, Vol. 24 Issue 7/8, p1851 

    Training of recurrent neural networks (RNNs) introduces considerable computational complexities due to the need for gradient evaluations. How to get fast convergence speed and low computational complexity remains a challenging and open topic. Besides, the transient response of learning process...

  • Spin density of radicals by finite field many-body methods[ATOTHER]@f[/ATOTHER] a[ATOTHER]@f[/ATOTHER] ). Sekino, Hideo; Bartlett, Rodney J. // Journal of Chemical Physics;5/1/1985, Vol. 82 Issue 9, p4225 

    The spin densities of several small radicals CH3, NH2,CH2CH, BeH, and H2CO+ are calculated by a finite field coupled-cluster method using a spin density operator as a finite perturbation on the systems. The calculated hyperfine coupling constants of the π radicals are in good agreement with...

  • Static hyperpolarizabilities and polarizabilities of linear polyynes. Maroulis, George; Thakkar, Ajit J. // Journal of Chemical Physics;12/15/1991, Vol. 95 Issue 12, p9060 

    The dipole polarizability(α) and second dipole hyperpolarizability(γ) tensors are calculated, by finite-field methods, for the ground states of butadiyne, hexatriyne, and octatetrayne. The effects of varying one-particle basis sets and molecular geometry, and the effects of including...

  • A Robust Weak Taylor Approximation Scheme for Solutions of Jump-Diffusion Stochastic Delay Differential Equations. Yanli Zhou; Yonghong Wu; Xiangyu Ge; Wiwatanapataphee, B. // Abstract & Applied Analysis;2013, p1 

    Stochastic delay differential equations with jumps have a wide range of applications, particularly, inmathematical finance. Solution of the underlying initial value problems is important for the understanding and control of many phenomena and systems in the real world. In this paper, we...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics