Locally Convex (concave) Games
نویسنده
چکیده
We introduce a new class of cooperative games by using the notion of local supermodularity. Therefore locally convex games can be considered as relaxations of convex games. Moreover, we obtain a characterization of a subclass of locally concave games in terms of the rank function of a matroid.
منابع مشابه
Locally Convex Games
We introduce a new class of cooperative games by using the notion of local supermodularity. Therefore locally convex games can be considered as relaxations of convex games. Cooperative games with the unit marginal worth property are defined and characterizations of locally concave (convex) games with this property are proved. Moreover, we obtain a characterization of a subclass of locally conca...
متن کاملLearning in concave games with imperfect information
This paper examines the convergence properties of a class of learning schemes for concave N -person games – that is, games with convex action spaces and individually concave payoff functions. Specifically, we focus on a family of learning methods where players adjust their actions by taking small steps along their individual payoff gradients and then “mirror” the output back to their feasible a...
متن کاملFinding Normalized Equilibrium in Convex-concave Games
This paper considers a fairly large class of noncooperative games in which strategies are jointly constrained. When what is called the Ky Fan or Nikaidô-Isoda function is convex-concave, selected Nash equilibria correspond to diagonal saddle points of that function. This feature is exploited to design computational algorithms for finding such equilibria. To comply with some freedom of individua...
متن کاملCharacterizations of $L$-convex spaces
In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...
متن کاملRational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in addition, the game is succinct, i.e., the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000