Sciweavers

1653 search results - page 32 / 331
» Computer science and game theory
Sort
View
94
Voted
ATAL
2007
Springer
15 years 7 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 4 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
123
Voted
ATAL
2010
Springer
15 years 1 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
95
Voted
ATAL
2008
Springer
15 years 2 months ago
Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments
Coalition formation is an important capability for automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered i...
Naoki Ohta, Vincent Conitzer, Yasufumi Satoh, Atsu...
111
Voted
HOA
1993
15 years 5 months ago
Theory Interpretation in Simple Type Theory
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself...
William M. Farmer