{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CRWCBII774PHAVZQYIPVBINHHU","short_pith_number":"pith:CRWCBII7","schema_version":"1.0","canonical_sha256":"146c20a11fff1e705730c21f50a1a73d16771609892699ce78039db2df0e985b","source":{"kind":"arxiv","id":"2605.12664","version":1},"attestation_state":"computed","paper":{"title":"Profit Maximization in Bilateral Trade against a Smooth Adversary","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A broker can achieve near-optimal regret in bilateral trade when valuations follow a smooth adversary.","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Chris Schwiegelshohn, Federico Fusco, Paul D\\\"utting, Simone Di Gregorio","submitted_at":"2026-05-12T19:12:57Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.12664","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-12T19:12:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"08f532fc15233ec8e14828a0cdb131c2c5c46ab115e110303c316b09a16f4d79","abstract_canon_sha256":"d36ff1c22fa242304d39c33d506a67e475529f7a273d400d847820d4ee0f41e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:50.385350Z","signature_b64":"03dbVaxgJk8jNQEMGwYEFjyINo/klAMW2nmYUyj9z8nQ1B3BXKX0VF5TDaGXcU7jfedE9f3iQkX6zoHiBsg7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"146c20a11fff1e705730c21f50a1a73d16771609892699ce78039db2df0e985b","last_reissued_at":"2026-05-18T03:09:50.384462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:50.384462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Profit Maximization in Bilateral Trade against a Smooth Adversary","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A broker can achieve near-optimal regret in bilateral trade when valuations follow a smooth adversary.","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Chris Schwiegelshohn, Federico Fusco, Paul D\\\"utting, Simone Di Gregorio","submitted_at":"2026-05-12T19:12:57Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A broker can achieve near-optimal regret in bilateral trade when valuations follow a smooth adversary.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1717447886a50f32bb88d8e1a97e82b5eeb6b5799de2527f0d644fab3cb58be8"},"source":{"id":"2605.12664","kind":"arxiv","version":1},"verdict":{"id":"fe2900f4-28c2-49df-b27e-733126283180","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:12:23.136127Z","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.","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","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.","pith_extraction_headline":"A broker can achieve near-optimal regret in bilateral trade when valuations follow a smooth adversary."},"references":{"count":86,"sample":[{"doi":"","year":null,"title":"Counterspeculation, auctions, and competitive sealed tenders , author=. J. Finance , volume=","work_id":"54c9729c-c9e9-4258-81b0-aaed727d13c6","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The gains from trade under fixed price mechanisms , author=. Appl. Econ. Res. Bull. , volume=","work_id":"9b120ce8-d3d0-466a-8b58-379b8679dd09","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Adam Block and Yuval Dagan and Alexander Rakhlin , title =","work_id":"d9c68b37-898d-416c-891f-2677f01c5073","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1981,"title":"1981 , journal =","work_id":"0006ed30-c397-464a-933c-9743e4e4ca00","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1983,"title":"1983 , author =","work_id":"ef16189f-233a-49d1-bb75-f8c666d46d37","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":86,"snapshot_sha256":"2adca663b33ef2787162d18cf610eb034d5f06bf11ff4e12a64afc151ae99cf4","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"1e52e39079492c50c7f5709b10e58b8056f898417415e282f8c4e6a581a073f5"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.12664","created_at":"2026-05-18T03:09:50.384603+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12664v1","created_at":"2026-05-18T03:09:50.384603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12664","created_at":"2026-05-18T03:09:50.384603+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRWCBII774PH","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRWCBII774PHAVZQ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRWCBII7","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU","json":"https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU.json","graph_json":"https://pith.science/api/pith-number/CRWCBII774PHAVZQYIPVBINHHU/graph.json","events_json":"https://pith.science/api/pith-number/CRWCBII774PHAVZQYIPVBINHHU/events.json","paper":"https://pith.science/paper/CRWCBII7"},"agent_actions":{"view_html":"https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU","download_json":"https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU.json","view_paper":"https://pith.science/paper/CRWCBII7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12664&json=true","fetch_graph":"https://pith.science/api/pith-number/CRWCBII774PHAVZQYIPVBINHHU/graph.json","fetch_events":"https://pith.science/api/pith-number/CRWCBII774PHAVZQYIPVBINHHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU/action/storage_attestation","attest_author":"https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU/action/author_attestation","sign_citation":"https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU/action/citation_signature","submit_replication":"https://pith.science/pith/CRWCBII774PHAVZQYIPVBINHHU/action/replication_record"}},"created_at":"2026-05-18T03:09:50.384603+00:00","updated_at":"2026-05-18T03:09:50.384603+00:00"}