MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Approximating the least core value and least core of cooperative games with supermodular costs

Author(s)
Schulz, Andreas S.; Uhan, Nelson A.
Thumbnail
DownloadSchultz_Approximating the.pdf (257.2Kb)
PUBLISHER_CC

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution http://creativecommons.org/licenses/by-nc-nd/4.0/
Metadata
Show full item record
Abstract
We study the approximation of the least core value and the least core of supermodular cost cooperative games. We provide a framework for approximation based on oracles that approximately determine maximally violated constraints. This framework yields a 3-approximation algorithm for computing the least core value of supermodular cost cooperative games, and a polynomial-time algorithm for computing a cost allocation in the 2-approximate least core of these games. This approximation framework extends naturally to submodular profit cooperative games. For scheduling games, a special class of supermodular cost cooperative games, we give a fully polynomial-time approximation scheme for computing the least core value. For matroid profit games, a special class of submodular profit cooperative games, we give exact polynomial-time algorithms for computing the least core value as well as a least core cost allocation.
Date issued
2013-03
URI
http://hdl.handle.net/1721.1/99147
Department
Sloan School of Management
Journal
Discrete Optimization
Publisher
Elsevier
Citation
Schulz, Andreas S., and Nelson A. Uhan. “Approximating the Least Core Value and Least Core of Cooperative Games with Supermodular Costs.” Discrete Optimization 10, no. 2 (May 2013): 163–180.
Version: Author's final manuscript
ISSN
15725286

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.