{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BQY4LQ6ZZWBHXFRK2CVF7W4ZZK","short_pith_number":"pith:BQY4LQ6Z","schema_version":"1.0","canonical_sha256":"0c31c5c3d9cd827b962ad0aa5fdb99ca9bba648c6e5c374c2c35be9942103764","source":{"kind":"arxiv","id":"2509.22563","version":1},"attestation_state":"computed","paper":{"title":"Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Chris Schwiegelshohn, Federico Fusco, Paul D\\\"utting, Simone Di Gregorio","submitted_at":"2025-09-26T16:42:05Z","abstract_excerpt":"Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. We study this problem from the perspective of a broker, in a regret minimization framework. At each time step, a new seller and buyer arrive, and the broker has to propose a mechanism that is incentive-compatible and individually rational, with the goal of maximizing profit.\n  We propose a learning algorithm that guarantees a nearly tight $\\tilde{O}(\\sqrt{T})$ regret in the stochastic setting when seller and buyer valuations are d"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.22563","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-09-26T16:42:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7dce52c7b1609b62646963b224de21a1fd2423ec63d8a58995dc907f90d36984","abstract_canon_sha256":"e43e1a94fce03bf1aef946d3753217e471247cded53243a6d20ac5a3cd5d080e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T02:21:21.898963Z","signature_b64":"C+2XEX5zkCcJIU9QqzM8o8G/VVJd26ZJwDhEGMRUlqVSaSUEdW+LhpiFEBfGI0O9nC61t26NELMnRZXREgsrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c31c5c3d9cd827b962ad0aa5fdb99ca9bba648c6e5c374c2c35be9942103764","last_reissued_at":"2026-07-21T02:21:21.898107Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T02:21:21.898107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Chris Schwiegelshohn, Federico Fusco, Paul D\\\"utting, Simone Di Gregorio","submitted_at":"2025-09-26T16:42:05Z","abstract_excerpt":"Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. We study this problem from the perspective of a broker, in a regret minimization framework. At each time step, a new seller and buyer arrive, and the broker has to propose a mechanism that is incentive-compatible and individually rational, with the goal of maximizing profit.\n  We propose a learning algorithm that guarantees a nearly tight $\\tilde{O}(\\sqrt{T})$ regret in the stochastic setting when seller and buyer valuations are d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.22563","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.22563/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"2509.22563","created_at":"2026-07-21T02:21:21.898550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.22563v1","created_at":"2026-07-21T02:21:21.898550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.22563","created_at":"2026-07-21T02:21:21.898550+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQY4LQ6ZZWBH","created_at":"2026-07-21T02:21:21.898550+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQY4LQ6ZZWBHXFRK","created_at":"2026-07-21T02:21:21.898550+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQY4LQ6Z","created_at":"2026-07-21T02:21:21.898550+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK","json":"https://pith.science/pith/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK.json","graph_json":"https://pith.science/api/pith-number/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK/graph.json","events_json":"https://pith.science/api/pith-number/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK/events.json","paper":"https://pith.science/paper/BQY4LQ6Z"},"agent_actions":{"view_html":"https://pith.science/pith/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK","download_json":"https://pith.science/pith/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK.json","view_paper":"https://pith.science/paper/BQY4LQ6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.22563&json=true","fetch_graph":"https://pith.science/api/pith-number/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK/graph.json","fetch_events":"https://pith.science/api/pith-number/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK/action/storage_attestation","attest_author":"https://pith.science/pith/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK/action/author_attestation","sign_citation":"https://pith.science/pith/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK/action/citation_signature","submit_replication":"https://pith.science/pith/BQY4LQ6ZZWBHXFRK2CVF7W4ZZK/action/replication_record"}},"created_at":"2026-07-21T02:21:21.898550+00:00","updated_at":"2026-07-21T02:21:21.898550+00:00"}