arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2606.06989cs.GT
收藏

菜单选择:一种最小化食物浪费的计算方法

Menu Selection: A Computational Approach to Minimizing Food Waste

UNSW Sydney, Australia(新南威尔士大学);Tulane University, USA(杜兰大学);Indian Statistical Institute, India(印度统计研究所)

Haris Aziz, Nicholas Mattei, Shivika Narang, Sanjukta Roy

AI总结:

提出一种集体决策问题,通过两种消费模型(乐观和悲观)选择最小规模菜单,确保所有代理获得足够食物并最小化浪费,给出有效菜单特征、多项式时间算法及悲观浪费比紧界。

摘要:

我们引入了一个新颖的集体决策问题,该问题捕捉了为满足多样化饮食偏好和需求而订购食物的普遍问题。我们的设置涉及具有不同饮食需求的代理,以及具有不同份量的菜单选项。目标是选择一个菜单,使得每个人都有足够的食物可以消费,并且食物浪费最小化。我们引入了两种不同的消费模型:乐观和悲观。乐观消费假设中央规划者可以最优地在代理之间分配订购的食物,以最大化获得足够食物的人数。悲观消费考虑当代理以任意顺序自己盛食物时,消费的最坏情况保证。在任一消费模型下,我们寻求最小规模的可行菜单(在该菜单下所有代理都得到充分喂养)。我们的工作提供了两组特征描述:(1)我们刻画了任一消费模型下的可行菜单;(2)我们刻画了允许多项式时间算法找到最小规模菜单的实例空间。我们的结果还帮助我们设计整数线性规划,以在一般设置中找到最小规模菜单。此外,我们针对重要的特例提出了多项式时间算法。然后,我们考虑最小规模乐观和悲观菜单大小之间的最坏情况差异。我们称之为悲观浪费,由最小规模悲观菜单与最小规模乐观菜单的大小之比表示。我们给出了该比值的紧上界。我们的结果还提供了关于寻找最小规模极大匹配问题的额外见解,这可能具有独立意义。

英文摘要:

We introduce a novel collective decision making problem that captures the ubiquitous issue of ordering food to cater for varied dietary preferences and requirements. Our settings involve agents with diverse dietary requirements over menu options with varied serving sizes. The goal is to select a menu where everyone has enough food they can consume and wastage of food is minimized. We introduce two different consumption models: optimistic and pessimistic. Optimistic consumption assumes a situation when a central planner can optimally allocate the food ordered among the agents to maximize the number of people who get enough to eat. Pessimistic considers the worst case guarantee on consumption when agents fill their own plates in an arbitrary order. Under either consumption model, we seek valid menus (under which all agents are sufficiently fed) of minimum size. Our work provides two sets of characterizations: (1) we characterize valid menus under either consumption model and (2) we characterize the space of instances that admit polynomial-time algorithms to find minimum sized menus. Our results also help us design Integer Linear Programs to find minimum sized menus in general settings. Furthermore, we present polynomial-time algorithms for important special cases. We then consider the worst case discrepancy between the size of minimum sized optimistic and pessimistic menus. We call this the waste of pessimism, captured by the ratio of the minimum sized pessimistic menu to that of the minimum sized optimistic menu. We show tight upper bounds on this ratio. Our results also provide additional insights on the problem of finding a minimum sized maximal matching, which may be of independent interest.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