SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2305.13293 · ICLR · 2024

Time Fairness in Online Knapsack Problems

Mohammad Hajiesmaili, Bo Sun, Adam Lechowicz, Rik Sengupta, Shahin Kamali

arXiv · PDF · Open in the Atlas

Code that ran

3 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 2 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2305.13293.json · badge: /api/ran/2305.13293.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
adamlechowicz/fair-knapsack canonical (classifier label)
classifier basis: classifier_2025
3 ran · 2 no recorded run
FunctionStatusWhere it lives
LAECT Ran
ran; our contract draft was wrong, not the code
adamlechowicz/fair-knapsack/knapsack.py
pointer only (licence: NONE) · get_code("bbcdd0eec8fd623b")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, adamlechowicz/fair-knapsack when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

alphaLA Ran
ran, honoured the contract we drafted
adamlechowicz/fair-knapsack/knapsack.py
pointer only (licence: NONE) · get_code("57a20c9ec8883f16")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, adamlechowicz/fair-knapsack when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

dpOptimalKnapsack Ran
ran; our contract draft was wrong, not the code
adamlechowicz/fair-knapsack/knapsack.py
pointer only (licence: NONE) · get_code("6e0b5762a7da7ef4")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, adamlechowicz/fair-knapsack when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

ZCL Not yet run
unverified (harvested, no recorded run)
adamlechowicz/fair-knapsack/knapsack.py
pointer only (licence: NONE) · get_code("b8f5c3ee94370855")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, adamlechowicz/fair-knapsack when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

ZCLRandomized Not yet run
unverified (harvested, no recorded run)
adamlechowicz/fair-knapsack/knapsack.py
pointer only (licence: NONE) · get_code("835a41b0c1f19255")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, adamlechowicz/fair-knapsack when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 5 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

The online knapsack problem is a classic problem in the field of online algorithms. Its canonical version asks how to pack items of different values and weights arriving online into a capacity-limited knapsack so as to maximize the total value of the admitted items. Although optimal competitive algorithms are known for this problem, they may be fundamentally unfair, i.e., individual items may be treated inequitably in different ways. We formalize a practically-relevant notion of time fairness which effectively models a trade off between static and dynamic pricing in a motivating application such as cloud resource allocation, and show that existing algorithms perform poorly under this metric. We propose a parameterized deterministic algorithm where the parameter precisely captures the Pareto-optimal trade-off between fairness (static pricing) and competitiveness (dynamic pricing). We show that randomization is theoretically powerful enough to be simultaneously competitive and fair; however, it does not work well in experiments. To further improve the trade-off between fairness and competitiveness, we develop a nearly-optimal learning-augmented algorithm which is fair, consistent, and robust (competitive), showing substantial performance improvements in numerical experiments.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2305.13293")
get_code_for_paper("2305.13293")
have("2305.13293")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2305.13293.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2305.13293.svg)](https://syntology.ai/paper/2305.13293)

Connect an agent — have() is free.