A computer scientist looks at game theory
Joseph Y. Halpern
Abstract
I consider issues in distributed computation that should be of relevance to game theory. In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with failures, and (c) specification of mechanisms.
Create a lesson
Related papers
A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities
Dimitris Fotakis, Charalampos Platanos, Thanos Tolias
Faster Verification of PJR+ via Mincuts
Drew Springham
Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
Lishang Xu, Guodong Ma, Pengcheng Weng et al.
A Logarithmic Regret Bound for Optimistic Hedge in General-Sum Games
Junsoo Ha
Condorcet-type properties of the linear ordering problem with ties
Daichi Kawashima, Noriyoshi Sukegawa
On Periodic and Aperiodic Optimal Strategies in Solvency Games
Quentin Guilmant, Florian Luca, Richard Mayr et al.