{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EIROPEKGHX6ZBG33AVJ5SWOLUB","short_pith_number":"pith:EIROPEKG","schema_version":"1.0","canonical_sha256":"2222e791463dfd909b7b0553d959cba078153536433a53d533c78b63af7e8f40","source":{"kind":"arxiv","id":"2411.09517","version":1},"attestation_state":"computed","paper":{"title":"Randomized Truthful Auctions with Learning Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"Andres Perlroth, Anupam Gupta, Gagan Aggarwal, Grigoris Velegkas","submitted_at":"2024-11-14T15:28:40Z","abstract_excerpt":"We study a setting where agents use no-regret learning algorithms to participate in repeated auctions. \\citet{kolumbus2022auctions} showed, rather surprisingly, that when bidders participate in second-price auctions using no-regret bidding algorithms, no matter how large the number of interactions $T$ is, the runner-up bidder may not converge to bidding truthfully. Our first result shows that this holds for \\emph{general deterministic} truthful auctions. We also show that the ratio of the learning rates of the bidders can \\emph{qualitatively} affect the convergence of the bidders. Next, we con"},"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":"2411.09517","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-11-14T15:28:40Z","cross_cats_sorted":["cs.LG","econ.TH"],"title_canon_sha256":"826ae32a4c248fc3dc445ced7c66584ba4acc1a2aa125d0493365feb9fa80d7c","abstract_canon_sha256":"2a359bb8166573bf3c1e29a03920fe72d7342a719db1b83861a13803c0a1d93e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:28.069198Z","signature_b64":"k7UorxUhQOEzuawyFEuKslomJ42KnTz46kkzFLLG6axuXC7Dp/srWmqVpGdHrakmHwxGOMo9TInl6oGyBZUsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2222e791463dfd909b7b0553d959cba078153536433a53d533c78b63af7e8f40","last_reissued_at":"2026-07-05T09:35:28.068659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:28.068659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Truthful Auctions with Learning Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"Andres Perlroth, Anupam Gupta, Gagan Aggarwal, Grigoris Velegkas","submitted_at":"2024-11-14T15:28:40Z","abstract_excerpt":"We study a setting where agents use no-regret learning algorithms to participate in repeated auctions. \\citet{kolumbus2022auctions} showed, rather surprisingly, that when bidders participate in second-price auctions using no-regret bidding algorithms, no matter how large the number of interactions $T$ is, the runner-up bidder may not converge to bidding truthfully. Our first result shows that this holds for \\emph{general deterministic} truthful auctions. We also show that the ratio of the learning rates of the bidders can \\emph{qualitatively} affect the convergence of the bidders. Next, we con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09517","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/2411.09517/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":"2411.09517","created_at":"2026-07-05T09:35:28.068717+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.09517v1","created_at":"2026-07-05T09:35:28.068717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09517","created_at":"2026-07-05T09:35:28.068717+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIROPEKGHX6Z","created_at":"2026-07-05T09:35:28.068717+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIROPEKGHX6ZBG33","created_at":"2026-07-05T09:35:28.068717+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIROPEKG","created_at":"2026-07-05T09:35:28.068717+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.08597","citing_title":"Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EIROPEKGHX6ZBG33AVJ5SWOLUB","json":"https://pith.science/pith/EIROPEKGHX6ZBG33AVJ5SWOLUB.json","graph_json":"https://pith.science/api/pith-number/EIROPEKGHX6ZBG33AVJ5SWOLUB/graph.json","events_json":"https://pith.science/api/pith-number/EIROPEKGHX6ZBG33AVJ5SWOLUB/events.json","paper":"https://pith.science/paper/EIROPEKG"},"agent_actions":{"view_html":"https://pith.science/pith/EIROPEKGHX6ZBG33AVJ5SWOLUB","download_json":"https://pith.science/pith/EIROPEKGHX6ZBG33AVJ5SWOLUB.json","view_paper":"https://pith.science/paper/EIROPEKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.09517&json=true","fetch_graph":"https://pith.science/api/pith-number/EIROPEKGHX6ZBG33AVJ5SWOLUB/graph.json","fetch_events":"https://pith.science/api/pith-number/EIROPEKGHX6ZBG33AVJ5SWOLUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIROPEKGHX6ZBG33AVJ5SWOLUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIROPEKGHX6ZBG33AVJ5SWOLUB/action/storage_attestation","attest_author":"https://pith.science/pith/EIROPEKGHX6ZBG33AVJ5SWOLUB/action/author_attestation","sign_citation":"https://pith.science/pith/EIROPEKGHX6ZBG33AVJ5SWOLUB/action/citation_signature","submit_replication":"https://pith.science/pith/EIROPEKGHX6ZBG33AVJ5SWOLUB/action/replication_record"}},"created_at":"2026-07-05T09:35:28.068717+00:00","updated_at":"2026-07-05T09:35:28.068717+00:00"}