{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ILT4V3PEES5CLR5CCBILW4D6ES","short_pith_number":"pith:ILT4V3PE","schema_version":"1.0","canonical_sha256":"42e7caede424ba25c7a21050bb707e24a2b503bc12248e88cf0426f1056b9701","source":{"kind":"arxiv","id":"1104.3489","version":3},"attestation_state":"computed","paper":{"title":"Markov Decision Processes with Multiple Long-run Average Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anton\\'in Ku\\v{c}era (Faculty of Informatics, Krishnendu Chatterjee (IST Austria), Masaryk University), Oxford University), Tom\\'a\\v{s} Br\\'azdil (Faculty of Informatics, V\\'aclav Bro\\v{z}ek (Faculty of Informatics, Vojt\\v{e}ch Forejt (Department of Computer Science","submitted_at":"2011-04-18T14:12:46Z","abstract_excerpt":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with k limit-average functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the case of one limit-average function, both randomization and memory are nece"},"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":"1104.3489","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-18T14:12:46Z","cross_cats_sorted":[],"title_canon_sha256":"94a78db4c0bad6f9a0142b1bcd39d7e21340b6d70b03392872d3d67527c07f57","abstract_canon_sha256":"d3b29d4063c415b871f9be6ca138e2a9be507d1e2853ae4d85a4b2fee8814809"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.553435Z","signature_b64":"oYJyoOHf+YFxv86qRCclANjNJPtX65fTJtQROqtAHtdPIjU5nD8KNj+H7xGKVnYiqd5moceAJd5qOad94rsiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42e7caede424ba25c7a21050bb707e24a2b503bc12248e88cf0426f1056b9701","last_reissued_at":"2026-05-18T01:37:39.552842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.552842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov Decision Processes with Multiple Long-run Average Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anton\\'in Ku\\v{c}era (Faculty of Informatics, Krishnendu Chatterjee (IST Austria), Masaryk University), Oxford University), Tom\\'a\\v{s} Br\\'azdil (Faculty of Informatics, V\\'aclav Bro\\v{z}ek (Faculty of Informatics, Vojt\\v{e}ch Forejt (Department of Computer Science","submitted_at":"2011-04-18T14:12:46Z","abstract_excerpt":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with k limit-average functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the case of one limit-average function, both randomization and memory are nece"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3489","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1104.3489","created_at":"2026-05-18T01:37:39.552918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3489v3","created_at":"2026-05-18T01:37:39.552918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3489","created_at":"2026-05-18T01:37:39.552918+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILT4V3PEES5C","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILT4V3PEES5CLR5C","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILT4V3PE","created_at":"2026-05-18T12:26:32.869790+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/ILT4V3PEES5CLR5CCBILW4D6ES","json":"https://pith.science/pith/ILT4V3PEES5CLR5CCBILW4D6ES.json","graph_json":"https://pith.science/api/pith-number/ILT4V3PEES5CLR5CCBILW4D6ES/graph.json","events_json":"https://pith.science/api/pith-number/ILT4V3PEES5CLR5CCBILW4D6ES/events.json","paper":"https://pith.science/paper/ILT4V3PE"},"agent_actions":{"view_html":"https://pith.science/pith/ILT4V3PEES5CLR5CCBILW4D6ES","download_json":"https://pith.science/pith/ILT4V3PEES5CLR5CCBILW4D6ES.json","view_paper":"https://pith.science/paper/ILT4V3PE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3489&json=true","fetch_graph":"https://pith.science/api/pith-number/ILT4V3PEES5CLR5CCBILW4D6ES/graph.json","fetch_events":"https://pith.science/api/pith-number/ILT4V3PEES5CLR5CCBILW4D6ES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILT4V3PEES5CLR5CCBILW4D6ES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILT4V3PEES5CLR5CCBILW4D6ES/action/storage_attestation","attest_author":"https://pith.science/pith/ILT4V3PEES5CLR5CCBILW4D6ES/action/author_attestation","sign_citation":"https://pith.science/pith/ILT4V3PEES5CLR5CCBILW4D6ES/action/citation_signature","submit_replication":"https://pith.science/pith/ILT4V3PEES5CLR5CCBILW4D6ES/action/replication_record"}},"created_at":"2026-05-18T01:37:39.552918+00:00","updated_at":"2026-05-18T01:37:39.552918+00:00"}