Sciweavers

4435 search results - page 82 / 887
» Algorithms, games, and the internet
Sort
View
79
Voted
SCP
2008
91views more  SCP 2008»
14 years 10 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
82
Voted
ATAL
2008
Springer
15 years 6 days 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
15 years 11 months 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 5 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
98
Voted
IWEC
2004
14 years 11 months ago
TEAM: The Team-Oriented Evolutionary Adaptability Mechanism
Many commercial computer games allow a team of players to match their skills against another team, controlled by humans or by the computer. Most players prefer human opponents, sin...
Sander Bakkes, Pieter Spronck, Eric O. Postma