ehrhart theory—the study of lattice point enumeration in polytopes with rational vertices—can be used to study various combinatorial objects, including posets and graphs. in this talk, we explore two weighted versions of ehrhart theory. we first ask which polynomial weights we can apply to our lattice so that the associated weighted h*-polynomials retain some of their classical properties, such as nonnegativity and monotonicity. we also study a second weighted ehrhart theory, chapoton’s q-analog ehrhart theory, and discuss its relationship to the principal specialization of stanley’s chromatic symmetric function. the first project is joint work with robert davis, jesús a. de loera, alexey garber, sofía garzón mora, katharina jochemko, and josephine yu, and the second project is joint work with matthias beck and andrés r. vindas meléndez.