Simulated Annealing Algorithm for Graph Coloring

no code implementations • 3 Dec 2017 • Alper Kose, Berke Aral Sonmez, Metin Balaban

The goal of this Random Walks project is to code and experiment the Markov Chain Monte Carlo (MCMC) method for the problem of graph coloring.

An Asymptotically Optimal Algorithm for Communicating Multiplayer Multi-Armed Bandit Problems

no code implementations • 2 Dec 2017 • Noyan Evirgen, Alper Kose, Hakan Gokcesu

Players are not aware about the probability distributions of the arms.

The Effect of Communication on Noncooperative Multiplayer Multi-Armed Bandit Problems

no code implementations • 5 Nov 2017 • Noyan Evirgen, Alper Kose

We consider decentralized stochastic multi-armed bandit problem with multiple players in the case of different communication probabilities between players.

Thompson Sampling

Performance Comparison of Algorithms for Movie Rating Estimation

no code implementations • 5 Nov 2017 • Alper Kose, Can Kanbak, Noyan Evirgen

In this paper, our goal is to compare performances of three different algorithms to predict the ratings that will be given to movies by potential users where we are given a user-movie rating matrix based on the past observations.

Collaborative Filtering