Intervention strategies on teachers focused on creating meaningful educational environments for mathematical abilities development

This article describes an intervention process undertaken in a training program for preschool and first grade teachers from public schools in Cali, Colombia. The objective of this process is to provide a space for teachers to reflect on pedagogical practices which allow them to generate educational processes that foster children’s understanding of mathematical knowledge in the classroom. A set of support strategies was presented for helping teachers in the design, analysis and implementation of learning environments as meaningful educational spaces. Furthermore, participants engaged in an analysis of their own intervention modalities to identify which modalities facilitate the development of mathematical abilities in children. In order to ascertain the transformations in the teachers’ learning environments, the mathematical competences and cognitive processes underlying the activities proposed in the classroom, as well as teacher intervention modalities and the types of student participation in classroom activities were examined both before and after the intervention process. Transformations in the teachers’ conceptions about the children’s abilities and their own practices in teaching mathematics in the classroom were evidenced.

On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets

We consider two–sided many–to–many matching markets in which each worker may work for multiple firms and each firm may hire multiple workers. We study individual and group manipulations in centralized markets that employ (pairwise) stable mechanisms and that require participants to submit rank order lists of agents on the other side of the market. We are interested in simple preference manipulations that have been reported and studied in empirical and theoretical work: truncation strategies, which are the lists obtained by removing a tail of least preferred partners from a preference list, and the more general dropping strategies, which are the lists obtained by only removing partners from a preference list (i.e., no reshuffling). We study when truncation / dropping strategies are exhaustive for a group of agents on the same side of the market, i.e., when each match resulting from preference manipulations can be replicated or improved upon by some truncation / dropping strategies. We prove that for each stable mechanism, truncation strategies are exhaustive for each agent with quota 1 (Theorem 1). We show that this result cannot be extended neither to group manipulations (even when all quotas equal 1 – Example 1), nor to individual manipulations when the agent’s quota is larger than 1 (even when all other agents’ quotas equal 1 – Example 2). Finally, we prove that for each stable mechanism, dropping strategies are exhaustive for each group of agents on the same side of the market (Theorem 2), i.e., independently of the quotas.

Allocation rules on networks

When allocating a resource, geographical and infrastructural constraints have to be taken into account. We study the problem of distributing a resource through a network from sources endowed with the resource to citizens with claims. A link between a source and an agent depicts the possibility of a transfer from the source to the agent. Given the supplies at each source, the claims of citizens, and the network, the question is how to allocate the available resources among the citizens. We consider a simple allocation problem that is free of network constraints, where the total amount can be freely distributed. The simple allocation problem is a claims problem where the total amount of claims is greater than what is available. We focus on consistent and resource monotonic rules in claims problems that satisfy equal treatment of equals. We call these rules fairness principles and we extend fairness principles to allocation rules on networks. We require that for each pair of citizens in the network, the extension is robust with respect to the fairness principle. We call this condition pairwise robustness with respect to the fairness principle. We provide an algorithm and show that each fairness principle has a unique extension which is pairwise robust with respect to the fairness principle. We give applications of the algorithm for three fairness principles: egalitarianism, proportionality and equal sacrifice.

Asymmetrically fair rules for an indivisible good problem with a budget constraint

We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other. There is also a maximum amount of money available for the compensation. We characterize a family of asymmetrically fair rules that are immune to strategic behavior, guarantee minimal welfare levels for the agents, and satisfy the budget constraint.

Economía matemática: antecedentes, evolución y algunos desarrollos recientes

Se presenta aquí, en forma breve, el origen de la matematización económica y el campo de la economía matemática. Un enfoque histórico inicial divide dicho campo en un primer periodo denominado marginalista, otro donde se utiliza la teoría de los conjuntos y modelos lineales y por último un periodo que integra los dos anteriores. Posteriormente, se analiza la evolución de la Teoría del Equilibrio General desde Quesnay, pasando por Walras y desarrollos posteriores hasta su culminación con los trabajos de Arrow, Debreu y sus contemporáneos. Finalmente, se describe la influencia de las matemáticas, en especial de la optimización dinámica, en la teoría macroeconómica y a otras áreas de la economía.