A distributed algorithm for a set cover game

DOI10.1142/S1793830921501275MaRDI QIDQ5866029zbMATH OpenOpenAlexFDO

Authors Chaojie Zhu, Zhao Zhang, Xiaohui Huang

Publication date 10 June 2022

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830921501275

zbMATH Keywords

distributed algorithmgame theoryNash equilibriumset cover

Mathematics Subject Classification ID

Distributed algorithms (68W15) Games involving topology, set theory, or logic (91A44) Algorithmic game theory and complexity (91A68)

Recommendations

• On the impact of local taxes in a set cover game
• Cost sharing and strategyproof mechanisms for set cover games
• STACS 2005
• LP-based covering games with low price of anarchy
• Mechanism design for set cover games with selfish element agents

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• A threshold of ln n for approximating set cover
• Analytical approach to parallel repetition
• Game Theory in Wireless and Communication Networks
• Mechanism design for set cover games with selfish element agents
• Non-cooperative Cost Sharing Games Via Subsidies

Cited in

(3)

• On the impact of local taxes in a set cover game
• LP-based covering games with low price of anarchy
• Algorithms – ESA 2005

This page was built for publication: A distributed algorithm for a set cover game

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