No description available.

No description available.

Increasing dynamics in power systems on account of renewable integration, electric vehicle penetration and rising demands have resulted in the exploration of energy storage for potential solutions. Recent technology- and industry-driven developments have led to a drastic decrease in costs of these storages, further advocating their usage. This thesis compiles the author's research on optimal integration of energy storage. Unpredictability is modelled using random variables favouring the need of stochastic optimization algorithms such as Lyapunov optimization and stochastic approximation. Moreover, consumer interactions in a competitive environment implore the need of topics from game theory. The concept of Nash equilibrium is introduced and methods to identify such equilibrium points are laid down. Utilizing these notions, two research contributions are made. Firstly, a strategy for controlling heterogeneous energy storage units operating at different timescales is put forth. They strategy is consequently employed optimally for arbitrage in an electricity market consisting of day-ahead and real-time pricing. Secondly, energy storages owned by consumers connected to different nodes of a power distribution grid are coordinated in a competitive market. A generalized Nash equilibrium problem is formulated for their participation in arbitrage and energy balancing, which is then solved using a novel emph{weighted} Lyapunov approach. In both cases, we design real-time algorithms with provable suboptimality guarantees in terms of the original centralized and equilibrium problems. The algorithms are tested on realistic scenarios comprising of actual data from electricity markets corroborating the analytical findings. / Master of Science

This dissertation consists of three chapters on the topic of differential games and resource economics. The first chapter extends the envelope theorem to the class of discounted infinite horizon differential games that posses locally differentiable Nash equilibria. The theorems cover both the open-loop and feedback information structures, and are applied to a simple analytically solvable linear-quadratic game. The results show that the conventional interpretation of the costate variable as the shadow value of the state variable along the equilibrium path is only valid for feedback Nash equilibria, but not for open-loop Nash equilibria. The specific linear-quadratic structure provides some extra insights on the theorem. For example, the costate variable is shown to uniformly overestimate the shadow value of the state variable in the open-loop case, but the growth rate of the costate variable are the same as the shadow value under open-loop and feedback information structures. Chapter two investigates the qualitative properties of symmetric open-loop Nash equilibria for a ubiquitous class of discounted infinite horizon differential games. The results show that the specific functional forms and the value of parameters used in the game are crucial in determining the local asymptotic stability of steady state, the steady state comparative statics, and the local comparative dynamics. Several sufficient conditions are provided to identify a local saddle point type of steady state. An important steady state policy implication from the model is that functional forms and parameter values are not only quantitatively important to differentiate policy tools, but they are also qualitatively important. Chapter three shifts the interests to the lottery mechanism for rationing public resources. It characterizes the optimal pricing strategies of lotteries for a welfare-maximization agency. The optimal prices are shown to be positive for a wide range of individual private value distributions, suggesting that the sub-optimal pricing may result in a significant efficiency loss and that the earlier studies under zero-pricing may need to be re-examined. In addition, I identify the revenue and welfare equivalency propositions across lottery institutions. Finally, the numerical simulations strongly support the findings.

The present work seeks to incorporate a popular descriptive, empirically grounded model of human preference under risk, prospect theory, into the equilibrium theory of noncooperative games. Three primary, candidate definitions are systematically identified on the basis of classical characterizations of Nash Equilibrium; in addition, three equilibrium subtypes are defined for each primary definition, in order to enable modeling of players' reference points as exogenous and fixed, slowly and myopically adaptive, highly flexible and non-myopically adaptive. Each primary equilibrium concept was analyzed both theoretically and empirically; for the theoretical analyses, prospect theory, game theory, and computational complexity theory were all summoned to analysis. In chapter 1, the reader is provided with background on each of these theoretical underpinnings of the current work, the scope of the project is described, and its conclusions briefly summarized. In chapters 2 and 3, each of the three equilibrium concepts is analyzed theoretically, with emphasis placed on issues of classical interest (e.g. existence, dominance, rationalizability) and computational complexity (i.e, assessing how difficult each concept is to apply in algorithmic practice, with particular focus on comparison to classical Nash Equilibrium). This theoretical analysis leads us to discard the first of our three equilibrium concepts as unacceptable. In chapter 4, our remaining two equilibrium concepts are compared empirically, using average-level data originally aggregated from a number of studies by Camerer and Selten and Chmura; the results suggest that PT preferences may improve on the descriptive validity of NE, and pose some interesting questions about the nature of the PT weighting function (2003, Ch. 3). Chapter 5 concludes, systematically summarizes theoretical and empirical differences and similarities between the three equilibrium concepts, and offers some thoughts on future work.

