{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZK5ABFXFI4ZWBQKZOWRNQVJHJR","short_pith_number":"pith:ZK5ABFXF","schema_version":"1.0","canonical_sha256":"caba0096e5473360c15975a2d855274c695b66c0b8ac3b16f3a3bf53da9bcc15","source":{"kind":"arxiv","id":"1712.07202","version":1},"attestation_state":"computed","paper":{"title":"Continuum Nash Bargaining Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Micah Warren","submitted_at":"2017-12-19T20:51:26Z","abstract_excerpt":"Nash`s classical bargaining solution suggests that n players in a non-cooperative bargaining situation should find a solution that maximizes the product of each player's utility functions. We consider a special case: Suppose that the players are chosen from a continuum distribution $\\mu$ and suppose they are to divide up a resource $\\nu$ that is also on a continuum. The utility to each player is determined by the exponential of a distance type function. The maximization problem becomes an optimal transport type problem, where the target density is the minimizer to the functional \\[ F(\\beta)=H_"},"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":"1712.07202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2017-12-19T20:51:26Z","cross_cats_sorted":[],"title_canon_sha256":"fc70630c41e4968f44ac32b4e37ef7a316ce60c9b59f13cc0ad607dd78528782","abstract_canon_sha256":"8a0d3b60437c5736230b723b58a41c33bfdc6fff4dc484dde11ce1a5341f9c79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:35.245913Z","signature_b64":"y1C0TFjXW3ox9yQ7lRoSHsBpNqf7f1K2+LC12yk+ElitP29777L4L0HwFG7scnqsGdxBe5HEUoFysXEylPqOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caba0096e5473360c15975a2d855274c695b66c0b8ac3b16f3a3bf53da9bcc15","last_reissued_at":"2026-05-18T00:27:35.245179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:35.245179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuum Nash Bargaining Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Micah Warren","submitted_at":"2017-12-19T20:51:26Z","abstract_excerpt":"Nash`s classical bargaining solution suggests that n players in a non-cooperative bargaining situation should find a solution that maximizes the product of each player's utility functions. We consider a special case: Suppose that the players are chosen from a continuum distribution $\\mu$ and suppose they are to divide up a resource $\\nu$ that is also on a continuum. The utility to each player is determined by the exponential of a distance type function. The maximization problem becomes an optimal transport type problem, where the target density is the minimizer to the functional \\[ F(\\beta)=H_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07202","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":"1712.07202","created_at":"2026-05-18T00:27:35.245290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07202v1","created_at":"2026-05-18T00:27:35.245290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07202","created_at":"2026-05-18T00:27:35.245290+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZK5ABFXFI4ZW","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZK5ABFXFI4ZWBQKZ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZK5ABFXF","created_at":"2026-05-18T12:31:59.375834+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/ZK5ABFXFI4ZWBQKZOWRNQVJHJR","json":"https://pith.science/pith/ZK5ABFXFI4ZWBQKZOWRNQVJHJR.json","graph_json":"https://pith.science/api/pith-number/ZK5ABFXFI4ZWBQKZOWRNQVJHJR/graph.json","events_json":"https://pith.science/api/pith-number/ZK5ABFXFI4ZWBQKZOWRNQVJHJR/events.json","paper":"https://pith.science/paper/ZK5ABFXF"},"agent_actions":{"view_html":"https://pith.science/pith/ZK5ABFXFI4ZWBQKZOWRNQVJHJR","download_json":"https://pith.science/pith/ZK5ABFXFI4ZWBQKZOWRNQVJHJR.json","view_paper":"https://pith.science/paper/ZK5ABFXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07202&json=true","fetch_graph":"https://pith.science/api/pith-number/ZK5ABFXFI4ZWBQKZOWRNQVJHJR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZK5ABFXFI4ZWBQKZOWRNQVJHJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZK5ABFXFI4ZWBQKZOWRNQVJHJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZK5ABFXFI4ZWBQKZOWRNQVJHJR/action/storage_attestation","attest_author":"https://pith.science/pith/ZK5ABFXFI4ZWBQKZOWRNQVJHJR/action/author_attestation","sign_citation":"https://pith.science/pith/ZK5ABFXFI4ZWBQKZOWRNQVJHJR/action/citation_signature","submit_replication":"https://pith.science/pith/ZK5ABFXFI4ZWBQKZOWRNQVJHJR/action/replication_record"}},"created_at":"2026-05-18T00:27:35.245290+00:00","updated_at":"2026-05-18T00:27:35.245290+00:00"}