{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MASJ5C7NEI6ODQ6SDGZDG637BY","short_pith_number":"pith:MASJ5C7N","schema_version":"1.0","canonical_sha256":"60249e8bed223ce1c3d219b2337b7f0e1c92e8ac443b06f5966276680370d631","source":{"kind":"arxiv","id":"1701.08514","version":1},"attestation_state":"computed","paper":{"title":"A set optimization approach to zero-sum matrix games with multi-dimensional payoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas H. Hamel, Andreas Loehne","submitted_at":"2017-01-30T08:51:35Z","abstract_excerpt":"A new solution concept for two-player zero-sum matrix games with multi-dimensional payoff is introduced. It is based on extensions of vector orders in K-dimensional spaces to order relations in their power sets, so-called set relations, and strictly motivated by the interpretation of the payoff as multi-dimensional loss for one and gain for the other player. The new concept provides coherent worst case estimates, i.e. minimax and maximin strategies, for games with multi-dimensional payoffs. It is shown that-in contrast to games with one-dimensional payoff-minimax and maximin strategies are ind"},"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":"1701.08514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-30T08:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"f25216b2c1e9c7ac23488e37a1686a26514d9052ffdd71f96d710db3138c5ac4","abstract_canon_sha256":"f798b284196c185184e3f25df81ba404d519c7396ba7549ea8bf513745f65eb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:53.865890Z","signature_b64":"gub/B+dGApC88j4ctSm0ng0/PdsDlme86YS4hnhEO2eVDfK5+0fPtSYg/RL41PGhRNe8IwtMgmPtTZLrb2l/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60249e8bed223ce1c3d219b2337b7f0e1c92e8ac443b06f5966276680370d631","last_reissued_at":"2026-05-18T00:51:53.865101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:53.865101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A set optimization approach to zero-sum matrix games with multi-dimensional payoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas H. Hamel, Andreas Loehne","submitted_at":"2017-01-30T08:51:35Z","abstract_excerpt":"A new solution concept for two-player zero-sum matrix games with multi-dimensional payoff is introduced. It is based on extensions of vector orders in K-dimensional spaces to order relations in their power sets, so-called set relations, and strictly motivated by the interpretation of the payoff as multi-dimensional loss for one and gain for the other player. The new concept provides coherent worst case estimates, i.e. minimax and maximin strategies, for games with multi-dimensional payoffs. It is shown that-in contrast to games with one-dimensional payoff-minimax and maximin strategies are ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08514","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":""},"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":"1701.08514","created_at":"2026-05-18T00:51:53.865248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08514v1","created_at":"2026-05-18T00:51:53.865248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08514","created_at":"2026-05-18T00:51:53.865248+00:00"},{"alias_kind":"pith_short_12","alias_value":"MASJ5C7NEI6O","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MASJ5C7NEI6ODQ6S","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MASJ5C7N","created_at":"2026-05-18T12:31:31.346846+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/MASJ5C7NEI6ODQ6SDGZDG637BY","json":"https://pith.science/pith/MASJ5C7NEI6ODQ6SDGZDG637BY.json","graph_json":"https://pith.science/api/pith-number/MASJ5C7NEI6ODQ6SDGZDG637BY/graph.json","events_json":"https://pith.science/api/pith-number/MASJ5C7NEI6ODQ6SDGZDG637BY/events.json","paper":"https://pith.science/paper/MASJ5C7N"},"agent_actions":{"view_html":"https://pith.science/pith/MASJ5C7NEI6ODQ6SDGZDG637BY","download_json":"https://pith.science/pith/MASJ5C7NEI6ODQ6SDGZDG637BY.json","view_paper":"https://pith.science/paper/MASJ5C7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08514&json=true","fetch_graph":"https://pith.science/api/pith-number/MASJ5C7NEI6ODQ6SDGZDG637BY/graph.json","fetch_events":"https://pith.science/api/pith-number/MASJ5C7NEI6ODQ6SDGZDG637BY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MASJ5C7NEI6ODQ6SDGZDG637BY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MASJ5C7NEI6ODQ6SDGZDG637BY/action/storage_attestation","attest_author":"https://pith.science/pith/MASJ5C7NEI6ODQ6SDGZDG637BY/action/author_attestation","sign_citation":"https://pith.science/pith/MASJ5C7NEI6ODQ6SDGZDG637BY/action/citation_signature","submit_replication":"https://pith.science/pith/MASJ5C7NEI6ODQ6SDGZDG637BY/action/replication_record"}},"created_at":"2026-05-18T00:51:53.865248+00:00","updated_at":"2026-05-18T00:51:53.865248+00:00"}