5995 search results - page 37 / 1199 » Algorithmic Game Theory |
109
Voted
CCS
2008
ACM
15 years 1 months ago
2008
ACM
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
111
click to vote
NIPS
2001
15 years 28 days ago
2001
We consider the problem of learning to attain multiple goals in a dynamic environment, which is initially unknown. In addition, the environment may contain arbitrarily varying ele...
SIGECOM
2008
ACM
14 years 11 months ago
2008
ACM
We report on an extensive series of highly controlled human subject experiments in networked trade. Our point of departure is a simple and well-studied bipartite network exchange ...
NIPS
2004
15 years 28 days ago
2004
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...