Operations research and optimization

Online paging is a fundamental problem in the field of online algorithms, in which one maintains a cache of 𝑘 slots as requests for fetching pages arrive online. In the weighted variant of this problem, each page has its own fetching cost; a substantial line of work on this problem culminated in an (optimal) 𝑂(log 𝑘)-competitive randomized algorithm, due to Bansal, Buchbinder and Naor (FOCS’07). Existing

Large language models (LLMs) offer substantial potential for automating labeling tasks, showcasing robust zero-shot performance across diverse classification tasks. The LLM-generated reasons that accompany these classifications contain signals about the quality of the classifications. Estimates of quality of these reasons can, in essence, be used to detect potentially incorrect predictions. Conventional

Large Language Models (LLMs) have been employed as crowd-sourced annotators to alleviate the burden of human labeling. However, the broader adoption of LLM-based automated labeling systems encounters two main challenges: 1) LLMs are prone to producing unexpected and unreliable predictions, and 2) no single LLM excels at all labeling tasks. To address these challenges, we first develop fast and effective

Qualitative sampling in the age of Big Data requires tactful negotiation. Although qualitative research aims to explore the depth as opposed to breadth of experiences, opinions, or beliefs of individuals regarding a unique phenomenon, stakeholders or sponsors might not always be convinced that small sample sizes can yield big results. Intimate population awareness, identification of attributes of importance

Consensus planning is a method for coordinating decision making across complex systems and organizations, including complex supply chain optimization pipelines. It arises when large interdependent distributed agents (systems) share common resources and must act in order to achieve a joint goal. In this paper, we introduce a generic Consensus Planning Protocol (CPP) to solve such problems. Our protocol allows