A representation theorem for events within lattice structures of state-spaces
For the standard lattice model of information structures, we derive a reduced poset representation which provides the same informational content as the complete lattice structure which derives it. Rational agents can recover the complete lattice of events by means of the reduced poset alone. We find that both structures provide isomorphic models under mild conditions.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Fundamental Theorem of Phyllotaxis revisited
Jean's `Fundamental Theorem of Phyllotaxis' (\emph{Phyllotaxis: a systematic study in Plant Morphogenesis}, CUP 1994) describes the relationship between the count numbers of observed spirals in cylindrical lattices and t…
Clearing Sections of Lattice Liability Networks
Modern financial networks involve complex obligations that transcend simple monetary debts: multiple currencies, prioritized claims, supply chain dependencies, and more. We present a mathematical framework that unifies a…
DescriptiveOrder-theoretical fixed point theorems for correspondences and application in game theory
For an ascending correspondence $F:X\to 2^X$ with chain-complete values on a complete lattice $X$, we prove that the set of fixed points is a complete lattice. This strengthens Zhou's fixed point theorem. For chain-compl…
LatticeGraphNet: A two-scale graph neural operator for simulating lattice structures
This study introduces a two-scale Graph Neural Operator (GNO), namely, LatticeGraphNet (LGN), designed as a surrogate model for costly nonlinear finite-element simulations of three-dimensional latticed parts and structur…
Monte Carlo Tree Search for a single target search game on a 2-D lattice
Monte Carlo Tree Search (MCTS) is a branch of stochastic modeling that utilizes decision trees for optimization, mostly applied to artificial intelligence (AI) game players. This project imagines a game in which an AI pl…