Rabia Nessah

Learn More
This paper investigates the existence of strong Nash equilibria (SNE) in continuous and concave games. We show that the coalition consistence property introduced in the paper, together with the concavity and continuity of payoffs, permits the existence of strong Nash equilibria in games with compact and convex strategy spaces. The coalition consistency(More)
In this paper, we consider a single-machine scheduling problem with release dates. The aim is to minimize the total weighted completion time. This problem is known to be strongly NP-hard. We propose two new lower bounds that can be, respectively, computed in O(n) and in OðnlognÞ time where n is the number of jobs. We prove a sufficient and necessary(More)
This paper characterizes the existence of equilibria in minimax inequalities without assuming any form of quasiconcavity of functions and convexity or compactness of choice sets. A new condition, called “local dominatedness property”, is shown to be necessary and further, under some mild continuity condition, sufficient for the existence of equilibrium. We(More)
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, σ)equi-well-posed games, namely, Theorems 3.2–3.3 [Abalo, K.Y., Kostreva, M.M., 1996. Fixed Points, Nash Games and their Organization. Topological Methods in(More)
TheBerge equilibriumconcept formalizesmutual support amongplayersmotivated by the altruistic social value orientation in games. We prove some basic results for Berge equilibria and their relations to Nash equilibria, and we provide a straightforward method for finding Berge equilibria in n-player games. We explore some specific examples, and we explain how(More)