Sciweavers

1688 search results - page 132 / 338
» The Complexity of Rationalizing Matchings
Sort
View
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 10 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
ISMIR
2001
Springer
121views Music» more  ISMIR 2001»
15 years 10 months ago
Musical Works as Information Retrieval Entities: Epistemological Perspectives
Musical works form a key entity for music information retrieval. Explicit linkage of relationships among entities is critical for document-based information retrieval. Works conta...
Richard P. Smiraglia
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 10 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
IWAI
1999
Springer
15 years 10 months ago
Redesigning the Agents' Decision Machinery
In a multi-agent system, agents must decide what to do and by what order. Autonomy is a key notion in such a system, since it is mainly the autonomy of the agents that makes the en...
Luis Antunes, Helder Coelho
FC
2010
Springer
141views Cryptology» more  FC 2010»
15 years 9 months ago
When Information Improves Information Security
We investigate a mixed economy of an individual rational expert and several na¨ıve near-sighted agents in the context of security decision making. Agents select between three ca...
Jens Grossklags, Benjamin Johnson, Nicolas Christi...