Applications of approximation algorithms to cooperative games
From MaRDI portal
Publication:5175991
DOI10.1145/380752.380825zbMath1323.68570OpenAlexW2095969632MaRDI QIDQ5175991
No author found.
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380825
Related Items (52)
Collusion, efficiency, and dominant strategies ⋮ Approximate core allocations and integrality gap for the bin packing game ⋮ Social enterprise tree network games ⋮ Minimal Subsidies in Expense Sharing Games ⋮ A note on Steiner tree games ⋮ Approximation and collusion in multicast cost sharing ⋮ Beyond Moulin mechanisms ⋮ Network design with edge-connectivity and degree constraints ⋮ When ignorance helps: graphical multicast cost sharing games ⋮ On the convergence of multicast games in directed networks ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ The matroid intersection cover problem ⋮ Cost sharing and strategyproof mechanisms for set cover games ⋮ Strategic cooperation in cost sharing games ⋮ Hardness results for multicast cost sharing. ⋮ Collusive dominant-strategy truthfulness ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Toward a model for backtracking and dynamic programming ⋮ Cost-sharing mechanisms for scheduling under general demand settings ⋮ Euclidean distortion and the sparsest cut ⋮ New algorithms for a simple measure of network partitioning ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ Price of stability in survivable network design ⋮ The Price of Nash Equilibria in Multicast Transmissions Games ⋮ Limitations of VCG-based mechanisms ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Cost-sharing mechanisms for network design ⋮ Non-cooperative facility location and covering games ⋮ Cross-monotonic cost sharing methods for connected facility location games ⋮ On the complexity of computing Kronecker coefficients ⋮ Computer science and decision theory ⋮ Computational topology and the Unique Games Conjecture ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Leveraging possibilistic beliefs in unrestricted combinatorial auctions ⋮ Network design with weighted players ⋮ The warehouse-retailer network design game ⋮ Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location ⋮ Unnamed Item ⋮ Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation ⋮ Collaboration in Cargo Transportation ⋮ A super-quadratic lower bound for depth four arithmetic circuits ⋮ Fair cost-sharing methods for scheduling jobs on parallel machines ⋮ Efficient Black-Box Reductions for Separable Cost Sharing ⋮ On Khot’s unique games conjecture ⋮ On Partial Covering For Geometric Set Systems ⋮ THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
This page was built for publication: Applications of approximation algorithms to cooperative games
