In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification base...
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties ...
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...