On the benefits of cheating by self-interested agents in vehicular networks
暂无分享,去创建一个
Sarit Kraus | Yuval Shavitt | Raz Lin | Sarit Kraus | Y. Shavitt | R. Lin
[1] Kotagiri Ramamohanarao,et al. Policies for Sharing Distributed Probabilistic Beliefs , 2003, ACSC.
[2] Giovanni Pau,et al. SPAWN: a swarming protocol for vehicular ad-hoc wireless networks , 2004, VANET '04.
[3] Ramon Lawrence,et al. Peer-to-Peer Cooperative Driving , 2002 .
[4] Fred B. Schneider,et al. Tolerating malicious gossip , 2003, Distributed Computing.
[5] Nahid Shahmehri,et al. A novel architecture for supporting vehicular communication , 2002, Proceedings IEEE 56th Vehicular Technology Conference.
[6] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[7] Danny Dolev,et al. Early stopping in Byzantine agreement , 1990, JACM.
[8] Yuval Shavitt,et al. Optimal routing in gossip networks , 2005, IEEE Transactions on Vehicular Technology.
[9] Teruo Higashino,et al. A Method for Sharing Traffic Jam Information using Inter-Vehicle Communication , 2006, 2006 3rd Annual International Conference on Mobile and Ubiquitous Systems - Workshops.
[10] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[11] Sarit Kraus,et al. A Study on Gossiping in Transportation Networks , 2008, IEEE Transactions on Vehicular Technology.
[12] Munindar P. Singh,et al. A Social Mechanism of Reputation Management in Electronic Communities , 2000, CIA.
[13] Xiang-Yang Li,et al. Truthful multicast routing in selfish wireless networks , 2004, MobiCom '04.
[14] Neeraj Suri,et al. Advances in ULTRA-Dependable Distributed Systems , 1994 .
[15] Karl Aberer,et al. Autonomous Gossiping: A Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Wireless Mobile Ad-Hoc Networks , 2004, ICSNW.