La th´eorie de la complexit´e permet de classifier les probl`emes en fonction de leur difficult´e. Le cadre classique dans lequel elle s’applique est celui d’un algorithme centralis´e qui dispose de toutes les informations. Avec l’essor des r´eseaux et des architectures d´ecentralis´ees, l’algo- rithmique distribu´ee a ´et´e ´etudi´ee. Dans un grand nombre de probl`emes, en optimisation et en ´economie, les d´ecisions et les calculs sont effectu´es par des agents ind´ependants qui suivent des objectifs diff´erents dont la r´ealisation d´epend des d´ecisions des autres agents. La th´eorie des jeux est un cadre naturel pour analyser les solutions de tels probl`emes. Elle propose des concepts de stabilit´e, le plus classique ´etant l’´equilibre de Nash.Une mani`ere naturelle de calculer de telles solutions est de “ faire r´eagir “ les agents ; si un agent voit quelles sont les d´ecisions des autres joueurs ou plus g´en´eralement un “ ´etat du jeu “, il peut d´ecider de changer sa d´ecision pour atteindre son objectif faisant ainsi ´evoluer l’´etat du jeu. On dit que ces algorithmes sont des “ dynamiques “.On sait que certaines dynamiques convergent vers un concept de solution. On s’int´eresse `a la vitesse de convergence des dynamiques. Certains concepts de solutions sont mˆeme complets pour certaines classes de complexit´e ce qui rend peu vraisemblable l’existence de dynamiques simples qui convergent rapidement vers ces solutions. On a utilis´e alors trois approches pour obtenir une convergence rapide : am´eliorer la dynamique (en utilisant par exemple des bits al´eatoires), restreindre la structure du probl`eme, et rechercher une solution approch´ee.Sur les jeux de congestion, on a ´etendu les r´esultats de convergence rapide vers un ´equilibre de Nash approch´e aux jeux n´egatifs. Cependant, on a montr´e que sur les jeux sans contrainte de signe, calculer un ´equilibre de Nash approch´e est PLS-complet. Sur les jeux d ’appariement, on a ´etudi´e la vitesse de dynamiques concurrentes lorsque les joueurs ont une information partielle param´etr´ee par un r´eseau social. En particulier, on a am´elior´e des dynamiques naturelles afin qu’elles atteignent un ´equilibre enO(log(n)) tours (avec n le nombre de joueurs). / Complexity theory allows to classify problems by their algorithmic hardness. The classical framework in which it applies is the one of a centralized algorithm that knows every informa- tion. With the development of networks and decentralized architectures, distributed dynamics was studied. In many problems, in optimization or economy, actions and computations are made by independant agents that don’t share the same objective whose realization depends on the actions of other agents. Game theory is a natural framework to study solutions of this kind of problem. It provides solution concepts such as the Nash equilibrium.A natural way to compute these solutions is to make the agents “react” ; if an agent sees the actions of the other player, or more generally the state of the game, he can decide to change his decision to reach his objective and updates the state of the game. We call �dynamics� this kind of algorithms.We know some dynamics converges to a stable solution. We are interested by the speed of convergence of these dynamics. Some solution concepts are even complete for some complexity classes which make unrealistic the existence of fast converging dynamics. We used three ways to obtain a fast convergence : improving dynamics (using random bits), finding simple subcases, and finding an approximate solution.We extent fast convergence results to an approximate Nash equilibria in negative congestion games. However, we proved that finding an approximate Nash equilibrium in a congestion games without sign restriction is PLS-complete. On matching game, we studied the speed of concurrent dynamics when players have partial information that depends on a social network. Especially, we improved natural dynamics for them to reach an equilibrium inO(log(n)) rounds (with n is the number of players).

