A theory of optimal random crackdowns

An incentives based theory of policing is developed which can explain the phenomenon of random “crackdowns,” i.e., intermittent periods of high interdiction/surveillance. For a variety of police objective functions, random crackdowns can be part of the optimal monitoring strategy. We demonstrate support for implications of the crackdown theory using traffic data gathered by the Belgian Police Department and use the model to estimate the deterrence effectof additional resources spent on speeding interdiction.

On optimal monetary and fiscal policy interactions in open economies

This paper studies monetary and fiscal policy interactions in a two country model, where taxes on firms sales are optimally chosen and the monetary policy is set cooperatively.It turns out that in a two country setting non-cooperative fiscal policy makers have an incentive to change taxes on sales depending on shocks realizations in order to reduce output production. Therefore whether the fiscal policy is set cooperatively or not matters for optimal monetary policy decisions. Indeed, as already shown in the literature, the cooperative monetary policy maker implements the flexible price allocation only when special conditions on the value of the distortions underlying the economy are met. However, if non-cooperative fiscal policy makers set the taxes on firms sales depending on shocks realizations, these conditions cannot be satisfied; conversely, when fiscal policy is cooperative, these conditions are fulfilled. We conclude that whether implementing the flexible price allocation is optimal or not depends on the fiscal policy regime.

The achievable region approach to the optimal control of stochastic systems

The achievable region approach seeks solutions to stochastic optimisation problems by: (i) characterising the space of all possible performances(the achievable region) of the system of interest, and (ii) optimisingthe overall system-wide performance objective over this space. This isradically different from conventional formulations based on dynamicprogramming. The approach is explained with reference to a simpletwo-class queueing system. Powerful new methodologies due to the authorsand co-workers are deployed to analyse a general multiclass queueingsystem with parallel servers and then to develop an approach to optimalload distribution across a network of interconnected stations. Finally,the approach is used for the first time to analyse a class of intensitycontrol problems.

Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs

Most research on single machine scheduling has assumedthe linearity of job holding costs, which is arguablynot appropriate in some applications. This motivates ourstudy of a model for scheduling $n$ classes of stochasticjobs on a single machine, with the objective of minimizingthe total expected holding cost (discounted or undiscounted). We allow general holding cost rates that are separable,nondecreasing and convex on the number of jobs in eachclass. We formulate the problem as a linear program overa certain greedoid polytope, and establish that it issolved optimally by a dynamic (priority) index rule,whichextends the classical Smith's rule (1956) for the linearcase. Unlike Smith's indices, defined for each class, ournew indices are defined for each extended class, consistingof a class and a number of jobs in that class, and yieldan optimal dynamic index rule: work at each time on a jobwhose current extended class has larger index. We furthershow that the indices possess a decomposition property,as they are computed separately for each class, andinterpret them in economic terms as marginal expected cost rate reductions per unit of expected processing time.We establish the results by deploying a methodology recentlyintroduced by us [J. Niño-Mora (1999). "Restless bandits,partial conservation laws, and indexability. "Forthcomingin Advances in Applied Probability Vol. 33 No. 1, 2001],based on the satisfaction by performance measures of partialconservation laws (PCL) (which extend the generalizedconservation laws of Bertsimas and Niño-Mora (1996)):PCL provide a polyhedral framework for establishing theoptimality of index policies with special structure inscheduling problems under admissible objectives, which weapply to the model of concern.

When to carry eccentric products? Optimal retail assortment under consumer returns

To understand whether retailers should consider consumer returns when merchandising, we study howthe optimal assortment of a price-taking retailer is influenced by its return policy. The retailer selects itsassortment from an exogenous set of horizontally differentiated products. Consumers make purchase andkeep/return decisions in nested multinomial logit fashion. Our main finding is that the optimal assortmenthas a counterintuitive structure for relatively strict return policies: It is optimal to offer a mix of the mostpopular and most eccentric products when the refund amount is sufficiently low, which can be viewed asa form of risk sharing between the retailer and consumers. In contrast, if the refund is sufficiently high, orwhen returns are disallowed, optimal assortment is composed of only the most popular products (a commonfinding in the literature). We provide preliminary empirical evidence for one of the key drivers of our results:more eccentric products have higher probability of return conditional on purchase. In light of our analyticalfindings and managerial insights, we conclude that retailers should take their return policies into accountwhen merchandising.

On optimal location with treshold requirements

The optimal location of services is one of the most important factors that affects service quality in terms of consumer access. On theother hand, services in general need to have a minimum catchment area so as to be efficient. In this paper a model is presented that locates the maximum number of services that can coexist in a given region without having losses, taking into account that they need a minimum catchment area to exist. The objective is to minimize average distance to the population. The formulation presented belongs to the class of discrete P--median--like models. A tabu heuristic method is presented to solve the problem. Finally, the model is applied to the location of pharmacies in a rural region of Spain.

Optimal regulation of a fully insured deposit banking system

We analyze risk sensitive incentive compatible deposit insurancein the presence of private information when the market value of depositinsurance can be determined using Merton's (1997) formula. We show that,under the assumption that transferring funds from taxpayers to financialinstitutions has a social cost, the optimal regulation combines differentlevels of capital requirements combined with decreasing premia on depositinsurance. On the other hand, it is never efficient to require the banksto hold riskless assets, so that narrow banking is not efficient. Finally,chartering banks is necessary in order to decrease the cost of asymmetricinformation.

The optimal length of contracts with application to outsourcing

This paper resolves three empirical puzzles in outsourcing by formalizing the adaptationcost of long-term performance contracts. Side-trading with a new partner alongside a long-term contract (to exploit an adaptation-requiring investment) is usually less effective than switching to the new partner when the contract expires. So long-term contracts that prevent holdup of specific investments may induce holdup of adaptation investments. Contract length therefore trades of specific and adaptation investments. Length should increase with the importance and specificity of self-investments, and decrease with the importance of adaptation investments for which side-trading is ineffective. My general model also shows how optimal length falls with cross-investments and wasteful investments.

Optimal monetary and fiscal policy in a currency union

We lay out a tractable model for fiscal and monetary policy analysis in a currency union, and study its implications for the optimal design of such policies. Monetary policy is conducted by a common central bank, which sets the interest rate for the union as a whole. Fiscal policy is implemented at the countrylevel, through the choice of government spending. The model incorporates country-specific shocks and nominal rigidities. Under our assumptions, the optimal cooperative policy arrangement requires that inflation be stabilized at the union level by the common central bank, while fiscal policy is used by each country for stabilization purposes. By contrast, when the fiscal authorities act in a non-coordinated way, their joint actions lead to a suboptimal outcome, and make the common central bank face a trade-off between inflation and output gap stabilization at the union level.

Optimal negligence rule under limited liability

We study the standard economic model of unilateral accidents, in its simplest form, assumingthat the injurers have limited assets.We identify a second-best optimal rule that selects as duecare the minimum of first-best care, and a level of care that takes into account the wealth ofthe injurer. We show that such a rule in fact maximizes the precautionary effort by a potentialinjurer. The idea is counterintuitive: Being softer on an injurer, in terms of the required level ofcare, actually improves the incentives to take care when he is potentially insolvent. We extendthe basic result to an entire population of potentially insolvent injurers, and find that the optimalgeneral standards of care do depend on wealth, and distribution of income. We also show theconditions for the result that higher income levels in a given society call for higher levels of carefor accidents.

Optimal second-degree price discrimination and arbitrage: On the role of asymetric information among buyers

The traditional theory of monopolistic screening tackles individualself-selection but does not address the possibility that buyers couldform a coalition to coordinate their purchases and to reallocate thegoods. In this paper, we design the optimal sale mechanism which takesinto account both individual and coalition incentive compatibilityfocusing on the role of asymmetric information among buyers. We showthat when a coalition of buyers is formed under asymmetric information,the monopolist can do as well as when there is no coalition. Although inthe optimal sale mechanism marginal rates of substitution are notequalized across buyers (hence there exists room for arbitrage), theyfail to realize the gains from arbitrage because of the transaction costsin coalition formation generated by asymmetric information.

Driver scheduling problem modelling

The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, for example buses, trains, plane or boat drivers or pilots, for the transportation of passengers or goods. This is a complex problem because it involves several constraints related to labour and company rules and can also present different evaluation criteria and objectives. Being able to develop an adequate model for this problem that can represent the real problem as close as possible is an important research area.The main objective of this research work is to present new mathematical models to the DSP problem that represent all the complexity of the drivers scheduling problem, and also demonstrate that the solutions of these models can be easily implemented in real situations. This issue has been recognized by several authors and as important problem in Public Transportation. The most well-known and general formulation for the DSP is a Set Partition/Set Covering Model (SPP/SCP). However, to a large extend these models simplify some of the specific business aspects and issues of real problems. This makes it difficult to use these models as automatic planning systems because the schedules obtained must be modified manually to be implemented in real situations. Based on extensive passenger transportation experience in bus companies in Portugal, we propose new alternative models to formulate the DSP problem. These models are also based on Set Partitioning/Covering Models; however, they take into account the bus operator issues and the perspective opinions and environment of the user.We follow the steps of the Operations Research Methodology which consist of: Identify the Problem; Understand the System; Formulate a Mathematical Model; Verify the Model; Select the Best Alternative; Present the Results of theAnalysis and Implement and Evaluate. All the processes are done with close participation and involvement of the final users from different transportation companies. The planner s opinion and main criticisms are used to improve the proposed model in a continuous enrichment process. The final objective is to have a model that can be incorporated into an information system to be used as an automatic tool to produce driver schedules. Therefore, the criteria for evaluating the models is the capacity to generate real and useful schedules that can be implemented without many manual adjustments or modifications. We have considered the following as measures of the quality of the model: simplicity, solution quality and applicability. We tested the alternative models with a set of real data obtained from several different transportation companies and analyzed the optimal schedules obtained with respect to the applicability of the solution to the real situation. To do this, the schedules were analyzed by the planners to determine their quality and applicability. The main result of this work is the proposition of new mathematical models for the DSP that better represent the realities of the passenger transportation operators and lead to better schedules that can be implemented directly in real situations.