Minimizing Rosenthal Potential in Multicast Games
From MaRDI portal
Publication:3167040
DOI10.1007/978-3-642-31585-5_47zbMath1367.91038arXiv1309.6797OpenAlexW2567986414MaRDI QIDQ3167040
Michał Pilipczuk, Jesper Nederlof, Petr A. Golovach, Fedor V. Fomin
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.6797
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43)
This page was built for publication: Minimizing Rosenthal Potential in Multicast Games