Stable solutions for multiple scenario cost allocation games with partial information

DOI10.1007/s10479-014-1755-7zbMath1406.91214OpenAlexW2089927056MaRDI QIDQ342800

D. V. Borrero, Miguel A. Hinojosa, Amparo M. Mármol

Publication date: 18 November 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1755-7

zbMATH Keywords

cooperative gamescost allocationcore conceptsmultiple scenario

Mathematics Subject Classification ID

Cooperative games (91A12) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

A preemptive goal programming for multi‐objective cooperative games: an application to multi‐objective linear production

Cites Work

• Unnamed Item
• Core, least core and nucleolus for multiple scenario cooperative games
• Traveling salesman games
• On the core of routing games
• Cournot competition under uncertainty: conservative and optimistic equilibria
• A natural selection from the core of a TU game: the core-center
• Bargaining over multiple issues with maximin and leximin preferences
• Multiple Objective Linear Programming with Interval Criterion Weights
• A multi‐objective model for bank ATM networks
• The Nucleolus of a Characteristic Function Game
• Sequential incorporation of imprecise information in multiple criteria decision processes
• Core solutions in vector-valued games

This page was built for publication: Stable solutions for multiple scenario cost allocation games with partial information