We study elections in which two candidates poll voters about their preferred policies before taking policy positions. In the essentially unique equilibrium, candidates who receive moderate signals adopt more extreme platforms than their information suggests, but candidates with more extreme signals may moderate their platforms. Policy convergence does not maximize voters’ welfare. Although cand...

In this paper we compare several service disciplines commonly used in polling systems. We present a sample path comparison which allows us to evaluate the efficiency of the different policies based on the total amount of work found in the system at any time. The analysis is carried out for a large variety of polling schemes under fairly general conditions and can be used to construct a hierarch...

This paper investigates a polling system with a random polling scheme, a 1-limited service discipline and deterministic service requirement modeling WLANs with QoS differentation capability. The system contains high and low priority queues that are distinguished via the probability of being served next. We propose a new iteration algorithm to approximate the waiting time of customers in the hig...

A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalizes the classical Markovian polling model, in the sense that two routing matrices are involved, the choice being made according to the state of the last visited queue. The stationary distribution of the position of the server is given. Ergodicity conditions are obtained by means of an associated dy...

We analyze the integration of automatic memory management in a real-time context. We focus on integrating a real-time (copying) garbage collector with hard real-time static-priority periodic tasks. This integration is done by considering the copying collector as an aperiodic task served by a polling server. We analyze the schedulability of this system for any polling server parameters. This ana...