Sciweavers

894 search results - page 58 / 179
» Game Theory with Costly Computation
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 3 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
AAAI
2007
15 years 8 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
ATAL
2008
Springer
15 years 8 months ago
Strategic betting for competitive agents
In many multiagent settings, each agent's goal is to come out ahead of the other agents on some metric, such as the currency obtained by the agent. In such settings, it is no...
Liad Wagman, Vincent Conitzer
IEEEARES
2006
IEEE
16 years 5 days ago
Towards a Stochastic Model for Integrated Security and Dependability Evaluation
We present a new approach to integrated security and dependability evaluation, which is based on stochastic modelling techniques. Our proposal aims to provide operational measures...
Karin Sallhammar, Bjarne E. Helvik, Svein J. Knaps...
ECBS
2005
IEEE
101views Hardware» more  ECBS 2005»
15 years 11 months ago
Self-Managing Systems: A Control Theory Foundation
The high cost of operating large computing installations has motivated a broad interest in reducing the need for human intervention by making systems self-managing. This paper exp...
Yixin Diao, Joseph L. Hellerstein, Sujay S. Parekh...