5995 search results - page 218 / 1199 » Algorithmic Game Theory |
135
click to vote
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
117
click to vote
AMC
2008
15 years 4 months ago
2008
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
169
click to vote
FLAIRS
2006
15 years 5 months ago
2006
The process of coalition formation, where distinct autonomous agents come together to act as a coherent group is an important form of interaction in multiagent systems. Previous w...
162
click to vote
ICIP
2008
IEEE
15 years 10 months ago
2008
IEEE
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
143
Voted
ASIAN
2006
Springer
15 years 8 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...