Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A communication network routing problem: modeling and optimization using non-cooperative game theory

From MaRDI portal
Publication:2043002
Jump to:navigation, search

DOI10.34768/amcs-2021-0011zbMath1469.91009OpenAlexW3169715255MaRDI QIDQ2043002

Suresh H. Ghate, Ganesh D. Kedar, Sapana P. Dubey

Publication date: 22 July 2021

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://sciendo.com/pdf/10.34768/amcs-2021-0011


zbMATH Keywords

game theoryNash equilibriumfocal pointscommunication networkrouting problemPareto optimal solution


Mathematics Subject Classification ID

Noncooperative games (91A10) Network design and communication in computer systems (68M10) Applications of game theory (91A80)




Cites Work

  • Equilibrium, games, and pricing in transportation and telecommunication networks
  • A flow and routing control policy for communication networks with multiple competitive users
  • Competitive routing in networks with polynomial costs


This page was built for publication: A communication network routing problem: modeling and optimization using non-cooperative game theory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2043002&oldid=14519193"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 20:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki