Skip to main content

Two Prediction Methods for Intention-Aware Online Routing Games

  • Conference paper
  • First Online:
Multi-Agent Systems and Agreement Technologies (EUMAS 2017, AT 2017)

Abstract

Intention-aware prediction is regarded as an important agreement technology to help large amount of agents in aligning their activities towards an equilibrium. If the agents do not align their activities in online routing games, then the multi-agent system is not guaranteed to get to a stable equilibrium. We formally define two intention-aware prediction methods for online routing games and empirically evaluate them in a real-world scenario. The experiments confirm that the defined intention-aware routing strategies limit the fluctuation in this online routing game scenario and make the system more or less converge to the equilibrium.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://internet.kozut.hu/Lapok/forgalomszamlalas.aspx.

References

  1. Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)

    Google Scholar 

  2. Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 45–52, PODC 2006. ACM, New York (2006)

    Google Scholar 

  3. Claes, R., Holvoet, T.: Traffic coordination using aggregation-based traffic predictions. IEEE Intell. Syst. 29(4), 96–100 (2014)

    Article  Google Scholar 

  4. Claes, R., Holvoet, T., Weyns, D.: A decentralized approach for anticipatory vehicle routing using delegate multi-agent systems. IEEE Trans. Intell. Transp. Syst. 12(2), 364–373 (2011)

    Article  Google Scholar 

  5. Fischer, S., Vöcking, B.: On the evolution of selfish routing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 323–334. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30140-0_30

    Chapter  Google Scholar 

  6. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)

    Book  Google Scholar 

  7. Rosenschein, J.S.: Multiagent systems, and the search for appropriate foundations. In: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2013, pp. 5–6 (2013). www.ifaamas.org/

  8. Roughgarden, T.: Routing games. In: Algorithmic Game Theory, pp. 461–486. Cambridge University Press, New York (2007)

    Google Scholar 

  9. Sandholm, W.H.: Potential games with continuous player sets. J. Econ. Theor. 97(1), 81–108 (2001)

    Article  MathSciNet  Google Scholar 

  10. Varga, L.: On intention-propagation-based prediction in autonomously self-adapting navigation. Scalable Comput. Pract. Exp. 16(3), 221–232 (2015)

    Google Scholar 

  11. Varga, L.Z.: Online routing games and the benefit of online data. In: Klügl, F., Vizzari, G., Vokřínek, J. (eds.) ATT 2014 8th International Workshop on Agents in Traffic and Transportation, Held at the 13th International Conference on Autonomous Agents and Multiagent Systems, 5–6 May 2014, Paris, France, pp. 88–95 (2014)

    Google Scholar 

  12. Varga, L.Z.: Paradox phenomena in autonomously self-adapting navigation. Cybern. Inf. Technol. 15(5), 78–87 (2015)

    MathSciNet  Google Scholar 

  13. Varga, L.Z.: Benefit of online real-time data in the braess paradox with anticipatory routing. In: Kounev, S., Giese, H., Liu, J. (eds.) 2016 IEEE International Conference on Autonomic Computing, ICAC 2016, 17–22 July 2016, Würzburg, Germany, pp. 245–250. IEEE Computer Society (2016)

    Google Scholar 

  14. Varga, L.Z.: How good is predictive routing in the online version of the braess paradox? In: Kaminka, G.A., Fox, M., Bouquet, P., Hüllermeier, E., Dignum, V., Dignum, F., van Harmelen, F. (eds.) ECAI 2016, Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 1696–1697. IOS Press (2016)

    Google Scholar 

  15. Varga, L.Z.: Equilibrium with predictive routeing in the online version of the braess paradox. IET Softw. 11(4), 165–170 (2017)

    Article  Google Scholar 

  16. Varga, L.Z.: Game theory models for the verification of the collective behaviour of autonomous cars. In: Bulwahn, L., Kamali, M., Linker, S. (eds.) Proceedings First Workshop on Formal Verification of Autonomous Vehicles. Electronic Proceedings in Theoretical Computer Science, 19 September 2017, Turin, Italy, vol. 257, pp. 27–34. Open Publishing Association (2017)

    Google Scholar 

  17. Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. Part II 1(36), 352–378 (1952)

    Google Scholar 

  18. de Weerdt, M.M., Stein, S., Gerding, E.H., Robu, V., Jennings, N.R.: Intention-aware routing of electric vehicles. IEEE Trans. Intell. Transp. Syst. 17(5), 1472–1482 (2016)

    Article  Google Scholar 

  19. Wooldridge, M.: An Introduction to MultiAgent Systems, 2nd edn. Wiley, Hoboken (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to László Z. Varga .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Varga, L.Z. (2018). Two Prediction Methods for Intention-Aware Online Routing Games. In: Belardinelli, F., Argente, E. (eds) Multi-Agent Systems and Agreement Technologies. EUMAS AT 2017 2017. Lecture Notes in Computer Science(), vol 10767. Springer, Cham. https://doi.org/10.1007/978-3-030-01713-2_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-01713-2_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-01712-5

  • Online ISBN: 978-3-030-01713-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics