Pith Number

pith:CRWCBII7

pith:2026:CRWCBII774PHAVZQYIPVBINHHU

not attested not anchored not stored refs resolved

Profit Maximization in Bilateral Trade against a Smooth Adversary

Chris Schwiegelshohn, Federico Fusco, Paul D\"utting, Simone Di Gregorio

A broker can achieve near-optimal regret in bilateral trade when valuations follow a smooth adversary.

arxiv:2605.12664 v1 · 2026-05-12 · cs.GT · cs.LG

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{CRWCBII774PHAVZQYIPVBINHHU}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We devise a learning algorithm that guarantees a Õ(√T) regret bound, which is tight in the time horizon T up to poly-logarithmic factors. This matches the minimax rate for the stochastic i.i.d. case, and is also well separated from the adversarial setting, where sublinear-regret is unattainable.

C2weakest assumption

The valuations are generated by a smooth adversary, which allows leveraging a continuity property of smooth instances combined with hierarchical net-construction of the broker's action space analyzed via algorithmic chaining.

C3one line summary

A learning algorithm achieves tight Õ(√T) regret for profit maximization in bilateral trade against smooth adversaries, matching stochastic rates via continuity and algorithmic chaining.

References

86 extracted · 86 resolved · 0 Pith anchors

[1] Counterspeculation, auctions, and competitive sealed tenders , author=. J. Finance , volume=

[2] The gains from trade under fixed price mechanisms , author=. Appl. Econ. Res. Bull. , volume=

[3] Adam Block and Yuval Dagan and Alexander Rakhlin , title =

[4] 1981 , journal = 1981

[5] 1983 , author = 1983

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-18T03:09:50.384462Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

146c20a11fff1e705730c21f50a1a73d16771609892699ce78039db2df0e985b

Aliases

arxiv: 2605.12664 · arxiv_version: 2605.12664v1 · doi: 10.48550/arxiv.2605.12664 · pith_short_12: CRWCBII774PH · pith_short_16: CRWCBII774PHAVZQ · pith_short_8: CRWCBII7

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 146c20a11fff1e705730c21f50a1a73d16771609892699ce78039db2df0e985b

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "d36ff1c22fa242304d39c33d506a67e475529f7a273d400d847820d4ee0f41e4",
    "cross_cats_sorted": [
      "cs.LG"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.GT",
    "submitted_at": "2026-05-12T19:12:57Z",
    "title_canon_sha256": "08f532fc15233ec8e14828a0cdb131c2c5c46ab115e110303c316b09a16f4d79"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.12664",
    "kind": "arxiv",
    "version": 1
  }
}