Sciweavers

1599 search results - page 76 / 320
» Algorithms for Parity Games
Sort
View
SCP
2008
91views more  SCP 2008»
14 years 11 months ago
Towards mechanized correctness proofs for cryptographic algorithms: Axiomatization of a probabilistic Hoare style logic
In [5] we build a formal verification technique for game based correctness proofs of cryptograhic algorithms based on a probabilistic Hoare style logic [10]. An important step towa...
Jerry den Hartog
ATAL
2008
Springer
15 years 1 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
ICML
2008
IEEE
16 years 13 days ago
No-regret learning in convex games
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
Geoffrey J. Gordon, Amy R. Greenwald, Casey Marks
EOR
2011
140views more  EOR 2011»
14 years 6 months ago
Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
Stefan Bolus
WWW
2009
ACM
15 years 6 months ago
Gamesense
This paper presents a novel game-like advertising system called GameSense, which is driven by the compelling contents of online images. Given a Web page which typically contains i...
Lusong Li, Tao Mei, Chris Liu, Xian-Sheng Hua