Optimum Object Selection Made Easy

  • Authors:
  • Amr Alasaad;Sathish Gopalakrishnan;Victor C. Leung

  • Affiliations:
  • Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, Canada V6T 1Z4;Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, Canada V6T 1Z4 and Department of Electrical and Computer Engineering, The University of British Co ...;Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, Canada V6T 1Z4 and Department of Electrical and Computer Engineering, The University of British Co ...

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a simple scheme for selecting objects (either for caching or picking objects that are peers in a peer-to-peer system) to maximize the long-run reward obtained by a system. Our approach does not require a detailed record of the value specific objects add to the system. Therefore, it can be implemented using less computing and memory resources as compared to machine learning and artificial intelligent algorithms. One of the main contributions we make is to show that one can still derive optimal policies. The model that we use and the policy that we present are both applicable in a variety of contexts.