Home

John N. Tsitsiklis

  1. Efficiency Loss in a Cournot Oligopoly with Convex Market Demand.

    Mon, 04/02/2012 - 15:01 — SomNambul
    Authors: John N. Tsitsiklis, Yunjian Xu
    Subjects: Dynamical Systems
    Abstract

    We consider a Cournot oligopoly model where multiple suppliers (oligopolists)
    compete by choosing quantities. We compare the social welfare achieved at a
    Cournot equilibrium to the maximum possible, for the case where the inverse
    market demand function is convex.

  2. Queue Length Asymptotics for Generalized Max-Weight Scheduling in the presence of Heavy-Tailed Traffic.

    Tue, 07/27/2010 - 15:01 — SomNambul
    Authors: John N. Tsitsiklis, Krishna Jagannathan, Mihalis Markakis, Eytan Modiano
    Subjects: Networking and Internet Architecture
    Abstract

    We investigate the asymptotic behavior of the steady-state queue length
    distribution under generalized max-weight scheduling in the presence of
    heavy-tailed traffic. We consider a system consisting of two parallel queues,
    served by a single server. One of the queues receives heavy-tailed traffic, and
    the other receives light-tailed traffic. We study the class of throughput
    optimal max-weight-alpha scheduling policies, and derive an exact asymptotic
    characterization of the steady-state queue length distributions.

  3. Distributed anonymous discrete function computation.

    Wed, 04/14/2010 - 15:01 — SomNambul
    Authors: Julien M. Hendrickx, Alex Olshevsky, John N. Tsitsiklis
    Subjects: Optimization and Control
    Abstract

    We propose a model for deterministic distributed function computation by a
    network of identical and anonymous nodes. In this model, each node has bounded
    computation and storage capabilities that do not grow with the network size.
    Furthermore, each node only knows its neighbors, not the entire graph. Our goal
    is to characterize the class of functions that can be computed within this
    model. In our main result, we provide a necessary condition for computability
    which we show to be nearly sufficient, in the sense that every function that
    violates this condition can at least be approximated.

  4. Qualitative Properties of alpha-Weighted Scheduling Policies.

    Thu, 04/01/2010 - 15:01 — SomNambul
    Authors: Devavrat Shah, John N. Tsitsiklis, Yuan Zhong
    Subjects: Networking and Internet Architecture
    Abstract

    We consider a switched network, a fairly general constrained queueing network
    model that has been used successfully to model the detailed packet-level
    dynamics in communication networks, such as input-queued switches and wireless
    networks. The main operational issue in this model is that of deciding which
    queues to serve, subject to certain constraints. In this paper, we study
    qualitative performance properties of the well known $\alpha$-weighted
    scheduling policies. The stability, in the sense of positive recurrence, of
    these policies has been well understood.

  5. Linearly Parameterized Bandits.

    Thu, 02/25/2010 - 16:01 — SomNambul
    Authors: Paat Rusmevichientong, John N. Tsitsiklis
    Subjects: Learning
    Abstract

    We consider bandit problems involving a large (possibly infinite) collection
    of arms, in which the expected reward of each arm is a linear function of an
    $r$-dimensional random vector $\mathbf{Z} \in \mathbb{R}^r$, where $r \geq 2$.
    The objective is to minimize the cumulative regret and Bayes risk.

Math-arch

Syndicate content