scientific article; zbMATH DE number 7205021

DOI10.4230/LIPIcs.ESA.2017.43zbMath1448.91059MaRDI QIDQ5111732

Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika, Sreenivas Gollapudi

Publication date: 27 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

price of anarchysubmodular maximizationcoverage functions

Mathematics Subject Classification ID

Utility theory for games (91A30)

Related Items (1)

Project games

Cites Work

• Unnamed Item
• Inapproximability results for combinatorial auctions with submodular utility functions
• On weighted Shapley values
• Potential games
• A class of games possessing pure-strategy Nash equilibria
• The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
• Optimal Cost-Sharing in Weighted Congestion Games
• Incentives and Efficiency in Uncertain Collaborative Environments
• Restoring Pure Equilibria to Weighted Congestion Games
• Designing Network Protocols for Good Equilibria
• An improved approximation algorithm for combinatorial auctions with submodular bidders
• Intrinsic robustness of the price of anarchy
• Distributed Welfare Games
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
• Online submodular welfare maximization: Greedy is optimal

This page was built for publication: