Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2010.436
URN: urn:nbn:de:0030-drops-28847
URL: https://drops.dagstuhl.de/opus/volltexte/2010/2884/
Goel, Gagan ; Tripathi, Pushkar ; Wang, Lei
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
| pdf-format: |
|
Abstract
Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the property of decreasing marginal cost. A natural first step to model such functions is to consider submodular functions. However, many fundamental problems have turned out to be extremely hard to approximate under general submodular functions, thus indicating the need for a systematic study of subclasses of submodular functions that are practically motivated and yield good approximation ratios. In this paper, we introduce and study an important subclass of submodular functions, which we call discounted price functions. These functions are succinctly representable and generalize linear(additive) price functions. We study the following fundamental combinatorial optimization problems: edge cover, spanning tree, perfect matching and $s-t$ path. We give both upper and lower bound for the approximability of these problems.
BibTeX - Entry
@InProceedings{goel_et_al:LIPIcs:2010:2884,
author = {Gagan Goel and Pushkar Tripathi and Lei Wang},
title = {{Combinatorial Problems with Discounted Price Functions in Multi-agent Systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {436--446},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Kamal Lodaya and Meena Mahajan},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2884},
URN = {urn:nbn:de:0030-drops-28847},
doi = {10.4230/LIPIcs.FSTTCS.2010.436},
annote = {Keywords: Approximation algorithm, decreasing marginal cost, submodular function, discounted price function}
}
| Keywords: | Approximation algorithm, decreasing marginal cost, submodular function, discounted price function | |
| Seminar: | IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) | |
| Issue date: | 2010 | |
| Date of publication: | 14.12.2010 |
