/pdf/the-theory-of-industrial-organization-19bejph0ej.pdf

The Theory of Industrial Organization

We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route traffic such that the sum of all travel times---the total latency---is minimized.In many settings, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, we assume that each network user routes its traffic on the minimum-latency path available to it, given the network congestion caused by the other users. In general such a "selfishly motivated" assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance.In this article, we quantify the degradation in network performance due to unregulated traffic. We prove that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency (subject to the condition that all traffic must be routed). We also consider the more general setting in which edge latency functions are assumed only to be continuous and nondecreasing in the edge congestion. Here, the total latency of the routes chosen by unregulated selfish network users may be arbitrarily larger than the minimum possible total latency; however, we prove that it is no more than the total latency incurred by optimally routing twice as much traffic.

/pdf/how-bad-is-selfish-routing-g644vu88rg.pdf

How bad is selfish routing

Information, trade and common knowledge

A major challenge in the operation of wireless communications systems is the efficient use of radio resources. One important component of radio resource management is power control, which has been studied extensively in the context of voice communications. With the increasing demand for wireless data services, it is necessary to establish power control algorithms for information sources other than voice. We present a power control solution for wireless data in the analytical setting of a game theoretic framework. In this context, the quality of service (QoS) a wireless terminal receives is referred to as the utility and distributed power control is a noncooperative power control game where users maximize their utility. The outcome of the game results in a Nash (1951) equilibrium that is inefficient. We introduce pricing of transmit powers in order to obtain Pareto improvement of the noncooperative power control game, i.e., to obtain improvements in user utilities relative to the case with no pricing. Specifically, we consider a pricing function that is a linear function of the transmit power. The simplicity of the pricing function allows a distributed implementation where the price can be broadcast by the base station to all the terminals. We see that pricing is especially helpful in a heavily loaded system.

/pdf/efficient-power-control-via-pricing-in-wireless-data-34gk0jwxel.pdf

Efficient power control via pricing in wireless data networks

The History of Economic Analysis

The paper investigates the conditions under which an abstractly given market game will have the property that if there is a continuum of traders then every noncooperative equilibrium is Walrasian. In other words, we look for a general axiomatization of Cournot's well-known result. Besides some convexity, continuity, and nondegeneracy hypotheses, the crucial axioms are: anonymity (i.e., the names of traders are irrelevant to the market) and aggregation (i.e., the net trade received by a trader depends only on his own action and the mean action of all traders). It is also shown that the same axioms do not guarantee efficiency if there is only a finite number of traders. Some examples are discussed and a notion of strict noncooperative equilibrium for anonymous games is introduced.

Efficiency Properties of Strategic Market Games: An Axiomatic Approach*

We build a one-period general equilibrium model with money. Equilibrium exists, and fiat money has positive value, as long as the ratio of outside money to inside money is less than the gains to trade available at autarky. We show that the nominal effects of government fiscal and monetary policy can be completely described by a diagram identical in form to the IS-LM curves introduced by Hicks to describe Keynes' general theory. IS-LM analysis is thus not incompatible with full market clearing, multiple commodities, and heterogeneous households. We show that as the government deficit approaches a finite threshold, hyperinflation sets in (prices converge to infinity and real trade collapses). If the government surplus is too large, the economy enters a liquidity trap in which nominal GNP sinks and monetary policy is ineffectual.

Inside and Outside Money, Gains to Trade, and IS-LM

We derive the existence of a Walras equilibrium directly from Nash's theorem on noncooperative games. No price player is involved, nor are generalized games.

Existence of Walras Equilibrium Without a Price Player of Generalized Game

We build a finite horizon model with inside and outside money, in which interest rates, price levels and commodity allocations are determinate, even though asset markets are incomplete and asset deliveries are purely nominal.

Pradeep Dubey

Papers

Efficiency Properties of Strategic Market Games: An Axiomatic Approach*

Inside and Outside Money, Gains to Trade, and IS-LM

Existence of Walras Equilibrium Without a Price Player of Generalized Game

Real Determinacy with Nominal Assets

Probabilistic Generalizations of the Shapley Value