Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Bistritz, Ilai"'
Consider $N$ players each with a $d$-dimensional action set. Each of the players' utility functions includes their reward function and a linear term for each dimension, with coefficients that are controlled by the manager. We assume that the game is
Externí odkaz:
http://arxiv.org/abs/2407.00575
Consider a decision-maker that can pick one out of $K$ actions to control an unknown system, for $T$ turns. The actions are interpreted as different configurations or policies. Holding the same action fixed, the system asymptotically converges to a u
Externí odkaz:
http://arxiv.org/abs/2302.13653
Consider a scenario where a player chooses an action in each round $t$ out of $T$ rounds and observes the incurred cost after a delay of $d_{t}$ rounds. The cost functions and the delay sequence are chosen by an adversary. We show that in a non-coope
Externí odkaz:
http://arxiv.org/abs/2103.04550
Consider N cooperative but non-communicating players where each plays one out of M arms for T turns. Players have different utilities for each arm, representable as an NxM matrix. These utilities are unknown to the players. In each turn players selec
Externí odkaz:
http://arxiv.org/abs/2002.09808
We consider an environment where players need to decide whether to buy a certain product (or adopt a technology) or not. The product is either good or bad, but its true value is unknown to the players. Instead, each player has her own private informa
Externí odkaz:
http://arxiv.org/abs/1905.01327
Publikováno v:
IEEE Journal on Selected Areas in Communications Year: 2019 | Volume: 37, Issue: 10, Publisher: IEEE
Channel allocation is the task of assigning channels to users such that some objective (e.g., sum-rate) is maximized. In centralized networks such as cellular networks, this task is carried by the base station which gathers the channel state informat
Externí odkaz:
http://arxiv.org/abs/1902.06353
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bistritz, Ilai, Leshem, Amir
We consider an N-player multi-armed bandit game where each player chooses one out of M arms for T turns. Each player has different expected rewards for the arms, and the instantaneous rewards are independent and identically distributed or Markovian.
Externí odkaz:
http://arxiv.org/abs/1810.11162
Autor:
Bistritz, Ilai, Leshem, Amir
Consider a channel allocation problem over a frequency-selective channel.There are K channels (frequency bands) and N users such that K=bN for some positive integer b. We want to allocate b channels (or resource blocks) to each user. Due to the natur
Externí odkaz:
http://arxiv.org/abs/1710.07617
Autor:
Bistritz, Ilai, Leshem, Amir
Publikováno v:
IEEE Transactions on Automatic Control ( Volume: 63 , Issue: 6 , June 2018 )
In this paper we develop a novel approach to the convergence of Best-Response Dynamics for the family of interference games. Interference games represent the fundamental resource allocation conflict between users of the radio spectrum. In contrast to
Externí odkaz:
http://arxiv.org/abs/1706.05081