most citedNearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time

3 citations · 3 across the 3 of their papers we have counts for

collaborators

5 papers

cs.IT20173 cited

Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time

Alper Kose, Noyan Evirgen, Hakan Gokcesu +2

In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when such scheduling problems can be represented b…

cs.LG2017

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

Noyan Evirgen, Alper Kose, Hakan Gokcesu

We consider a decentralized stochastic multi-armed bandit problem with multiple players. Each player aims to maximize his/her own reward by pulling an arm. The arms give rewards ba…

eess.SP2017

Meeting of Mobile Nodes Based on RSS Measurements in Wireless Ad Hoc Networks

Noyan Evirgen, Alper Kose

In this work, we address a completely novel case which is the meeting problem of mobile nodes (players) in a wireless ad hoc network. We assume that the only information players ha…

cs.IR2017

Performance Comparison of Algorithms for Movie Rating Estimation

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-mo…

cs.LG2017

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

Noyan Evirgen, Alper Kose

We consider decentralized stochastic multi-armed bandit problem with multiple players in the case of different communication probabilities between players. Each player makes a deci…