Related papers: Locally Finite Knowledge Structures
The problem of efficient sharing of a resource is nearly ubiquitous. Except for pure public goods, each agent's use creates a negative externality; often the negative externality is so strong that efficient sharing is impossible in the…
Blameworthiness of an agent or a coalition of agents is often defined in terms of the principle of alternative possibilities: for the coalition to be responsible for an outcome, the outcome must take place and the coalition should have had…
Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest poker agents are represented as massive binary files. In…
Quantum information is nonlocal in the sense that local measurements on a composite quantum system, prepared in one of many mutually orthogonal states, may not reveal in which state the system was prepared. It is shown that in the many copy…
Quantum uncertainty is a well-known property of quantum mechanics that states the impossibility of predicting measurement outcomes of multiple incompatible observables simultaneously. In contrast, the uncertainty in the classical domain…
Conventional noncooperative game theory hypothesizes that the joint strategy of a set of players in a game must satisfy an "equilibrium concept". All other joint strategies are considered impossible; the only issue is what equilibrium…
The form and justification of inductive inference rules depend strongly on the representation of uncertainty. This paper examines one generic representation, namely, incomplete information. The notion can be formalized by presuming that the…
A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this…
Incompatibility of certain measurements -- impossibility of obtaining deterministic outcomes simultaneously -- is a well known property of quantum mechanics. This feature can be utilized in many contexts, ranging from Bell inequalities to…
The possibility to describe the laws of the Universe in a computational way seems to be correlated to a principle that the density of information is bounded. This principle, that is dual to that of a finite velocity of information, has…
J. Beck has shown that if two players alternately select previously unchosen points from the plane, Player 1 can always build a congruent copy of any given finite goal set G, in spite of Player 2's efforts to stop him. We give a finite goal…
In this note, I explore the implications of informational robustness under the assumption of common belief in rationality. That is, predictions for incomplete-information games which are valid across all possible information structures.…
Every physical measuring needs a finite, different from zero measurement time and provides information in form of the choice of a measurement result from all possible measurement results. If infinitely many (different) measurement results…
Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simple such strategies can get. The answer may…
Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…
Nonlocal games yield an unusual perspective on entangled quantum states. The defining property of such games is that a set of players in joint possession of an entangled state can win the game with higher probability than is allowed by…
Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior…
Recent work by Faizal et al. (2025) claims that G\"odelian undecidability of non-algorithmic truths in our universe imply the impossibility of a formal, algorithmic simulation of the universe. This paper clarifies the distinction between…
Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…
We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…