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

Maximizing selections from the core of a cooperative game

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

DOI10.1007/S10898-011-9668-3zbMath1262.91027OpenAlexW2073396367MaRDI QIDQ539505

Hans Keiding

Publication date: 30 May 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9668-3


zbMATH Keywords

monotonicitycooperative gamescoremaximizers


Mathematics Subject Classification ID

Cooperative games (91A12)





Cites Work

  • Unnamed Item
  • Cooperative systems. Control and optimization. Many papers based on the presentations at the 5th international conference on cooperative control and optimization, Gainesville, FL, USA, January 20--22, 2005.
  • Pareto optimality, game theory and equilibria
  • Optimization and cooperative control strategies. Proceedings of the 8th international conference on cooperative control and optimization, Gainesville, FL, USA, January 30--February 1, 2008
  • Monotonic solutions of cooperative games
  • Population monotonic solutions on convex games
  • The nucleolus is not aggregate-monotonic on the domain of convex games
  • Core and monotonic allocation methods.
  • The kernel of a cooperative game
  • Introduction to the Theory of Cooperative Games




This page was built for publication: Maximizing selections from the core of a cooperative game

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:539505&oldid=12430520"
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 06:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki