Optimal bail out policy, conditionality and constructive ambiguity

This paper addresses the issue of the optimal behaviour of the Lender of Last Resort (LOLR) in its microeconomic role regarding individual financial institutions in distress. It has been argued that the LOLR should not intervene at the microeconomic level and let any defaulting institution face the market discipline, as it will be confronted with the consequences of the risks it has taken. By considering a simple costbenefit analysis we show that this position may lack a sufficient foundation. We establish that, instead, uder reasonable assumptions, the optimal policy has to be conditional on the amount of uninsured debt issued by the defaulting bank. Yet in equilibrium, because the rescue policy is costly, the LOLR will not rescue all the banks that fulfill the uninsured debt requirement condition, but will follow a mixed strategy. This we interpret as the confirmation of the "creative ambiguity" principle, perfectly in line with the central bankers claim that it is efficient for them to have discretion in lending to individual institutions. Alternatively, in other cases, when the social cost of a bank's bankruptcy is too high, it is optimal for the LOLR to bail out the insititution, and this gives support to the "too big to fail" policy.

Tobin meets Oates: Solidarity and the optimal fiscal federal structure

We explore the implications for the optimal degree of fiscal decentralization when people spreferences for goods and services, which classic treatments of fiscal federalism (Oates, 1972)place in the purview of local governments, exhibit specific egalitarianism (Tobin, 1970), orsolidarity. We find that a system in which the central government provides a common minimumlevel of the publicly provided good, and local governments are allowed to use their ownresources to provide an even higher local level, performs better from an efficiency perspectiverelative to all other systems analyzed for a relevant range of preferences over solidarity.

Optimal taxation without state-contingent debt

To recover a version of Barro's (1979) `random walk'tax smoothing outcome, we modify Lucas and Stokey's (1983) economyto permit only risk--free debt. This imparts near unit root like behaviorto government debt, independently of the government expenditureprocess, a realistic outcome in the spirit of Barro's. We showhow the risk--free--debt--only economy confronts the Ramsey plannerwith additional constraints on equilibrium allocations thattake the form of a sequence of measurability conditions.We solve the Ramsey problem by formulating it in terms of a Lagrangian,and applying a Parameterized Expectations Algorithm tothe associated first--order conditions. The first--order conditions andnumerical impulse response functions partially affirmBarro's random walk outcome. Though the behaviors oftax rates, government surpluses, and government debts differ, allocationsare very close for computed Ramsey policies across incomplete and completemarkets economies.

On information and competition in private value auctions

How much information does an auctioneer want bidders to have in a private value environment?We address this question using a novel approach to ordering information structures based on the property that in private value settings more information leads to a more disperse distribution of buyers updated expected valuations. We define the class of precision criteria following this approach and different notions of dispersion, and relate them to existing criteria of informativeness. Using supermodular precision, we obtain three results: (1) a more precise information structure yields a more efficient allocation; (2) the auctioneer provides less than the efficient level of information since more information increases bidder informational rents; (3) there is a strategic complementarity between information and competition, so that both the socially efficient and the auctioneer s optimal choice of precision increase with the number of bidders, and both converge as the number of bidders goes to infinity.

Optimal information transmission in organizations: Search and congestion

We propose a stylized model of a problem-solving organization whoseinternal communication structure is given by a fixed network. Problemsarrive randomly anywhere in this network and must find their way to theirrespective specialized solvers by relying on local information alone.The organization handles multiple problems simultaneously. For this reason,the process may be subject to congestion. We provide a characterization ofthe threshold of collapse of the network and of the stock of foatingproblems (or average delay) that prevails below that threshold. We buildupon this characterization to address a design problem: the determinationof what kind of network architecture optimizes performance for any givenproblem arrival rate. We conclude that, for low arrival rates, the optimalnetwork is very polarized (i.e. star-like or centralized ), whereas it islargely homogenous (or decentralized ) for high arrival rates. We also showthat, if an auxiliary assumption holds, the transition between these twoopposite structures is sharp and they are the only ones to ever qualify asoptimal.

The economics of organized crime and optimal law enforcement

This paper extends the optimal law enforcement literature to organized crime.We model the criminal organization as a vertical structure where the principal extracts some rents from the agents through extortion. Depending on the principal's information set, threats may or may not be credible. As long as threats are credible, the principal is able to fully extract rents.In that case, the results obtained by applying standard theory of optimal law enforcement are robust: we argue for a tougher policy. However, when threats are not credible, the principal is not able to fully extract rents and there is violence. Moreover, we show that it is not necessarily true that a tougher law enforcement policy should be chosen when in presence of organized crime.

Optimal law enforcement and criminal organization

In this paper, we take an organizational view of organized crime. In particular, we study the organizational consequences of product illegality attending at the following characteristics: (i) contracts are not enforceable in court, (ii) all participants are subject to the risk of being punished, (iii) employees present a major threat to the entrepreneur having the most detailed knowledge concerning participation, (iv) separation between ownership and management is difficult because record-keeping and auditing augments criminal evidence.

