5995 search results - page 391 / 1199 » Algorithmic Game Theory |
186
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
227
click to vote
TARK
2007
Springer
16 years 1 months ago
2007
Springer
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
210
click to vote
CCS
2005
ACM
16 years 1 months ago
2005
ACM
We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated...
186
click to vote
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...
190
click to vote
ATAL
2006
Springer
15 years 11 months ago
2006
Springer
The most natural way of thinking about negotiation is probably a situation whereby each of the parties involved initially make a proposal that is particularly beneficial to themse...