{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CRWCBII774PHAVZQYIPVBINHHU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12664","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12664v1","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12664","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"CRWCBII774PH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"CRWCBII774PHAVZQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"CRWCBII7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:bb0e938149675fd40f75a25e9a2e4c2610f2cd677f49f240a6272a78d57ea612","target":"graph","created_at":"2026-05-18T03:09:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A learning algorithm achieves tight Õ(√T) regret for profit maximization in bilateral trade against smooth adversaries, matching stochastic rates via continuity and algorithmic chaining."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A broker can achieve near-optimal regret in bilateral trade when valuations follow a smooth adversary."}],"snapshot_sha256":"1717447886a50f32bb88d8e1a97e82b5eeb6b5799de2527f0d644fab3cb58be8"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1e52e39079492c50c7f5709b10e58b8056f898417415e282f8c4e6a581a073f5"},"paper":{"abstract_excerpt":"Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, who wish to trade a good. We study this problem from the perspective of a profit-maximizing broker within an online learning framework, where the agents' valuations are generated by a smooth adversary.\n  We devise a learning algorithm that guarantees a $\\tilde{O}(\\sqrt{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-reg","authors_text":"Chris Schwiegelshohn, Federico Fusco, Paul D\\\"utting, Simone Di Gregorio","cross_cats":["cs.LG"],"headline":"A broker can achieve near-optimal regret in bilateral trade when valuations follow a smooth adversary.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-12T19:12:57Z","title":"Profit Maximization in Bilateral Trade against a Smooth Adversary"},"references":{"count":86,"internal_anchors":0,"resolved_work":86,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Counterspeculation, auctions, and competitive sealed tenders , author=. J. Finance , volume=","work_id":"54c9729c-c9e9-4258-81b0-aaed727d13c6","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"The gains from trade under fixed price mechanisms , author=. Appl. Econ. Res. Bull. , volume=","work_id":"9b120ce8-d3d0-466a-8b58-379b8679dd09","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Adam Block and Yuval Dagan and Alexander Rakhlin , title =","work_id":"d9c68b37-898d-416c-891f-2677f01c5073","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"1981 , journal =","work_id":"0006ed30-c397-464a-933c-9743e4e4ca00","year":1981},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"1983 , author =","work_id":"ef16189f-233a-49d1-bb75-f8c666d46d37","year":1983}],"snapshot_sha256":"2adca663b33ef2787162d18cf610eb034d5f06bf11ff4e12a64afc151ae99cf4"},"source":{"id":"2605.12664","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:12:23.136127Z","id":"fe2900f4-28c2-49df-b27e-733126283180","model_set":{"reader":"grok-4.3"},"one_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.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A broker can achieve near-optimal regret in bilateral trade when valuations follow a smooth adversary.","strongest_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.","weakest_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."}},"verdict_id":"fe2900f4-28c2-49df-b27e-733126283180"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:113dff67c73a84d537ba8cff15a32f4671bce054750db69ac502244e2220a588","target":"record","created_at":"2026-05-18T03:09:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"146c20a11fff1e705730c21f50a1a73d16771609892699ce78039db2df0e985b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"146c20a11fff1e705730c21f50a1a73d16771609892699ce78039db2df0e985b","first_computed_at":"2026-05-18T03:09:50.384462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:50.384462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03dbVaxgJk8jNQEMGwYEFjyINo/klAMW2nmYUyj9z8nQ1B3BXKX0VF5TDaGXcU7jfedE9f3iQkX6zoHiBsg7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:50.385350Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:113dff67c73a84d537ba8cff15a32f4671bce054750db69ac502244e2220a588","sha256:bb0e938149675fd40f75a25e9a2e4c2610f2cd677f49f240a6272a78d57ea612"],"state_sha256":"520a2e0c2f9cc2c3f44a46e1187ba6bf13a8c22f633c099d37d6a45683bfaaba"}