O modelo a ser apresentado consiste em um jogo de preço e localização entre duas firmas. Utiliza-se o pressuposto de que os consumidores têm sua utilidade positivamente afetada por um efeito de rede, ou seja, são diretamente influenciados pela tamanho da demanda do bem. Dispondo os consumidores uniformemente distribuídos dentro de um intervalo linear [0, 1], buscamos encontrar os equilíbrios de preço e localização do jogo proposto. Verificamos que, dados os pressupostos do modelo, existem equilíbrios de Nash para cada subjogo e dependerão da força dos efeitos de rede. Quando os efeitos de rede são fortes o suficiente, os preços praticados serão inicialmente reduzidos até que o monopólio seja alcançado por uma das firmas, quando o preço será elevado e a outra firma passará a cobrar um preço nulo. No subjogo de localizações foi possível identificar que, no caso em que o poder do efeito de rede está acima de um determinado nível, as firmas não irão diferenciar seus produtos e se localizarão em algum ponto dentro do intervalo fechado [1/4 , 3/4] / The model to be presented is a price-location game between two firms. The assumption is that consumers\' utility is positively affected by a network effect, i.e. it is directly influenced by the size of demand. Distributing consumers uniformly in a linear interval [0, 1] we seek the price and location equilibrium of the proposed game. We found that, given the model assumptions, there are Nash equilibria for each subset that depend on the strength of network effects. When network effects are strong enough, prices are initially reduced until the monopoly is reached by one of the firms, then the price rises and the other firm shall charge a null price. In the subgame of locations, when the power of the network effect is above a certain level, the firms will not differentiate their products and will be located at any point within the closed interval [1/4 , 3/4]

Thesis advisor: Hideo Konishi / My doctoral dissertation contains three essays on menu auction and its related applications. The first chapter is a theoretical generalization of classical menu auction model, and the second and the third chapters are applications to a resource allocation problem and an industrial organization problem. Menu auction (Bernheim and Whinston, 1986) is a first-price package auction with complete information. They show that every Nash equilibrium under some refinements always leads to an efficient outcome. Therefore, this becomes a natural efficiency benchmark for package auction designs (e.g., Ausubel and Milgrom 2002). Menu auction can also be viewed as a model of economic influence where the auctioneer is going to choose an action which affects bidders' payoff so that each bidder tries to influence the outcome by monetary transfer to the auctioneer. This framework is widely adopted in political lobbying models where the special interest groups lobbying the government over trade policies (e.g., Grossman and Helpman 1994). However, the applicability is limited by quasi-linear preferences and the absence of budget constraints. In my first chapter, ``Menu Auctions with Non-Transferable Utilities and Budget Constraints'', I extends Bernheim and Whinston's (1986) menu auction model under transferable utilities to a framework with non-transferable utilities and budget constraints. Under appropriate definitions of equilibria consistent with subgame perfection, it is shown that every truthful Nash equilibrium (TNE) is a coalition-proof Nash equilibrium (CPNE) and that the set of TNE payoffs and the set of CPNE payoffs are equivalent, as in a transferable utility framework. The existence of a CPNE is assured in contrast with the possible non-existence of Nash equilibrium under the definition by Dixit, Grossman, and Helpman (1997). Moreover, the set of CPNE payoffs is equivalent to the bidder-optimal weak core. The second chapter relates menu auction to a resource allocation problem. Kelso and Crawford (1982) propose a wage-adjustment mechanism resulting in a stable matching between heterogeneous firms and workers. Instead of a benevolent social planner, in ``Profit-Maximizing Matchmaker'' (w. Hideo Konishi), we consider a profit-maximizing auctioneer to solve this many-to-one assignment problem. If firms can only use individualized price, then the auctioneer can only earn zero profit in every Nash equilibrium and the sets of stable assignments and strong Nash equilibria are equivalent. Otherwise, the auctioneer might earn positive profit even in a coalition-proof Nash equilibrium. This reinforces Milgrom's (2010) argument on the benefit of using simplified message spaces that it not only reduces information requirement but also improves resource allocation. The third chapter applies menu auction in an industrial organization problem. In ``Choosing a Licensee from Heterogeneous Rivals'' (w. Hideo Konishi and Anthony Creane), we consider a firm licensing its production technology to rivals when firms with heterogeneous in production costs competing in a Cournot market. While Katz and Shapiro (1986) show that a complete transfer in duopoly can be joint-profit reducing, we show that it is always joint-profit improving provided that at least three firms remain in the industry after transfer. While transfers between similarly efficient firms may reduce welfare, the social welfare must increase if the licensor is the most efficient in the industry, contrast with Katz and Shapiro (1985) in the duopoly environment. This has an important implication in competition regulation. Then we investigate relative efficiency of the licensee under different licensing auction mechanisms. With natural refinement of equilibria, we show that a menu auction licensee, a standard first-price auction licensee, and a joint-profit maximizing licensee are in (weakly) descending order of efficiency. / Thesis (PhD) — Boston College, 2012. / Submitted to: Boston College. Graduate School of Arts and Sciences. / Discipline: Economics.

