This document discusses using economic concepts like demand curves and elasticity to model garbage collection in programming languages. It introduces the concept of allocation curves and elasticity to represent how memory is allocated as a program runs. Experiments were done with different garbage collection algorithms on Java benchmarks to analyze their allocation curves and how shifting the curves or adjusting elasticity can control heap growth and improve performance. Alternative heuristics for heap growth management based on allocation elasticity are proposed and evaluated based on execution times and final heap sizes.