Tight Approximation for Unconstrained XOS Maximization: Algorithm 4 Finds a -Maximizer of Every -XOS Function in Time, Exactly When Research Paper
Maximizing a set function is a basic task in combinatorial optimization and algorithmic game theory. Computing an agent's demand under prices amounts to maximizing , which need not be monotone even when the valuation is. XOS functions generalize submodular functions, and they are studied in combinatorial auctions, where they are…