The bargaining set for almost-convex games
From MaRDI portal
Publication:2348764
DOI10.1007/S10479-012-1226-YzbMATH Open1320.91022OpenAlexW2013208181MaRDI QIDQ2348764FDOQ2348764
Authors: Jesús Getán, Jesús Montes, Carles Rafels, Josep M. 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
Recommendations
Cites Work
- On the concavity of delivery games
- Cores of convex games
- The kernel and bargaining set for convex games
- Title not available (Why is that?)
- On the convexity of precedence sequencing games
- An equivalence theorem for a bargaining set
- Existence of stable payoff configurations for cooperative games
- On the core, the Weber set and convexity in games with a priori unions
- Convex multi-choice games: characterizations and monotonic allocation schemes
- Clan games
- On the convexity of games corresponding to sequencing situations with due dates.
- On extreme points of the core and reduced games
- The reactive bargaining set for cooperative games
- Convex and exact games with non-transferable utility
- Prosperty properties of TU-games
- On the bargaining set, kernel and core of superadditive games
- Quasi-cores in bargaining sets
- Equivalence between bargaining sets and the core in simple games
- An existence theorem for a bargaining set
- A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura)
- ON BARGAINING SETS IN SYMMETRIC GAMES
- Average monotonic cooperative games
- Bargaining sets and the core in partitioning games
- Core equivalence theorems for infinite convex games
- Activity optimization games with complementarity
Cited In (17)
- The core and the steady bargaining set for convex games
- Aubin core and bargaining set for almost-convex fuzzy cooperative games
- Beyond Nash bargaining theory: The Nash set
- The reactive bargaining set of some flow games and of superadditive simple games
- The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
- The semireactive bargaining set of a cooperative game
- Title not available (Why is that?)
- A characterization of convex games by means of bargaining sets
- On Bargaining Sets of Convex NTU Games
- Title not available (Why is that?)
- The bargaining set of four-person balanced games
- Reactive and Semi-Reactive Bargaining Sets for Games with Restricted Cooperation
- Bargaining with many players: a limit result
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subbalanced games and bargaining sets
This page was built for publication: The bargaining set for almost-convex games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348764)