The results section of my thesis includes three chapters. The first two chapters are on theoretical game theory. In both chapters, by mathematical modelling and game theoretical tools, I am predicting the behaviour of the players in some real world issues. Hoteling-Downs model plays an important role in the modern political interpretations. The first chapter of this study investigates an extension of Hoteling-Downs model to have multi-dimensional strategy space and asymmetric candidates. Chapter 3 looks into the inspection game where the inspections are not the same in the series of sequential inspections. By modelling the game as a series of recursive zero-sum games I find the optimal strategy of the players in the equilibrium. The forth chapter investigates direct optimization methods for large scale problems. Using Matlab implementations of Genetic and Nelder-Mead algorithms, I compare the efficiency and accuracy of the most famous direct optimization methods for unconstraint optimization problems based on differing number of variables.

O presente trabalho busca apresentar uma aplicação da teoria dos jogos, de modo a complementar a literatura que utiliza esse referencial teórico e alcançar conclusões pertinentes que desafiam o senso comum. O assunto trabalhado são os debates políticos televisivos e o excesso de acusações realizadas pelos participantes. Através de premissas e expectativas dos jogos não cooperativos, que foram aplicadas sobre os debates de 2º turno das eleições presidenciais de 1989, 2006, 2010 e 2014, a hipótese de que a razão de tal comportamento é a própria organização do jogo, e não uma eventual falta de propostas a serem apresentadas pelos políticos, não é refutada empiricamente. Além disso, sugestões de mudanças de regras desses programas são realizadas, de modo que seu objetivo principal, a exposição de planos de governo, passe a ser atingido. / The present work seeks to present an application of the Game Theory, in order to complement the literature that uses this theoretical reference and to reach pertinent conclusions that defy common sense. The topic that is going to be studied are the televised political debates and the excess of accusations made by the participants. Through assumptions and expectations of non-cooperative games, that were applied to the 2nd round debates of the 1989, 2006, 2010 and 2014 presidential elections, the hypothesis that the reason for such behavior is the organization of the game, not an eventual lack of proposals by the political parties, is not empirically refuted. In addition, suggestions for changes in the rules of these programs are made, in order to ensure that the primary debates\' goal of exposing government plans is reached.