NIST · ИТ · 712aecfec02e6223c7d3
On Shortest Random Walks under Adversarial Uncertainty
Finding shortest feasible paths in a weighted graph has numerous applications including admission and routing in communication networks. This paper discusses a game theoretic framework intended to incorporate a concept of path stability into the process of
NIST · ИТОфициальный источник · 2003-05-01
{
"title_en": "On Shortest Random Walks under Adversarial Uncertainty",
"designation": "",
"series": "",
"status": "",
"date": "2003-05-01",
"date_original": "May 1, 2003",
"url": "https://www.nist.gov/publications/shortest-random-walks-under-adversarial-uncertainty",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Vladimir V. Marbukh",
"abstract_excerpt_en": "Finding shortest feasible paths in a weighted graph has numerous applications including admission and routing in communication networks. This paper discusses a game theoretic framework intended to incorporate a concept of path stability into the process of",
"id": "712aecfec02e6223c7d3",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "On Shortest Random Walks under Adversarial Uncertainty",
"designation": "",
"series": "",
"status": "",
"date": "2003-05-01",
"date_original": "May 1, 2003",
"url": "https://www.nist.gov/publications/shortest-random-walks-under-adversarial-uncertainty",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Vladimir V. Marbukh",
"abstract_excerpt_en": "Finding shortest feasible paths in a weighted graph has numerous applications including admission and routing in communication networks. This paper discusses a game theoretic framework intended to incorporate a concept of path stability into the process of"
}
],
"translation_state": "none"
}