منابع مشابه
Justifying Cursed Equilibria via Partial Awareness
We show that given any finite Bayesian game with a commonly-known common prior probability distribution, its set of cursed equilibria coincides a set of Bayesian Nash equilibria of an augmented game where players perceive other players types as if they are partially aware of others’ original information structures. Consistent with the intuition that cursedness implies scarce computational resou...
متن کاملConsistency of Vanishingly Smooth Fictitious Play
We discuss consistency of Vanishingly Smooth Fictitious Play, a strategy in the context of game theory, which can be regarded as a smooth fictitious play procedure, where the smoothing parameter is time-dependent and asymptotically vanishes. This answers a question initially raised by Drew Fudenberg and Satoru Takahashi. 1. Introduction and background A recurring question in the theory of repea...
متن کاملOptimal Soft Arc Consistency
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by shifting weights between cost functions. The principal aim is to produce a good lower bound on the cost of solutions, an essential ingredient of a branch and bound search. But soft AC is much more complex than tradition...
متن کاملJustifying the small-world phenomenon via random recursive trees
We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the technique is three-fold: it is quite simple and provides short proofs, it is applicable to a broad variety of models including those incorporating preferential attac...
متن کاملAn Optimal k-Consistency Algorithm
This paper generalizes the arc-consistency algorithm of Mohr and Henderson [4] and the pathconsistency algorithm of Han and Lee [2] to a k-consistency algorithm (arc-consistency and path-consistency being 2-consistency and 3-consistency, respectively). The algorithm is a development of Freuder's synthesis algorithm [1]. It simultaneously establishes i-consistency for each 1 <~ i <~ k. It has wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Economics
سال: 2019
ISSN: 1933-6837
DOI: 10.3982/te3423