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...

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...

In this paper we study Markov Decision Process (MDP) problems with the restriction that at decision epochs only a finite number of given Markovian decision rules may be applied. The elements of the finite set of allowed decision rules should be mixed to improve the performance. The set of...

Outcomes of the shallow lake interest conflict are presented in a number of different contexts: quasi-static and dynamic social planning, and quasi-static one-shot and repeated non-cooperative play. As the underlying dynamics are non-convex, the analysis uses geometrical-numerical methods: the...

In this paper, we study resource allocation in multiclass networks having several types of flexible servers and general constraints on the number of servers at each station. Each job class is characterized by the station where the job is processed and by the amount of work allocated to that...

A toric arrangement is a finite set of hypersurfaces in a complex torus, every hypersurface being the kernel of a character. In the present paper we prove that if TW is the toric arrangement defined by the cocharacters lattice of a Weyl group W, then the integer cohomology of its complement is...

The Dasgupta-Heal-Solow-Stiglitz model of capital accumulation and resource depletion poses the following sustainability problem: is it feasible to sustain indefinitely a level of consumption that is bounded away from zero? We provide a complete technological characterization of the...

This paper provides deterministic approximation results for stochastic processes that arise when finite populations recurrently play finite games. The deterministic approximation is defined in continuous time as a system of ordinary differential equations of the type studied in evolutionary game...

A combinatorical problem is said to be of high computational complexity, if it can be shown that every efficient algorithm needs a high amount of resources as measured in Computing time or storage capacity. This paper will (1) introduce some basic concepts of mathematical complexity theory; (2)...