Sharing Supermodular Costs
We study cooperative games with supermodular costs. We show that supermodular costs arise in a variety of situations; in particular, we show that the problem of minimizing a linear function over a supermodular polyhedron—a problem that often arises in combinatorial optimization—has supermodular opti...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
INFORMS
2011
|
| Online Access: | http://hdl.handle.net/1721.1/67659 https://orcid.org/0000-0002-9595-459X |