A set $S\subseteq V$ is $α$-dominating if for all $v\in V-S$, $|N(v) \cap S | \geq α|N(v)|.$ The $α$-domination number of $G$ equals the minimum cardinality of an $α$-dominating set $S$ in $G$. Since being introduced by Dunbar, et al. in 2000, $α$-domination has been studied for various graphs and a variety of bounds have been developed. In this paper, we propose a new parameter derived by flipping the inequality in the definition of $α$-domination. We say a set $S \subset V$ is a $β$-packing set of a graph $G$ if $S$ is a proper, maximal set having the property that for all vertices $v \in V-S$, $|N(v) \cap S| \leq β|N(v)|$ for some $0 < β\leq 1.$ The $β$-packing number of $G$ ($β$-pack($G$)) equals the maximum cardinality of a $β$-packing set in $G$. In this research, we determine $β$-pack($G$) for several classes of graphs, and we explore some properties of $β$-packing sets. Keywords: $β$-packing, $α$-domination, graph theory, graph parameters