Related papers: Egalitarian solution for games with discrete side …
Some well-known solutions for cooperative games with transferable utility (TU-games), such as the Banzhaf value, the Myerson value, and the Aumann-Dreze value, fail to satisfy efficiency. Despite their desirable normative properties, this…
This paper presents discrete convex analysis as a tool for economics and game theory. Discrete convex analysis is a new framework of discrete mathematics and optimization, developed during the last two decades. Recently, it is being…
Leveraging tools from the study of linear fractional transformations and algebraic Riccati equations, a local characterization of consistent conjectural variations equilibrium is given for two player games on continuous action spaces with…
Traditional solvable game theory and mean-field-type game theory (risk-aware games) predominantly focus on quadratic costs due to their analytical tractability. Nevertheless, they often fail to capture critical non-linearities inherent in…
We propose a game-theoretic framework that incorporates both incomplete information and general ambiguity attitudes on factors external to all players. Our starting point is players' preferences on payoff-distribution vectors, essentially…
We introduce the component-wise egalitarian Myerson value for network games. This new value being a convex combination of the Myerson value and the component-wise equal division rule is a player-based allocation rule. In network games under…
Differential games with asymmetric information were introduced by Cardaliaguet (2007). As in repeated games with lack of information on both sides (Aumann and Maschler (1995)), each player receives a private signal (his type) before the…
Connections are made between solution concepts for games in characteristic function form and Euler's Theorem underlying the neo-classical theory of distribution in which the total output produced is imputed to the marginal products of the…
We study discrete two player all-pay auction with complete information. We provide full characterization of mixed strategy Nash equilibria and show that they constitute a subset of Nash equilibria of discrete General Lotto game. We show…
We formulate a new class of two-person zero-sum differential games, in a stochastic setting, where a specification on a target terminal state distribution is imposed on the players. We address such added specification by introducing…
Several extensions of the equal division value and the equal surplus division value to the family of games with a priori unions are proposed in Alonso-Meijide et al. (2020) ``On egalitarian values for cooperative games with a priori…
We address the equilibrium concept of a reverse auction game so that no one can enhance the individual payoff by a unilateral change when all the others follow a certain strategy. In this approach the combinatorial possibilities to consider…
A two-person zero-sum infinite dimensional differential game of infinite duration with discounted payoff involving hybrid controls is studied. The minimizing player is allowed to take continuous, switching and impulse controls whereas the…
A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning optimal outcomes were resolved. By generalizing standard game…
While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the constraints that optimal solutions need to satisfy, and…
We study a two-player zero-sum stochastic differential game with asymmetric information where the payoff depends on a controlled continuous-time Markov chain X with finite state space which is only observed by player 1. This model was…
A finite-horizon zero-sum linear-quadratic differential game is considered. Its features are: (i) the control cost of the minimizing player in the game's cost functional is much smaller than the control cost of the maximizing player and the…
We study the complexity of equilibrium computation in discrete preference games. These games were introduced by Chierichetti, Kleinberg, and Oren (EC '13, JCSS '18) to model decision-making by agents in a social network that choose a…
Continuous-time empirical dynamic discrete choice games offer notable computational advantages over discrete-time models. This paper addresses remaining computational and econometric challenges to further improve both model solution and…
A new game theoretical solution concept for open spectrum sharing in cognitive radio (CR) environments is presented, the Lorenz equilibrium (LE). Both Nash and Pareto solution concepts have limitations when applied to real world problems.…