Sciweavers

19 search results - page 4 / 4
» Approximating Wardrop Equilibria with Finitely Many Agents
Sort
View
NIPS
2008
13 years 7 months ago
Multi-Agent Filtering with Infinitely Nested Beliefs
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...
Luke S. Zettlemoyer, Brian Milch, Leslie Pack Kael...
ICS
2010
Tsinghua U.
14 years 2 months ago
Game Theory with Costly Computation: Formulation and Application to Protocol Security
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
Joseph Y. Halpern, Rafael Pass
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 5 months ago
Game Theory with Costly Computation
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
Joseph Y. Halpern, Rafael Pass
AAAI
2008
13 years 8 months ago
A Scalable Jointree Algorithm for Diagnosability
Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in...
Anika Schumann, Jinbo Huang