Combinatorial problems with discounted price functions in multi-agent systems

DOI10.4230/LIPICS.FSTTCS.2010.436MaRDI QIDQ2908875zbMATH OpenFDO

Authors Gagan Goel, Pushkar Tripathi, Lei Wang

Publication date 29 August 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_a2f5.html

zbMATH Keywords

approximation algorithmdecreasing marginal costdiscounted price functionsubmodular function

Mathematics Subject Classification ID

Applications of graph theory (05C90) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Inapproximability results for combinatorial auctions with submodular utility functions
• Prize‐collecting set multicovering with submodular pricing
• Submodular functions: optimization and approximation
• Submodular functions: learnability, structure, and optimization
• scientific article; zbMATH DE number 3912107

Cited in

(3)

• The multi-budget maximum weighted coverage problem
• Combinatorial agency of threshold functions
• Graph cuts with interacting edge weights: examples, approximations, and algorithms

This page was built for publication: Combinatorial problems with discounted price functions in multi-agent systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908875)