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

On the nucleolus of shortest path games

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

DOI10.1007/978-3-319-66700-3_5zbMath1403.91028OpenAlexW2747628745MaRDI QIDQ681844

Mourad Baïou, Francisco Barahona

Publication date: 13 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66700-3_5


zbMATH Keywords

cooperative gamesnucleolusshortest path games


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games involving graphs (91A43)


Related Items (5)

An algorithm to compute the nucleolus of shortest path games ⋮ Path cooperative games ⋮ Network strength games: the core and the nucleolus ⋮ A heuristic procedure for computing the nucleolus ⋮ Computing the nucleolus of weighted voting games in pseudo-polynomial time






This page was built for publication: On the nucleolus of shortest path games

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