@inproceedings{4fd7f69d1f05416bb1c91eaebc77527d,
title = "Incentive-compatible distributed greedy protocols",
abstract = "Under many distributed protocols, the prescribed behavior for participants is to behave greedily, i.e., to repeatedly {"}best respond{"} to the others' actions. We present recent work (Proc. ICS'11) where we tackle the following general question: {"}When is it best for a long-sighted participant to adhere to a distributed greedy protocol?{"}. We take a game-theoretic approach and exhibit a class of games where greedy behavior (i.e., repeated best-response) is incentive compatible for all players. We identify several environments of interest that fall within this class, thus establishing the incentive compatibility of the natural distributed greedy protocol for each. These environments include models of the Border Gateway Protocol (BGP) [4], which handles routing on the Internet, and of the Transmission Control Protocol (TCP) [3], and also stable-roommates assignments [2] and cost-sharing [5], which have been extensively studied in economic theory.",
keywords = "game theory, greedy protocols",
author = "Noam Nisan and Michael Schapira and Gregory Valiant and Aviv Zohar",
year = "2011",
doi = "10.1145/1993806.1993871",
language = "الإنجليزيّة",
isbn = "9781450307192",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "335--336",
booktitle = "PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing",
note = "30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC ; Conference date: 06-06-2011 Through 08-06-2011",
}