Sciweavers

803 search results - page 86 / 161
» Game Theory and Decision Theory in Multi-Agent Systems
Sort
View
LPAR
2005
Springer
14 years 2 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
FOCS
2009
IEEE
14 years 4 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
CCS
2005
ACM
14 years 2 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
AINA
2007
IEEE
14 years 3 months ago
QoS-LI: QoS Loss Inference in Disadvantaged Networks
— Quality of Service (QoS) of disadvantaged networks is usually considered from a purely network standpoint in existing works. Adversarial intervention in such networks is not an...
Vidyaraman Sankaranarayanan, Shambhu J. Upadhyaya,...
ATAL
2008
Springer
13 years 11 months ago
Synthesis of strategies from interaction traces
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
Tsz-Chiu Au, Sarit Kraus, Dana S. Nau