On the Existence of Pure Strategy Nash Equilibria in Integer-Splittable Weighted Congestion Games

We study the existence of pure strategy Nash equilibria (PSNE) in integer–splittable weighted congestion games (ISWCGs), where agents can strategically assign different amounts of demand to different resources, but must distribute this demand in fixed-size parts. Such scenarios arise in a wide range of application domains, including job scheduling and network routing, where agents have to allocate multiple tasks and can assign a number of tasks to a particular selected resource. Specifically, in an ISWCG, an agent has a certain total demand (aka weight) that it needs to satisfy, and can do so by requesting one or more integer units of each resource from an element of a given collection of feasible subsets. Each resource is associated with a unit–cost function of its level of congestion; as such, the cost to an agent for using a particular resource is the product of the resource unit–cost and the number of units the agent requests.While general ISWCGs do not admit PSNE [(Rosenthal, 1973b)], the restricted subclass of these games with linear unit–cost functions has been shown to possess a potential function [(Meyers, 2006)], and hence, PSNE. However, the linearity of costs may not be necessary for the existence of equilibria in pure strategies. Thus, in this paper we prove that PSNE always exist for a larger class of convex and monotonically increasing unit–costs. On the other hand, our result is accompanied by a limiting assumption on the structure of agents’ strategy sets: specifically, each agent is associated with its set of accessible resources, and can distribute its demand across any subset of these resources.Importantly, we show that neither monotonicity nor convexity on its own guarantees this result. Moreover, we give a counterexample with monotone and semi–convex cost functions, thus distinguishing ISWCGs from the class of infinitely–splittable congestion games for which the conditions of monotonicity and semi–convexity have been shown to be sufficient for PSNE existence [(Rosen, 1965)]. Furthermore, we demonstrate that the finite improvement path property (FIP) does not hold for convex increasing ISWCGs. Thus, in contrast to the case with linear costs, a potential function argument cannot be used to prove our result. Instead, we provide a procedure that converges to an equilibrium from an arbitrary initial strategy profile, and in doing so show that ISWCGs with convex increasing unit–cost functions are weakly acyclic

Parameterized complexity of machine scheduling: 15 open problems

Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions in this area whose resolution we expect to lead to the discovery of new approaches and techniques both in scheduling and parameterized complexity theory.Comment: Version accepted to Computers & Operations Researc