Let $P$ be an $n$-element poset and $J(P)$ the distributive lattice of its order ideals (i.e., the downwards-closed sets).
For each $I\in J(P)$ let $x_I \in \mathbb{R}^{n}$ be the indicator function of the order ideal and let $\widetilde{x}_I \in \mathbb{R}^{n+1}$ be the lift of $x_I$ where we make the last coordinate be $1$. Let $\mathcal{C}_P \subseteq \mathbb{R}^{n+1}$ be the convex cone generated by all the $\widetilde{x}_I$ for $I \in J(P)$, and consider the semigroup $S(\mathcal{C}_P) := \mathcal{C}_P \cap \mathbb{Z}^{n+1}$ and its semigroup algebra $k[S(\mathcal{C}_P)]$.
($\mathcal{C}_P$ is the cone of the affinization of the "order polytope" of $P$.)
Let us say that $I, I' \in J(P)$ are compatible if either $I\subseteq I'$ or $I'\subseteq I$.
Question: Has anyone considered the following analogy, suggesting $k[S(\mathcal{C}_P)]$ is similar to a cluster algebra? :
Clusters <-> Maximal collections of pairwise compatible elements of $J(P)$ (these are in bijection with linear extensions of $P$)
Cluster monomials <-> Monomials $\widetilde{x}_{I_1}^{i_1} \cdots \widetilde{x}_{I_m}^{i_m} \in k[S(\mathcal{C}_P)]$ with $I_1,\ldots,I_m$ pairwise compatible
Cluster mutation <-> ???
The point is that monomials of the form above give a basis for $k[S(\mathcal{C}_P)]$, just like for finite type cluster algebras the cluster monomials give a basis.