We consider the non-cooperative choice of arrival times by individual users, or customers, to a service system that opens at a given time, and where users queue up and are served in order of arrival.
This talk concerns the basic facts of convex optimization and variational inequalities. We will discuss about subgradients and provide important examples.
In this talk we essentially discuss a work on variational inequalities by Yuri Nestrov where the so called prox-functions play a major role. We discuss the approach in details giving complexity bounds and related results.
In this talk, we discuss three problems. The first is on an asynchronous multi-antenna wireless communication system and the later two are on collaborative estimation.
A centralized dynamic, opportunistic scheduling decision has to be made by a Base station (BS) to fair share the resources, based on the current channel gains signaled by the mobiles.
