Minimizing mean flow time with release time constraint
Theoretical Computer Science
Online computation and competitive analysis
Online computation and competitive analysis
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the 8th ACM conference on Electronic commerce
Limitations of cross-monotonic cost-sharing schemes
ACM Transactions on Algorithms (TALG)
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Competitive Online Multicommodity Routing
Theory of Computing Systems
Strategyproof cost-sharing mechanisms for set cover and facility location games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Hi-index | 0.00 |
The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, most of these studies consider cooperative cost sharing games in an offline setting, i.e., the mechanism knows all players and their respective input data in advance. In this paper, we consider cooperative cost sharing games in an online setting: Upon the arrival of a new player, the mechanism has to take instantaneous and irreversible decisions without any knowledge about players that arrive in the future. We propose an online model for general demand cost sharing games and give a complete characterization of both weakly group-strategyproof and group-strategyproof online cost sharing mechanisms for this model. Moreover, we present a simple method to derive incremental online cost sharing mechanisms from online algorithms such that the competitive ratio is preserved. Based on our general results, we develop online cost sharing mechanisms for several binary demand and general demand cost sharing games.