Learn More
In this paper, we consider the problem of data allocation in environments of self-motivated servers, where information servers respond to queries from users. New data items arrive frequently and have to be allocated in the distributed system. The servers have no common interests, and each server is concerned with the exact location of each of the data(More)
We propose a bidding mechanism for data allocation in environments of self-motivated data servers with no common preferences and no central controller. The model considers situations where each server is concerned with the data stored locally, but does not have preferences concerning the exact storage location of data stored in remote servers. We considered(More)
  • 1