The bargaining set for almost-convex games
From MaRDI portal
Publication:2348764
DOI10.1007/s10479-012-1226-yzbMath1320.91022OpenAlexW2013208181MaRDI QIDQ2348764
Carles Rafels, Jesús Getán, Jesús Montes, Josep Maria Izquierdo
Publication date: 15 June 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2445/107049
Cites Work
- Unnamed Item
- A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura)
- The reactive bargaining set for cooperative games
- Convex and exact games with non-transferable utility
- On the convexity of precedence sequencing games
- On the core, the Weber set and convexity in games with a priori unions
- Bargaining sets and the core in partitioning games
- Convex multi-choice games: characterizations and monotonic allocation schemes
- Activity optimization games with complementarity
- An equivalence theorem for a bargaining set
- Clan games
- On the concavity of delivery games
- On extreme points of the core and reduced games
- Prosperty properties of TU-games
- On the bargaining set, kernel and core of superadditive games
- Quasi-cores in bargaining sets
- Core equivalence theorems for infinite convex games
- Equivalence between bargaining sets and the core in simple games
- Cores of convex games
- The kernel and bargaining set for convex games
- An existence theorem for a bargaining set
- ON BARGAINING SETS IN SYMMETRIC GAMES
- Existence of stable payoff configurations for cooperative games
- On the convexity of games corresponding to sequencing situations with due dates.
- Average monotonic cooperative games
This page was built for publication: The bargaining set for almost-convex games
