Zobrazeno 1 - 10
of 377
pro vyhledávání: '"Neely, Michael J."'
Autor:
Neely, Michael J.
This paper presents an online method that learns optimal decisions for a discrete time Markov decision problem with an opportunistic structure. The state at time $t$ is a pair $(S(t),W(t))$ where $S(t)$ takes values in a finite set $\mathcal{S}$ of b
Externí odkaz:
http://arxiv.org/abs/2408.05322
Autor:
Wijewardena, Mevan, Neely, Michael. J
This paper considers a multi-player resource-sharing game with a fair reward allocation model. Multiple players choose from a collection of resources. Each resource brings a random reward equally divided among the players who choose it. We consider t
Externí odkaz:
http://arxiv.org/abs/2402.05300
Autor:
Asgari, Kamiar, Neely, Michael J.
This paper presents a subgradient-based algorithm for constrained nonsmooth convex optimization that does not require projections onto the feasible set. While the well-established Frank-Wolfe algorithm and its variants already avoid projections, they
Externí odkaz:
http://arxiv.org/abs/2311.11180
Autor:
Wijewardena, Mevan, Neely, Michael J.
This paper considers a two-player game where each player chooses a resource from a finite collection of options. Each resource brings a random reward. Both players have statistical information regarding the rewards of each resource. Additionally, the
Externí odkaz:
http://arxiv.org/abs/2306.08791
Autor:
Asgari, Kamiar, Neely, Michael J.
In this paper, we provide a sub-gradient based algorithm to solve general constrained convex optimization without taking projections onto the domain set. The well studied Frank-Wolfe type algorithms also avoid projections. However, they are only desi
Externí odkaz:
http://arxiv.org/abs/2208.05127
Autor:
Neely, Michael J.
This paper proves a representation theorem regarding sequences of random elements that take values in a Borel space and are measurable with respect to the sigma algebra generated by an arbitrary union of sigma algebras. This, together with a related
Externí odkaz:
http://arxiv.org/abs/2207.02345
Autor:
Neely, Michael J.
This paper revisits a classical problem of slotted multiple access with success, idle, and collision events on each slot. First, results of a 2-user multiple access game are reported. The game was conducted at the University of Southern California ov
Externí odkaz:
http://arxiv.org/abs/2110.09638
Autor:
Neely, Michael J.
This paper considers online optimization of a renewal-reward system. A controller performs a sequence of tasks back-to-back. Each task has a random vector of parameters, called the task type vector, that affects the task processing options and also a
Externí odkaz:
http://arxiv.org/abs/2007.09532
Autor:
Neely, Michael J.
This paper proves an impossibility result for stochastic network utility maximization for multi-user wireless systems, including multiple access and broadcast systems. Every time slot an access point observes the current channel states for each user
Externí odkaz:
http://arxiv.org/abs/2001.01031