{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TG7M4PSFFN66YT3DTAPYZT5I2M","short_pith_number":"pith:TG7M4PSF","schema_version":"1.0","canonical_sha256":"99bece3e452b7dec4f63981f8ccfa8d323c8af91a075968ef951a1607039175e","source":{"kind":"arxiv","id":"2404.03314","version":1},"attestation_state":"computed","paper":{"title":"Learning to Bid in Forward Electricity Markets Using a No-Regret Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.GT","authors_text":"Arega Getaneh Abate, Dorsa Majdi, Jalal Kazempour, Maryam Kamgarpour","submitted_at":"2024-04-04T09:23:02Z","abstract_excerpt":"It is a common practice in the current literature of electricity markets to use game-theoretic approaches for strategic price bidding. However, they generally rely on the assumption that the strategic bidders have prior knowledge of rival bids, either perfectly or with some uncertainty. This is not necessarily a realistic assumption. This paper takes a different approach by relaxing such an assumption and exploits a no-regret learning algorithm for repeated games. In particular, by using the \\emph{a posteriori} information about rivals' bids, a learner can implement a no-regret algorithm to op"},"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":"2404.03314","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-04-04T09:23:02Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"983ef6567ad0d6f9d6471da15328a21ac2f88e760ec794ed456d76f710c2499c","abstract_canon_sha256":"5a9a883ac5ea8332d2b19872174fb9168230695b03b0f5aaa54779776f3c1ae0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:24.018226Z","signature_b64":"AMji0KO0+CYqr6odIKSITXVGnHiMcmVG0Rrob2KUSfoN1TbhFGzI2tAfQK3OPVZOY5RAGVTpcoh1EuGsE/nmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99bece3e452b7dec4f63981f8ccfa8d323c8af91a075968ef951a1607039175e","last_reissued_at":"2026-07-05T08:04:24.017781Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:24.017781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Bid in Forward Electricity Markets Using a No-Regret Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.GT","authors_text":"Arega Getaneh Abate, Dorsa Majdi, Jalal Kazempour, Maryam Kamgarpour","submitted_at":"2024-04-04T09:23:02Z","abstract_excerpt":"It is a common practice in the current literature of electricity markets to use game-theoretic approaches for strategic price bidding. However, they generally rely on the assumption that the strategic bidders have prior knowledge of rival bids, either perfectly or with some uncertainty. This is not necessarily a realistic assumption. This paper takes a different approach by relaxing such an assumption and exploits a no-regret learning algorithm for repeated games. In particular, by using the \\emph{a posteriori} information about rivals' bids, a learner can implement a no-regret algorithm to op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03314","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/2404.03314/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":"2404.03314","created_at":"2026-07-05T08:04:24.017840+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.03314v1","created_at":"2026-07-05T08:04:24.017840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03314","created_at":"2026-07-05T08:04:24.017840+00:00"},{"alias_kind":"pith_short_12","alias_value":"TG7M4PSFFN66","created_at":"2026-07-05T08:04:24.017840+00:00"},{"alias_kind":"pith_short_16","alias_value":"TG7M4PSFFN66YT3D","created_at":"2026-07-05T08:04:24.017840+00:00"},{"alias_kind":"pith_short_8","alias_value":"TG7M4PSF","created_at":"2026-07-05T08:04:24.017840+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/TG7M4PSFFN66YT3DTAPYZT5I2M","json":"https://pith.science/pith/TG7M4PSFFN66YT3DTAPYZT5I2M.json","graph_json":"https://pith.science/api/pith-number/TG7M4PSFFN66YT3DTAPYZT5I2M/graph.json","events_json":"https://pith.science/api/pith-number/TG7M4PSFFN66YT3DTAPYZT5I2M/events.json","paper":"https://pith.science/paper/TG7M4PSF"},"agent_actions":{"view_html":"https://pith.science/pith/TG7M4PSFFN66YT3DTAPYZT5I2M","download_json":"https://pith.science/pith/TG7M4PSFFN66YT3DTAPYZT5I2M.json","view_paper":"https://pith.science/paper/TG7M4PSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.03314&json=true","fetch_graph":"https://pith.science/api/pith-number/TG7M4PSFFN66YT3DTAPYZT5I2M/graph.json","fetch_events":"https://pith.science/api/pith-number/TG7M4PSFFN66YT3DTAPYZT5I2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TG7M4PSFFN66YT3DTAPYZT5I2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TG7M4PSFFN66YT3DTAPYZT5I2M/action/storage_attestation","attest_author":"https://pith.science/pith/TG7M4PSFFN66YT3DTAPYZT5I2M/action/author_attestation","sign_citation":"https://pith.science/pith/TG7M4PSFFN66YT3DTAPYZT5I2M/action/citation_signature","submit_replication":"https://pith.science/pith/TG7M4PSFFN66YT3DTAPYZT5I2M/action/replication_record"}},"created_at":"2026-07-05T08:04:24.017840+00:00","updated_at":"2026-07-05T08:04:24.017840+00:00"}