Sciweavers

92 search results - page 7 / 19
» Representing and Reasoning about Game Strategies
Sort
View
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
ATAL
2011
Springer
12 years 7 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
INFORMATICASI
2010
13 years 4 months ago
Strategic Modeling of Information Sharing among Data Privacy Attackers
Research in privacy-preserving data publishing has revealed the necessity of accounting for an adversary's background knowledge when reasoning about the protection afforded b...
Quang Duong, Kristen LeFevre, Michael P. Wellman
VL
2000
IEEE
115views Visual Languages» more  VL 2000»
13 years 12 months ago
SD2: A Sound and Complete Diagrammatic Reasoning System
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
John Howse, Fernando Molina, John Taylor
IJWIS
2007
153views more  IJWIS 2007»
13 years 7 months ago
A security framework for agent-based systems
Purpose – This paper aims to address some security issues in open systems such as service-oriented applications and grid computing. It proposes a security framework for these sy...
Jamal Bentahar, Francesca Toni, John-Jules Ch. Mey...