1451 search results - page 92 / 291 » Order independence and rationalizability |
144
click to vote
UAI
2000
15 years 7 months ago
2000
We introduce Game networks (G nets), a novel representation for multi-agent decision problems. Compared to other game-theoretic representations, such as strategic or extensive for...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
134
click to vote
ENDM
2006
15 years 6 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
150
click to vote
JCT
2008
15 years 6 months ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
141
click to vote
JSYML
2006
15 years 6 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...