{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VLACUMCBEVJE3PKADSXHCC4OUP","short_pith_number":"pith:VLACUMCB","schema_version":"1.0","canonical_sha256":"aac02a304125524dbd401cae710b8ea3f73767f5a2b233789ac769507db10a48","source":{"kind":"arxiv","id":"2009.06136","version":1},"attestation_state":"computed","paper":{"title":"Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Abhishek Sethi, Aranyak Mehta, Christopher Liaw, Guru Guruganesh, Zhe Feng","submitted_at":"2020-09-14T01:32:29Z","abstract_excerpt":"The connection between games and no-regret algorithms has been widely studied in the literature. A fundamental result is that when all players play no-regret strategies, this produces a sequence of actions whose time-average is a coarse-correlated equilibrium of the game. However, much less is known about equilibrium selection in the case that multiple equilibria exist.\n  In this work, we study the convergence of no-regret bidding algorithms in auctions. Besides being of theoretical interest, bidding dynamics in auctions is an important question from a practical viewpoint as well. We study rep"},"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":"2009.06136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-09-14T01:32:29Z","cross_cats_sorted":[],"title_canon_sha256":"fbe910d18fbaaedfdc429ff83e984bc809a889670608f9f96d53f2027cfc9271","abstract_canon_sha256":"e782068ee12814cb80f3292fc68d81602bbe246b6f7b4aeec46a23f2a1599a17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:35:05.086840Z","signature_b64":"Js/0zhcCDybjFpGTKh08STy8JmZ9fE99DtrA0h+J36hklqyIO3tJpIMtvpC8xJAvwE252EShZlMtHQI1OEhyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac02a304125524dbd401cae710b8ea3f73767f5a2b233789ac769507db10a48","last_reissued_at":"2026-07-05T01:35:05.086420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:35:05.086420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Abhishek Sethi, Aranyak Mehta, Christopher Liaw, Guru Guruganesh, Zhe Feng","submitted_at":"2020-09-14T01:32:29Z","abstract_excerpt":"The connection between games and no-regret algorithms has been widely studied in the literature. A fundamental result is that when all players play no-regret strategies, this produces a sequence of actions whose time-average is a coarse-correlated equilibrium of the game. However, much less is known about equilibrium selection in the case that multiple equilibria exist.\n  In this work, we study the convergence of no-regret bidding algorithms in auctions. Besides being of theoretical interest, bidding dynamics in auctions is an important question from a practical viewpoint as well. We study rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06136","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/2009.06136/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":"2009.06136","created_at":"2026-07-05T01:35:05.086475+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.06136v1","created_at":"2026-07-05T01:35:05.086475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06136","created_at":"2026-07-05T01:35:05.086475+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLACUMCBEVJE","created_at":"2026-07-05T01:35:05.086475+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLACUMCBEVJE3PKA","created_at":"2026-07-05T01:35:05.086475+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLACUMCB","created_at":"2026-07-05T01:35:05.086475+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":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VLACUMCBEVJE3PKADSXHCC4OUP","json":"https://pith.science/pith/VLACUMCBEVJE3PKADSXHCC4OUP.json","graph_json":"https://pith.science/api/pith-number/VLACUMCBEVJE3PKADSXHCC4OUP/graph.json","events_json":"https://pith.science/api/pith-number/VLACUMCBEVJE3PKADSXHCC4OUP/events.json","paper":"https://pith.science/paper/VLACUMCB"},"agent_actions":{"view_html":"https://pith.science/pith/VLACUMCBEVJE3PKADSXHCC4OUP","download_json":"https://pith.science/pith/VLACUMCBEVJE3PKADSXHCC4OUP.json","view_paper":"https://pith.science/paper/VLACUMCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.06136&json=true","fetch_graph":"https://pith.science/api/pith-number/VLACUMCBEVJE3PKADSXHCC4OUP/graph.json","fetch_events":"https://pith.science/api/pith-number/VLACUMCBEVJE3PKADSXHCC4OUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLACUMCBEVJE3PKADSXHCC4OUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLACUMCBEVJE3PKADSXHCC4OUP/action/storage_attestation","attest_author":"https://pith.science/pith/VLACUMCBEVJE3PKADSXHCC4OUP/action/author_attestation","sign_citation":"https://pith.science/pith/VLACUMCBEVJE3PKADSXHCC4OUP/action/citation_signature","submit_replication":"https://pith.science/pith/VLACUMCBEVJE3PKADSXHCC4OUP/action/replication_record"}},"created_at":"2026-07-05T01:35:05.086475+00:00","updated_at":"2026-07-05T01:35:05.086475+00:00"}