Building an honest microfinance organization: Embezzlement and the optimality of rigid repayment schedules and joint liability

We consider the agency problem of a staff member managing microfinancing programs, who can abuse his discretion to embezzle borrowers' repayments. The fact that most borrowers of microfinancing programs are illiterate and live in rural areas where transportation costs are very high make staff's embezzlement particularly relevant as is documented by Mknelly and Kevane (2002). We study the trade-off between the optimal rigid lending contract and the optimal discretionary one and find that a rigid contract is optimal when the audit cost is larger than gains from insurance. Our analysis explains rigid repayment schedules used by the Grameen bank as an optimal response to the bank staff's agency problem. Joint liability reduces borrowers' burden of respecting the rigid repayment schedules by providing them with partial insurance. However, the same insurance can be provided byborrowers themselves under individual liability through a side-contract.

The struggle against creative accounting: Is "true and fair view" part of the problem or part of the solution?

Creative accounting is a growing issue of interest in Spain. In this article we argue that the concept true and fair view can limit or promote the use of creative accounting depending upon its interpretation. We review the range of meanings that true and fair view can take at an international level and compare the experience of the United Kingdom with the Australian one by analysing the use of true and fair view to limit creative accounting. Finally, we suggest lines of action to be considered by the Spanish accounting standards-setting institutions.

A new chance-constrained maximum capture location problem

The paper presents a new model based on the basic Maximum Capture model,MAXCAP. The New Chance Constrained Maximum Capture modelintroduces astochastic threshold constraint, which recognises the fact that a facilitycan be open only if a minimum level of demand is captured. A metaheuristicbased on MAX MIN ANT system and TABU search procedure is presented tosolve the model. This is the first time that the MAX MIN ANT system isadapted to solve a location problem. Computational experience and anapplication to 55 node network are also presented.

The donor problem

Donors often rely on local intermediaries to deliver benefits to target beneficiaries. Each selected recipient observes if the intermediary under-delivers to them, so they serve as natural monitors. However, they may withhold complaints when feeling unentitled or grateful to the intermediary for selecting them. Furthermore, the intermediary may distort selection (e.g. by picking richer recipients who feel less entitled) to reduce complaints. We design an experimental game representing the donor s problem. In one treatment, the intermediary selects recipients. In the other, selection is random - as by an uninformed donor. In our data, random selection dominates delegation of the selection task to the intermediary. Selection distortions are similar, but intermediaries embezzle more when they have selection power and (correctly) expect fewer complaints.

A simple optimised search heuristic for the job-shop scheduling problem

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

Solving a concrete sleepers production scheduling by genetic algorithms

PRECON S.A is a manufacturing company dedicated to produce prefabricatedconcrete parts to several industries as rail transportation andagricultural industries.Recently, PRECON signed a contract with RENFE,the Spanish Nnational Rail Transportation Company to manufacturepre-stressed concrete sleepers for siding of the new railways of the highspeed train AVE. The scheduling problem associated with the manufacturingprocess of the sleepers is very complex since it involves severalconstraints and objectives. The constraints are related with productioncapacity, the quantity of available moulds, satisfying demand and otheroperational constraints. The two main objectives are related withmaximizing the usage of the manufacturing resources and minimizing themoulds movements. We developed a deterministic crowding genetic algorithmfor this multiobjective problem. The algorithm has proved to be a powerfuland flexible tool to solve the large-scale instance of this complex realscheduling problem.

Adaptive dynamics and the implementation problem with complete information

This paper studies the equilibrating process of several implementationmechanisms using naive adaptive dynamics. We show that the dynamics convergeand are stable, for the canonical mechanism of implementation in Nash equilibrium.In this way we cast some doubt on the criticism of ``complexity'' commonlyused against this mechanism. For mechanisms that use more refined equilibrium concepts,the dynamics converge but are not stable. Some papers in the literatureon implementation with refined equilibrium concepts have claimed that themechanisms they propose are ``simple'' and implement ``everything'' (incontrast with the canonical mechanism). The fact that some of these ``simple''mechanisms have unstable equilibria suggests that these statements shouldbe interpreted with some caution.

