3 citations · 5 across the 4 of their papers we have counts for
5 papers
Edge-dominance games on graphs
Farid Arthaud, Edan Orzech, Martin Rinard
We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent…
Playing repeated games with sublinear randomness
Farid Arthaud
We study the amount of entropy players asymptotically need to play a repeated normal-form game in a Nash equilibrium. Hubáček, Naor, and Ullman (SAGT'15, TCSys'16) gave sufficient…
Depth-bounded Epistemic Logic
Farid Arthaud, Martin Rinard
Epistemic logics model how agents reason about their beliefs and the beliefs of other agents. Existing logics typically assume the ability of agents to reason perfectly about propo…
Depth-bounded epistemic logic
Farid Arthaud, Martin Rinard
Epistemic logics model how agents reason about their beliefs and the beliefs of other agents. Existing logics typically assume the ability of agents to reason perfectly about propo…
Decentralized Inference via Capability Type Structures in Cooperative Multi-Agent Systems
Charles Jin, Zhang-Wei Hong, Farid Arthaud +2
This work studies the problem of ad hoc teamwork in teams composed of agents with differing computational capabilities. We consider cooperative multi-player games in which each age…