On bounds for network revenue management

The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.

Managing by values in the next milenium: Cultural redesign for strategic organizational change

The system of beliefs and values, that shaped the model for management and organizations during the 20th century, is just not good enough today. In order to keep a business functioning well and competing successfully in markets that are increasingly more global, complex, professionally demanding, constantly changing and oriented towards quality and customer satisfaction a new model is needed. In this paper, we will propose that both Management by Instructions (MBI) and Management by Objectives (MBO) today give notoriously inadequate results. By contrast, description of a new approach labeled: Management by Values (MBV), seem to be emerging as a strategic leadership tool. The paper outlines this approach and discusses the implementation of MBV as a tool to redesign culture in organizations and prepare them for the next millenium.

Heterogeneity-promoting optimal procurement

When procurement takes place in the presence of horizontally differentiated contractors, the design of the object being procured affects the resulting degree of competition. This paper highlights the interaction between theoptimal procurement mechanism and the design choice. Contrary to conventional wisdom, the sponsor's design choice, instead of homogenizingthe market to generate competition, promotes heterogeneity.

Dynamic optimal law enforcement with learning

We incorporate the process of enforcement learning by assuming that the agency's current marginal cost is a decreasing function of its past experience of detecting and convicting. The agency accumulates data and information (on criminals, on opportunities of crime) enhancing the ability to apprehend in the future at a lower marginal cost.We focus on the impact of enforcement learning on optimal stationary compliance rules. In particular, we show that the optimal stationary fine could be less-than-maximal and the optimal stationary probability of detection could be higher-than-otherwise.

Optimal law enforcement under asymmetric information

In this paper, we focus on the problem created by asymmetric informationabout the enforcer's (agent's) costs associated to enforcement expenditure. This adverse selection problem affects optimal law enforcement because a low cost enforcer may conceal its information by imitating a high cost enforcer, and must then be given a compensation to be induced to reveal its true costs. The government faces a trade-off between minimizing the enforcer's compensation and maximizing the net surplus of harmful acts. As a consequence, the probability of apprehension and punishment is usually reduced leading to more offenses being committed. We show that asymmetry of information does not affect law enforcement as long as raising public funds is costless. The consideration of costly raising of public funds permits to establish the positive correlation between asymmetry of information between government and enforcers andthe crime rate.

Parametrització de contorns oberts

Un dels principals problemes quan es realitza un anàlisi de contorns és la gran quantitat de dades implicades en la descripció de la figura. Per resoldre aquesta problemàtica, s’aplica la parametrització que consisteix en obtenir d’un contorn unes dades representatives amb els mínims coeficients possibles, a partir dels quals es podrà reconstruir de nou sense pèrdues molt evidents d’informació. En figures de contorns tancats, la parametrització més estudiada és l’aplicació de la transformada discreta de Fourier (DFT). Aquesta s’aplica a la seqüència de valors que descriu el comportament de les coordenades x i y al llarg de tots els punts que formen el traç. A diferència, en els contorns oberts no es pot aplicar directament la DFT ja que per fer-ho es necessita que el valor de x i de y siguin iguals tan en el primer punt del contorn com en l’últim. Això és degut al fet que la DFT representa sense error senyals periòdics. Si els senyals no acaben en el mateix punt, representa que hi ha una discontinuïtat i apareixen oscil·lacions a la reconstrucció. L’objectiu d’aquest treball és parametritzar contorns oberts amb la mateixa eficiència que s’obté en la parametrització de contorns tancats. Per dur-ho a terme, s’ha dissenyat un programa que permet aplicar la DFT en contorns oberts mitjançant la modificació de les seqüencies de x i y. A més a més, també utilitzant el programari Matlab s’han desenvolupat altres aplicacions que han permès veure diferents aspectes sobre la parametrització i com es comporten els Descriptors El·líptics de Fourier (EFD). Els resultats obtinguts han demostrat que l’aplicació dissenyada permet la parametrització de contorns oberts amb compressions òptimes, fet que facilitarà l’anàlisi quantitatiu de formes en camps com l’ecologia, medicina, geografia, entre d’altres.

Optimal management of microgrids

Desenvolupament dels models matemàtics necessaris per a controlar de forma òptima la microxarxa existent als laboratoris del Institut de Recerca en Energia de Catalunya. Els algoritmes s'implementaran per tal de simular el comportament i posteriorment es programaran directament sobre els elements de la microxarxa per verificar el seu correcte funcionament.. Desenvolupament dels models matemàtics necessaris per a controlar de forma òptima la microxarxa existent als laboratoris del Institut de Recerca en Energia de Catalunya. Els algoritmes s'implementaran per tal de simular el comportament i posteriorment es programaran directament sobre els elements de la microxarxa per verificar el seu correcte funcionament.