Transportation choices and the value of statistical life

This paper exploits an unusual transportation setting to estimate the value of a statistical life(VSL). We estimate the trade-offs individuals are willing to make between mortality risk andcost as they travel to and from the international airport in Sierra Leone (which is separated fromthe capital Freetown by a body of water). Travelers choose from among multiple transportoptions ? namely, ferry, helicopter, hovercraft, and water taxi. The setting and original datasetallow us to address some typical omitted variable concerns in order to generate some of the firstrevealed preference VSL estimates from Africa. The data also allows us to compare VSLestimates for travelers from 56 countries, including 20 African and 36 non-African countries, allfacing the same choice situation. The average VSL estimate for African travelers in the sample isUS$577,000 compared to US$924,000 for non-Africans. Individual characteristics, particularlyjob earnings, can largely account for the difference between Africans and non-Africans; Africansin the sample typically earn somewhat less. There is little evidence that individual VSL estimatesare driven by a lack of information, predicted life expectancy, or cultural norms around risktakingor fatalism. The data implies an income elasticity of the VSL of 1.77. These revealedpreference VSL estimates from a developing country fill an important gap in the existingliterature, and can be used for a variety of public policy purposes, including in current debateswithin Sierra Leone regarding the desirability of constructing new transportation infrastructure.

Dispersal probability distributions and the wave-front speed problem

The speed and width of front solutions to reaction-dispersal models are analyzed both analytically and numerically. We perform our analysis for Laplace and Gaussian distribution kernels, both for delayed and nondelayed models. The results are discussed in terms of the characteristic parameters of the models

Note on the blocking flow shop problem

We present some results attained with different algorithms for the Fm|block|Cmax problem using as experimental data the well-known Taillard instances.

Autovías y ferrocarriles: un modelo para evaluar efectos intermodales de la política de infraestructuras

La construcción de autovías disminuye el coste temporal del viaje por carretera, con efectos sobre la demanda del transporte por carretera. Pero, además de los efectos intramodales, existen efectos intermodales, puesto que las autovías afectan a la demanda en otros modos alternativos a la carretera. En este trabajo formulamos y contrastamos empíricamente un modelo que permite obtener resultados para evaluar el impacto de las autovías sobre la demanda de ferrocarril. Seguidamente se pronostican algunos efectos sobre la demanda ferroviaria de algunas actuaciones en infraestructuras viarias incluidas en el Plan Director de Infraestructuras (1993-2007).

External dichotomous noise: The problem of the mean-first-passage time

A retarded backward equation for a non-Markovian process induced by dichotomous noise (the random telegraphic signal) is deduced. The mean-first-passage time of this process is exactly obtained. The Gaussian white noise and the white shot noise limits are studied. Explicit physical results in first approximation are evaluated.

Zenith angle distributions at Super-Kamiokande and SNO and the solution of the solar neutrino problem

We have performed a detailed study of the zenith angle dependence of the regeneration factor and distributions of events at SNO and SK for different solutions of the solar neutrino problem. In particular, we discuss the oscillatory behavior and the synchronization effect in the distribution for the LMA solution, the parametric peak for the LOW solution, etc. A physical interpretation of the effects is given. We suggest a new binning of events which emphasizes the distinctive features of the zenith angle distributions for the different solutions. We also find the correlations between the integrated day-night asymmetry and the rates of events in different zenith angle bins. The study of these correlations strengthens the identification power of the analysis.

Reply to Comment on 'Two-finger selection theory in the Saffman-Taylor problem

We clarify the meaning of the results of Phys. Rev. E 60, R5013 (1999). We discuss the use and implications of periodic boundary conditions, as opposed to rigid-wall ones. We briefly argue that the solutions of the paper above are physically relevant as part of a more general issue, namely the possible generalization to dynamics, of the microscopic solvability scenario of selection.