Sciweavers

1688 search results - page 172 / 338
» The Complexity of Rationalizing Matchings
Sort
View
STACS
2001
Springer
15 years 10 months ago
Randomness, Computability, and Density
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
211
Voted
POPL
1998
ACM
15 years 10 months ago
A Type System for Java Bytecode Subroutines
Java is typically compiled into an intermediate language, JVML, that is interpreted by the Java Virtual Machine. Because mobile JVML code is not always trusted, a bytecode verifi...
Raymie Stata, Martín Abadi
FC
2006
Springer
145views Cryptology» more  FC 2006»
15 years 9 months ago
Efficient Correlated Action Selection
Abstract. Participants in e-commerce and other forms of online collaborations tend to be selfish and rational, and therefore game theory has been recognized as particularly relevan...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...
ATAL
2008
Springer
15 years 8 months ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
ATAL
2008
Springer
15 years 8 months ago
Distributed multiagent resource allocation in diminishing marginal return domains
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
Yoram Bachrach, Jeffrey S. Rosenschein