Towards a general theory of non-cooperative computation
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Rational secret sharing and multiparty computation: extended abstract
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Non-cooperative computation: boolean functions with correctness and exclusivity
Theoretical Computer Science - Game theory meets theoretical computer science
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
K-NCC: stability against group deviations in non-cooperative computation
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Hi-index | 0.00 |
A function is subsidized non-cooperative computable [SNCC] if honest agents can compute it by reporting truthfully their private inputs, while unilateral deviations by the players are not beneficial: if a deviation from truth revelation can mislead other agents, this deviation will decrease the deviator's chances of correct computation, or, it will not affect these chances but the expected payment to the deviator will decrease; in addition, deviations can not increase the expected monetary payments to a deviator without decreasing his chances of correct computation. This paper extends the study of SNCC functions to the context of group deviations. A function is K-SNCC if deviations by a group of at most K agents are not beneficial. We provide a full characterization of the K-SNCC functions, both for the independent values and the correlated values settings.