On the benefits of cheating by self-interested agents in vehicular networks

Proceedings of the International Conference on Autonomous Agents

Volumn , Issue , 2007, Pages 327-334

  Lin, Raz ^a   Kraus, Sarit ^a   Shavitt, Yuval ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Agent based deployed applications; Artificial social systems

Indexed keywords

AGENT-BASED DEPLOYED APPLICATIONS; ARTIFICIAL SOCIAL SYSTEMS; CAR MANUFACTURERS; COUNTER-MEASURES; DENSE URBAN AREAS; DESIGN SYSTEMS; FALSE DATUM; LARGE CITIES; NATURAL EVOLUTIONS; NEW TECHNOLOGIES; SELF-INTERESTED AGENTS; SIMULATION ENVIRONMENTS; SOCIAL WELFARES; TRANSPORTATION NETWORKS; VEHICULAR NETWORKS; WI-FI TRANSMITTERS;

APPLICATIONS; AUTONOMOUS AGENTS; FUZZY CLUSTERING;

AGENTS;

EID: 60349099887     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1329125.1329346     Document Type: Conference Paper

References (18)

1. A. Bejan and R. Lawrence. Peer-to-peer cooperative driving. In Proceedings of ISCIS, pages 259-264, Orlando, USA, October 2002.
2. I. Chisalita and N. Shahmehri. A novel architecture for supporting vehicular communication. In Proceedings of VTC, pages 1002-1006, Canada, September 2002.
3. S. Das, A. Nandan, and G. Pan. Spawn: A swarming protocol for vehicular ad-hoc wireless networks. In Proceedings of VANET, pages 93-94, 2004.
4. A. Datta, S. Quarteroni, and K. Aberer. Autonomous gossiping: A self-organizing epidemic algorithm for selective information dissemination in mobile ad-hoc networks. In Proceedings of IC-SNW, pages 126-143, Maison des Polytechniciens, Paris, France, June 2004.
5. D. Dolev, R. R.eischuk, and H. R. Strong. Early stopping in byzantine agreement. JACM, 37(4):720-741, 1990.
6. GM. Threat assessment algorithm. http://www.nhtsa.dot.gov/people/injury/ research/pub/acas/acas-fieldtest/, 2000.
7. Honda. http://world.honda.com/news/2005/c050902.html.
8. Lamport, Shostak, and Pease. The byzantine generals problem. In Advances in Ultra-Dependable Distributed Systems, N. Suri, C. J. Walter, and M. M. Hugue (Eds.). IEEE Computer Society Press, 1982.
9. C. Leckie and R. Kotagiri. Policies for sharing distributed probabilistic beliefs. In Proceedings of ACSC, pages 285-290, Adelaide, Australia, 2003.
10. D. Malkhi, E. Pavlov, and Y. Sella. Gossip with malicious parties. Technical report: 2003-9, School of Computer Science and Engineering - The Hebrew University of Jerusalem, Israel, March 2003.
11. Y. M. Minsky and F. B. Schneider. Tolerating malicious gossip. Distributed Computing, 16(1):49-68, February 2003.
12. M. J. Osborne and A. Rubinstein. A Course In Game Theory. MIT Press, Cambridge MA, 1994.
13. R. Parshani. Routing in gossip networks. Master's thesis, Department of Computer Science, Bar-Ilau University, Ramat-Gan, Israel, October 2004.
14. R. Parshani, S. Kraus, and Y. Shavitt. A study of gossiping in transportation networks. Submitted for publication, 2006.
15. Y. Shavitt and A. Shay. Optimal routing in gossip networks. IEEE Transactions on Vehicular Technology, 54(4):1473-1487, July 2005.
16. N. Shibata, T. Terauchi, T. Kitani, K. Yasumoto, M. Ito, and T. Higashino. A method for sharing traffic jam information using inter-vehicle communication. In Proceedings of V2VCOM, USA, 2006.
17. W. Wang, X.-Y. Li, and Y. Wang. Truthful multicast routing in selfish wireless networks. In Proceedings of MobiCom, pages 245-259, USA, 2004.
18. B. Yu and M. P. Singh. A social mechanism of reputation management in electronic communities. In Proceedings of CIA, 2000.