Sharing Nonconvex Costs
The paper analyses cooperative games with side payments. Each player facesa possibly non-convex optimization problem, interpreted as production planning, constrained by his resources or technology. Coalitions can aggreagate members' contributions. We discuss instances where such aggregation eliminates or reduces the lack of convexity. Core solutions are computed or approximated via dual programs associated to the grand coalition.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||2000|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.uib.no/econ/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:bereco:1300. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.