An axiomatic characterization of the Baker-Thompson rule

The airport problem is a widely studied allocation problem, with the aim of providing simple and fair sharing rule for the landing fees. In this note we introduce some fairness criteria and characterize the classical Baker-Thompson allocation rule.     

Considerazioni sulla reciprocita' nei problemi di ottimo

In questo lavoro si stabiliscono alcune condizioni geometriche sull' immagine della funzione di cui si ricerca l'estremo e del vincolo per l'equivalenza tra problemi reciproci di estremo.

---

In economics it is sometimes of interest to study constrained extremum problems. We give geometric conditions on the image set of the function of which we search the extremum and of the constrain for the equivalence between some reciprocal extremum problems.

     

Science,technology and engineering: Building lifelong bridges

In response to what is envisaged as a crisis in scientific and technological literacy, various organizations and governmental agencies have put forward recommendations for enriching students' science and technology experiences in formal and informal learning environments. This paper examines one such organization — the Professional Engineers Ontario — and their Innovators in the School initiative. Through this student outreach programme, engineers, scientists and technologists volunteer their time to visit elementary and secondary level students, encouraging them to pursue science, technology and engineering careers. In particular, this research identifies issues that the Innovators (interestingly, over half are women) consider to be important for promoting a positive image of science to young people. First, the paper considers what an image of science might potentially be. Second, it addresses the question of how Innovators and other educators (teachers, policy-makers, curriculum planning teams) might promote this positive image in the classroom and school.     

Sulla dipendenza continua della probabilità di rovina dal caricamento dei premi

Si studia un modo di approssimare la probabilità di rovina relativa a un caricamento ₀ con le probabilità di rovina relative a una successione di caricamenti ( _k ) _k , che approssimano ₀ quandok tende all'infinito.

---

Summary In this paper we study a way of approximating the probability of ruin related to a loading ₀, by the probabilities of ruin related of a sequence of loadings ( _k ) _k which «approximate» ₀ ask converges to infinity.