We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard. We propose a heuristic and a lower bound based on job splitting and the Viswanathkumar and Srinivasan procedure. The test on more than 2000 instances shows that...

In this paper, we reconsider the concept of Berge equilibrium. In a recent work, Colman et al. [(2011) J. Math. Psych. 55, 166–175] proposed a correspondence for two-player games between Berge and Nash equilibria by permutation of the utility functions. We define here more general...

In this paper, we investigate the existence of Berge–Zhukovskii equilibrium in general normal form games. We characterize its existence via the existence of a symmetric Nash equilibrium of some n-person subgame derived of the initial game. The significance of the obtained results is...

This paper introduces the notion of generalized weak transfer continuity and establishes that a bounded, compact locally convex metric quasiconcave and generalized weak transfer continuous game has a Nash equilibrium. Our equilibrium existence result neither implies nor is implied by the...

This paper investigates the existence of absolute optimal solutions for a partition P in continuous and quasiconcave games. We show that the P-consistency property introduced in the paper, together with the quasiconcavity and continuity of payoffs, permits the existence of P-absolute optimal...

This paper deals with the problem of existence of Berge and Berge-Nash equilibria. Abalo and Kostreva have proved existence theorems of Berge and Berge-Nash equilibria for S-equi-well-posed and (S, [sigma])-equi-well-posed games, namely, Theorems 3.2-3.3 [Abalo, K.Y., Kostreva, M.M., 1996. Fixed...