Different types of dynamics have been studied in repeated game play, and one of them which has received much attention recently consists of those based on “no-regret” algorithms from the area of machine learning. It is known that dynamics based on generic no-regret algorithms may not converge to Nash equilibria in general, but to a larger set of outcomes, namely coarse correlated equilibria. Mo...

In this paper, we consider a variant of the pickup and delivery problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We discuss the complexity of this problem and present two mixed-integer linear programming formulations based on a space-time graph. We describe some valid in...

Communications cooperation has long been proposed as an effective method for reducing the energy consumption of the mobile terminals (MTs) in wireless cellular networks. However, it is hard to be implemented due to the lack of incentives for the MTs to cooperate. In this paper, we propose a pricing mechanism to incentivize the uplink communications cooperation for the energy saving of MTs. We f...

The fifth science run of LIGO (S5) has recently been concluded. The data collected over 2 years of the run call for a thorough analysis of the glitches seen in the gravitational wave channels, as well as in the auxiliary and environmental channels. The study presents two new techniques for cluster analysis of gravitational wave burst triggers. Traditional approaches to clustering treat the prob...

SONET ADMs are the dominant cost factor in the WDM=SONET rings. Recently several articles (Belvaux et al., European J. Oper. Res. 108 (1) (1998) 26–35; C+ alinescu and Wan, Tra c partition in WDM=SONET rings to minimize SONET ADMs, submitted for publication; Gerstel et al., Proc. IEEE INFOCOM’98, vol. 1, pp. 94–101; Liu et al., Proc. INFOCOM, vol. 2, 2000, pp. 1020–1025; Sutter et al., Oper. Re...

In this paper we investigate the splittable routing game in a seriesparallel network with two selfish players. Every player wishes to route optimally, i.e. at minimum cost, an individual flow demand from the source to the destination, giving rise to a non-cooperative game. We allow a player to split his flow along any number of paths. One of the fundamental questions in this model is the conver...

We study a natural generalization of the problem of minimizing makespan on unrelated machines in which jobs may be split into parts. The different parts of a job can be (simultaneously) processed on different machines, but each part requires a setup time before it can be processed. First we show that a natural adaptation of the seminal approximation algorithm for unrelated machine scheduling [1...

In the single-source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain sinks in a given directed graph with edge capacities and costs. The demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover the cost of the solution should not exceed a given budget. An impo...