Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games
From MaRDI portal
Publication:2019479
DOI10.1007/978-3-030-58150-3_29OpenAlexW3082040925MaRDI QIDQ2019479
Gregory Gutin, Philip R. Neary, Anders Yeo
Publication date: 21 April 2021
Full work available at URL: https://arxiv.org/abs/2003.07106
Related Items (2)
Exact capacitated domination: on the computational complexity of uniqueness ⋮ Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games
Cites Work
- Unnamed Item
- Unnamed Item
- Public goods in networks
- Clustering and domination in perfect graphs
- Independent domination in graphs: A survey and recent results
- Capacitated domination faster than \(O(2^n)\)
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games
- Capacitated domination: problem complexity and approximation algorithms
- Deferred acceptance algorithms: history, theory, practice, and open questions
- Non-cooperative games
- Round-Optimal Password-Based Authenticated Key Exchange
- Network Games
- Equilibrium points in n -person games
- College Admissions and the Stability of Marriage
This page was built for publication: Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games
