Results 71 to 80 of about 88 (87)
Some of the next articles are maybe not open access.
Evolution in Bayesian Supermodular Population Games
Studies in Microeconomics, 2013We study evolution in Bayesian supermodular population games. We define such games in the context of large populations of agents and establish the existence of a maximum and a minimum pure strategy Nash equilibria which are monotone in types. To study evolution in such games, we introduce Bayesian perturbed best response dynamics and the corresponding
openaire +1 more source
Supermodular game for energy efficient TOA-based positioning
2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2012In this paper we address the problem of minimizing the energy cost of positioning a node in a wireless sensor network, using time of arrival measurements. A sensor needs to receive at least three distance measurements to known anchors in order to position itself.
Ana Moragrega +2 more
openaire +1 more source
An order-centric treatment of the Bayesian supermodular game
Annals of Operations Research, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Jian, Qi, Xiangtong
openaire +3 more sources
An economic analysis on supermodular games.
2014The purpose of this thesis is to present the benefits of supermodularity in economicanalysis. We introduce the essential lattice theoretical tools. Furthermore, we exhibitTopkis' Monotonicity Theorem in Monotone Comparative Statics. Then we elaborateon non-cooperative supermodular games, the existence of Nash equilibria in them andthe presentation of ...
openaire +1 more source
Leader Selection via Supermodular Game for Formation Control in Multiagent Systems
IEEE Transactions on Neural Networks and Learning Systems, 2019Multiagent systems (MASs) are usually applied with agents classified into leaders and followers, where selecting appropriate leaders is an important issue for formation control applications. In this paper, we investigate two leader selection problems in second-order MAS, namely, the problem of choosing up to a given number of leaders to minimize the ...
Lei Xue, Xianghui Cao
openaire +2 more sources
Computing Shapley Value in Supermodular Coalitional Games
2012Coalitional games allow subsets (coalitions) of players to cooperate to receive a collective payoff. This payoff is then distributed “fairly” among the members of that coalition according to some division scheme. Various solution concepts have been proposed as reasonable schemes for generating fair allocations. The Shapley value is one classic solution
David Liben-Nowell +3 more
openaire +1 more source
Equilibrium Selection in Binary Supermodular Games under Perfect Foresight Dynamics
SSRN Electronic Journal, 2009This paper studies equilibrium selection in binary supermodular games based on perfect foresight dynamics. We provide complete characterizations of absorbing and globally accessible equilibria and apply them to two subclasses of games. First, for unanimity games, it is shown that our selection criterion is not in agreement with that in terms of Nash ...
Hofbauer, Josef +2 more
openaire +2 more sources
Global Game Selections in Binary-Action Supermodular Games
SSRN Electronic Journal, 2023Stephen Edward Morris +2 more
openaire +1 more source
Pseudo-supermodular games: theory and an application
1999In this paper we introduce the notion of pseudo-supermodular games and analyze the existence and order structure of equilibria using lattice-theoretical methods. Moreover, we provide, as an application, an analysis of equilibrium solutions for evolutionary games with monotonic selection dynamics, identifying the implications for pseudo-supermodular ...
openaire +1 more source
Equilibrium selection in supermodular games with mean payoff technologies [PDF]
We examine an evolutionary model of equilibrium selection, where all individuals interact with each other, recurrently playing a strictly supermodular game. Individuals play (myopic) best responses to the current population profile, occa- sionally they pick an arbitrary strategy at random.
Hehenkamp, Burkhard, Kaarbøe, Oddvar M.
openaire

