Supermodular NTU-games

DOI10.1016/j.orl.2016.04.007zbMath1380.91016OpenAlexW2150683396MaRDI QIDQ1694770

Takamasa Suzuki, Gleb A. Koshevoy, Adolphus J. J. Talman

Publication date: 6 February 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.04.007

zbMATH Keywords

convexityShapley valuesupermodularitycoremarginal vector

Mathematics Subject Classification ID

Cooperative games (91A12) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (1)

Analysis of the \(n\)-person noncooperative supermodular multiobjective games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong convexity of NTU games
• Convex games without side payments
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• A note on NTU convexity
• The consistent Shapley value for hyperplane games
• The MC-value for monotonic NTU-games
• The Bargaining Problem
• USING THE ASPIRATION CORE TO PREDICT COALITION FORMATION
• An Axiomatization of the Non-Transferable Utility Value
• Other Solutions to Nash's Bargaining Problem
• THE EXTENDED CORE OF A COOPERATIVE NTU GAME
• A Simplified Bargaining Model for the n-Person Cooperative Game

This page was built for publication: Supermodular NTU-games