Sciweavers

5995 search results - page 155 / 1199
» Algorithmic Game Theory
Sort
View
EOR
2011
140views more  EOR 2011»
14 years 10 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 10 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
IWEC
2004
15 years 5 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
JCT
1998
193views more  JCT 1998»
15 years 3 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 8 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin