Sciweavers

1698 search results - page 75 / 340
» Growing Complex Games
Sort
View
TARK
2007
Springer
15 years 4 months ago
The computational complexity of choice sets
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
Felix Brandt, Felix A. Fischer, Paul Harrenstein
LWA
2007
14 years 11 months ago
Taking the Teacher's Perspective for User Modeling in Complex Domains
Serious games that should adapt training to the individual might benefit from methods that are developed for intelligent tutoring systems. One method, model tracing, might be used...
Christian P. Janssen, Hedderik van Rijn
CORR
2002
Springer
159views Education» more  CORR 2002»
14 years 9 months ago
Complexity of Mechanism Design
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
Vincent Conitzer, Tuomas Sandholm
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 7 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
2000
14 years 11 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm