Metraipolis › archive › dc_86e1e760aef4

FairFRESH: A Neuro-Symbolic Framework for Fair and Explainable Household Food Recommendation — arXiv:2610.31506

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.31506
License (as archived)
CC0-1.0
Archived
2026-10-25T20:53:26.896Z
SHA-256 of the archived text
be636e2171db0e8ca08ef30fa298489a6add684abdb88aa404a1208bb5d477df
Stable URL of this page
https://metraipolis.com/documento/dc_86e1e760aef4

How to cite

FairFRESH: A Neuro-Symbolic Framework for Fair and Explainable Household Food Recommendation — arXiv:2610.31506 — arXiv (en), https://arxiv.org/abs/2610.31506 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_86e1e760aef4 (Metraipolis archive dc_86e1e760aef4, sha256 be636e2171db0e8ca08ef30fa298489a6add684abdb88aa404a1208bb5d477df)
BibTeX
@misc{dc86e1e760aef4,
  title = {FairFRESH: A Neuro-Symbolic Framework for Fair and Explainable Household Food Recommendation — arXiv:2610.31506},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.31506},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_86e1e760aef4; sha256 be636e2171db0e8ca08ef30fa298489a6add684abdb88aa404a1208bb5d477df},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.31506. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Recommender systems typically serve one user at a time. However, in households, members share a finite pantry and follow different dietary rules, making independent recommendations prone to resource conflicts and dietary violations. We formulate household food recommendation as constrained fair division and present FairFRESH, a neuro-symbolic framework that learns per-member utilities, allocates foods under explicit welfare objectives, enforces dietary rules through a deterministic filter, and explains recommendations using Shapley and Banzhaf attributions. Theoretically, we show that no finite penalty guarantees compliance near a dietary-rule threshold, establish approximation guarantees for greedy allocation under utilitarian and smoothed Nash objectives in the stock-free model before filtering, and characterize the scale invariance of Nash welfare. We also use the minimax theorem to analyze rotating shared meals. On NHANES-derived data, the learned utility model achieves Recall@20 of 0.293, outperforming five learned recommenders (at most 0.244) but not a previous-day repetition heuristic (0.321). On held-out four-person households, Nash allocation reduces Gini disparity by 42% relative to conflict resolution while improving Recall@20 from 0.180 to 0.197. It comes within 2% of an upper bound on the smoothed Nash optimum, and rescaling one member's utilities changes at most 1.5% of assignments. All recommendations satisfy the encoded dietary rules, while attribution scores correlate with utility loss upon component removal (r = 0.76). In simulation, shared meals reduce pantry use by about one-third, and weekly rotation increases the worst-off member's utility by 38% over the best fixed meal.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2610.31506 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-25T20:47:56.937Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).