5995 search results - page 213 / 1199 » Algorithmic Game Theory |
143
click to vote
PROVSEC
2007
Springer
15 years 10 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
157
Voted
JSAC
2008
15 years 4 months ago
2008
If a network is to operate successfully, its users need to collaborate. Collaboration takes the form of following a network protocol and involves some resource expenditure on the p...
106
click to vote
EUSFLAT
2007
15 years 5 months ago
2007
We define two negotiation protocols for Group Decision Making, which main feature is the existence of acceptation thresholds. In order to predict which consensus are expected to ...
118
click to vote
AI
2007
Springer
15 years 4 months ago
2007
Springer
The area of learning in multi-agent systems is today one of the most fertile grounds for interaction between game theory and artificial intelligence. We focus on the foundational...
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...