Sciweavers

3229 search results - page 423 / 646
» The Theory of Timed Automata
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ECSCW
1993
15 years 8 months ago
Do Categories Have Politics? The Language/Action Perspective Reconsidered
: Drawing on writings within the CSCW community and on recent social theory, this paper proposes that the adoption of speech act theory as a foundation for system design carries wi...
Lucy A. Suchman
ATAL
2010
Springer
15 years 7 months ago
Monotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
Haris Aziz, Felix Brandt, Paul Harrenstein
JACM
2007
160views more  JACM 2007»
15 years 6 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
CI
2005
106views more  CI 2005»
15 years 6 months ago
Incremental Learning of Procedural Planning Knowledge in Challenging Environments
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
Douglas J. Pearson, John E. Laird