Cost sharing and strategyproof mechanisms for set cover games

DOI10.1007/S10878-009-9209-XMaRDI QIDQ604756zbMATH OpenOpenAlexFDO

Authors Xiangyang Li, Zheng Sun, Weizhao Wang, Wei Lou

Publication date 12 November 2010

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.5020

zbMATH Keywords

pricingset covermechanism designselfish agent

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial games (91A46)

Recommendations

• STACS 2005
• Mechanism design for set cover games with selfish element agents
• Algorithmic Applications in Management
• Set-weighted games and their application to the cover problem
• New techniques for cost sharing in combinatorial optimization games
• scientific article; zbMATH DE number 7042522

Cites work

• scientific article; zbMATH DE number 5764884 (Why is no real title available?)
• A BGP-based mechanism for lowest-cost routing
• A Greedy Heuristic for the Set-Covering Problem
• A Tight Analysis of the Greedy Algorithm for Set Cover
• A course in game theory.
• A threshold of ln n for approximating set cover
• Algorithmic Applications in Management
• Algorithmic mechanism design
• Applications of approximation algorithms to cooperative games
• Approximation and collusion in multicast cost sharing
• Atomic resource sharing in noncooperative networks
• Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
• Hardness results for multicast cost sharing.
• Incentives in Teams
• Limitations of cross-monotonic cost sharing schemes
• Non-cooperative Facility Location and Covering Games
• STACS 2005
• Sharing the cost of multicast transmissions
• Strategyproof sharing of submodular costs: budget balance versus efficiency
• The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms
• Truth revelation in approximately efficient combinatorial auctions

Cited in

(14)

• Allocating costs in set covering problems
• On the impact of local taxes in a set cover game
• A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
• Non-cooperative cost sharing games via subsidies
• Designing cost-sharing methods for Bayesian games
• Algorithmic Applications in Management
• Algorithms and Computation
• STACS 2005
• A distributed algorithm for a set cover game
• Mechanism design for set cover games with selfish element agents
• LP-based covering games with low price of anarchy
• A game theoretic approach for minimal connected dominating set
• Cost allocation and strategyproof mechanism for cover-set games
• Strategic cooperation in cost sharing games

This page was built for publication: Cost sharing and strategyproof mechanisms for set cover games

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