logbook.json

{
  "schema_version": 2,
  "title": "Reproduction: Online Social Welfare Function-based Resource Allocation",
  "emoji": "🎯",
  "space_id": "Yashp2003/qSNU4NmDpE",
  "paper": {
    "arxiv_id": "2602.01400"
  },
  "tags": [
    "icml2026-repro",
    "paper-qSNU4NmDpE"
  ],
  "updated_at": "2026-07-22T13:54:30+00:00",
  "root": {
    "slug": "index",
    "title": "Reproduction: Online Social Welfare Function-based Resource Allocation",
    "file": "pages/index.md",
    "children": [
      {
        "slug": "executive-summary",
        "title": "Executive summary",
        "file": "pages/executive-summary/page.md",
        "children": []
      },
      {
        "slug": "claim-1-theorem-4-1-shows-that-monotonicity-of-the-social-welfare-function-alone-suffices-to-lift-coordinate-wise-anytime-valid-confidence-sequences-on-individual-utilities-into-a-valid-confidence-sequence-for-the-optimal-social-welfare-m-mu-p-theorem-4-1",
        "title": "Claim 1: Theorem 4.1 shows that monotonicity of the social welfare function alone suffices to lift coordinate-wise anytime-valid confidence sequences on individual utilities into a valid confidence sequence for the optimal social welfare M(mu ⊙ p*) (Theorem 4.1).",
        "file": "pages/claim-1-theorem-4-1-shows-that-monotonicity-of-the-social-welfare-function-alone-suffices-to-lift-coordinate-wise-anytime-valid-confidence-sequences-on-individual-utilities-into-a-valid-confidence-sequence-for-the-optimal-social-welfare-m-mu-p-theorem-4-1/page.md",
        "children": []
      },
      {
        "slug": "claim-2-theorem-5-2-establishes-that-swf-ucb-attains-regret-r-t-o-l-n-sqrt-nkt-with-probability-1-delta-up-to-polylog-log-log-t-and-log-2n-delta-factors-matching-lower-bounds-up-to-polylogarithmic-terms-theorem-5-2",
        "title": "Claim 2: Theorem 5.2 establishes that SWF-UCB attains regret R(T) = O(L(n + sqrt(nkT))) with probability 1-delta (up to polylog log log T and log(2n/delta) factors), matching lower bounds up to polylogarithmic terms (Theorem 5.2).",
        "file": "pages/claim-2-theorem-5-2-establishes-that-swf-ucb-attains-regret-r-t-o-l-n-sqrt-nkt-with-probability-1-delta-up-to-polylog-log-log-t-and-log-2n-delta-factors-matching-lower-bounds-up-to-polylogarithmic-terms-theorem-5-2/page.md",
        "children": []
      },
      {
        "slug": "claim-3-theorem-5-1-provides-efficient-policy-oracles-per-swf-family-an-o-n-log-n-water-filling-solution-for-the-weighted-power-mean-and-kolm-families-and-an-o-kn-greedy-block-algorithm-for-the-gini-family-theorem-5-1",
        "title": "Claim 3: Theorem 5.1 provides efficient policy oracles per SWF family: an O(n log n) water-filling solution for the Weighted Power Mean and Kolm families, and an O(kn) greedy block algorithm for the Gini family (Theorem 5.1).",
        "file": "pages/claim-3-theorem-5-1-provides-efficient-policy-oracles-per-swf-family-an-o-n-log-n-water-filling-solution-for-the-weighted-power-mean-and-kolm-families-and-an-o-kn-greedy-block-algorithm-for-the-gini-family-theorem-5-1/page.md",
        "children": []
      },
      {
        "slug": "claim-4-experiments-across-the-weighted-power-mean-kolm-and-gini-social-welfare-families-show-consistent-sqrt-t-regret-scaling-but-regret-depends-non-monotonically-on-the-resource-budget-k-peaking-at-intermediate-k-values-section-6",
        "title": "Claim 4: Experiments across the Weighted Power Mean, Kolm, and Gini social welfare families show consistent sqrt(T) regret scaling, but regret depends non-monotonically on the resource budget k, peaking at intermediate k values (Section 6).",
        "file": "pages/claim-4-experiments-across-the-weighted-power-mean-kolm-and-gini-social-welfare-families-show-consistent-sqrt-t-regret-scaling-but-regret-depends-non-monotonically-on-the-resource-budget-k-peaking-at-intermediate-k-values-section-6/page.md",
        "children": []
      },
      {
        "slug": "claim-5-allocation-feasibility-under-the-cardinality-constraint-s-t-k-is-enforced-via-dependent-rounding-that-preserves-the-marginal-selection-probabilities-p-i-in-s-t-p-t-i-section-5",
        "title": "Claim 5: Allocation feasibility under the cardinality constraint |S_t|=k is enforced via dependent rounding that preserves the marginal selection probabilities P(i in S_t) = p_{t,i} (Section 5).",
        "file": "pages/claim-5-allocation-feasibility-under-the-cardinality-constraint-s-t-k-is-enforced-via-dependent-rounding-that-preserves-the-marginal-selection-probabilities-p-i-in-s-t-p-t-i-section-5/page.md",
        "children": []
      },
      {
        "slug": "conclusion",
        "title": "Conclusion",
        "file": "pages/conclusion/page.md",
        "children": []
      }
    ]
  },
  "traces": [],
  "workspace": {
    "file": "workspace.json",
    "file_count": 0,
    "total_size": 0,
    "bucket_id": null
  },
  "agent_view_tokens": 5416,
  "trace_view_tokens": 10,
  "workspace_view_tokens": 14,
  "revision": "03fd8031991ad97f3c3a",
  "workspace_ref": {
    "repo_id": "Yashp2003/qSNU4NmDpE-artifacts",
    "repo_type": "bucket",
    "repo_url": "https://huggingface.co/buckets/Yashp2003/qSNU4NmDpE-artifacts",
    "private": true
  },
  "workspace_bucket": "https://huggingface.co/buckets/Yashp2003/qSNU4NmDpE-artifacts"
}