Strategic behaviour, equilibria and economic optimality in settings with competing interests
Polak, Ido David
Date of Issue2017-05-08
School of Physical and Mathematical Sciences
In settings with competing interests interacting agents need to take into consideration many details and parameters of the environment. Examples include strategies and payoffs, rules of the game or market and uncertainty. We present several contributions in this area. We examine firms in markets with stochastic, limited demand and their deterministic counterparts, both in sequential as well as simultaneous form. We characterise their equilibria and show that the stochastic setup can be seen as a smoothing of the deterministic version. In particular, in the simultaneous case, we exhibit the existence of an intermediate regime of the demand, in which there is a range of equilibria in the deterministic framework, but a single equilibrium in the stochastic setting. We illustrate our findings by plotting graphs numerically. Also, we present new results from exchange economies for the incentive ratio, a concept intended to measure the extent to which an equilibrium outcome can be manipulated. Unlike in Fisher markets, the benefits from manipulation in linear, Leontief and Cobb-Douglas exchange economies can be arbitrarily large. For Cobb–Douglas markets we show that we can break the upper bound from Fisher models even in markets with only three goods, but we also demonstrate that the incentive ratio is bounded by the number of commodities.
DRNTU::Science::Mathematics::Applied mathematics::Game theory
Showing items related by title, author, creator and subject.
Yong, Kian Yan. (2013)DNA-based computing provides an alternative to solving optimization problems in graph theory. In this research, it is shown how DNA-based computing is used to find solutions to these problems, which involve logical thinking ...
Gravin, Nikolai. (2013)We consider two classes of optimization problems that emerge in the set up of the reverse auctions (a.k.a. procurement auctions). Unlike the standard optimization taking place for a commonly known input, we assume that ...
Anisur Rahaman Molla (2014)This thesis studies random walks and its algorithmic applications in distributed networks. Random walk is a fundamental technique which has found numerous applications in computer science, mathematics, statistics, physics, ...