Search Results for author:
Found 5 papers, 0 papers with code
Two-Person Adversarial Games are Zero-Sum: An Elaboration of a Folk Theorem
The observation that every two-person adversarial game is an affine transformation of a zero-sum game is traceable to Luce-Raiffa (1957) and made explicit in Aumann (1987).
Strengthening Consistency Results in Modal Logic
and then shows the assumptions codified by the theory in question to be consistent with those background axioms.
Representation and Invariance in Reinforcement Learning
We define two types of mappings, called weak and strong translations, between RL frameworks and prove that existence of these mappings enables two types of intelligence comparison according to the mappings preserving relative intelligence.
Adversarial Attacks in Cooperative AI
Single-agent reinforcement learning algorithms in a multi-agent environment are inadequate for fostering cooperation.
When is an Example a Counterexample?
In this extended abstract, we carefully examine a purported counterexample to a postulate of iterated belief revision.
