Locally Finite Knowledge Structures
Robert Samuel Simon

TL;DR
This paper explores the concept of local finiteness in knowledge structures within game theory, analyzing its implications for equilibria, common knowledge, and the complexity of infinite state spaces.
Contribution
It introduces the notion of local finiteness in knowledge structures and examines its complex relationship with common knowledge and structure size in multi-agent systems.
Findings
Local finiteness implies common knowledge of a countable set of points.
Uncountably many locally finite structures can share the same common knowledge set.
Finitely generated common knowledge sets cannot correspond to structures with infinitely many points.
Abstract
In a game of incomplete information, an infinite state space can create problems. When the space is uncountably large, the strategy spaces of the players may be unwieldly, resulting in a lack of measurable equilibria. When the knowledge of a player allows for an infinite number of possibilities, without conditions on the behavior of the other players, that player may be unable to evaluate and compare the payoff consequences of her actions. We argue that local finiteness is an important and desirable property, namely that at every point in the state space every player knows that only a finite number of points are possible. Local finiteness implies a kind of common knowledge of a countable number of points. Unfortunately its relationship to other forms of common knowledge is complex. In the context of the multi-agent propositional calculus, if the set of formulas held in common knowledge…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Game Theory and Applications · Auction Theory and Applications
