Showing 1 - 10 of 17,230
An uninformed sender designs a mechanism that discloses information about her type to a privately informed receiver, who then decides whether to act. I impose a single-crossing assumption, so that the receiver with a higher type is more willing to act. Using a linear programming approach, I...
Persistent link: https://www.econbiz.de/10012979703
This paper tries to connect the theory of genetic algorithm (GA) learning to evolutionary game theory. It is shown that … economic learning via genetic algorithms can be described as a specific form of evolutionary game. It will be pointed out that … GA learning results in a series of near Nash equilibria which during the learning process build up to finally reach a …
Persistent link: https://www.econbiz.de/10011526540
Unique-lowest sealed-bid auctions are auctions in which participation is endogenous and the winning bid is the lowest bid among all unique bids. Such auctions admit very many Nash equilibria (NEs) in pure and mixed strategies. The two-bidders' auction is similar to the Hawk-Dove game, which...
Persistent link: https://www.econbiz.de/10010325775
We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...
Persistent link: https://www.econbiz.de/10010325776
Persistent link: https://www.econbiz.de/10003807167
Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...
Persistent link: https://www.econbiz.de/10011373836
We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...
Persistent link: https://www.econbiz.de/10011378347
In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying dimension. Conditions are stated under which the algorithm...
Persistent link: https://www.econbiz.de/10011343323
In this article we address the problem of finding feedback Nash equilibria for linear quadratic differential games defined on descriptor systems. First, we decouple the dynamic and algebraic parts of a descriptor system using canonical projectors. We discuss the effects of feedback on the...
Persistent link: https://www.econbiz.de/10013131491
In this note we reconsider Nash equilibria for the linear quadratic differential game for an infinite planning horizon. We consider an open-loop information structure. In the standard literature this problem is solved under the assumption that every player can stabilize the system on his own. In...
Persistent link: https://www.econbiz.de/10013104566