{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4EY7Y42SESDCJUWKLRFFY5CFOQ","short_pith_number":"pith:4EY7Y42S","schema_version":"1.0","canonical_sha256":"e131fc7352248624d2ca5c4a5c7445741d30b4966e48a292e88eaf4e2b9626ba","source":{"kind":"arxiv","id":"1810.01042","version":1},"attestation_state":"computed","paper":{"title":"Implementing the Lexicographic Maxmin Bargaining Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anilesh K. Krishnaswamy, Ashish Goel","submitted_at":"2018-10-02T02:55:59Z","abstract_excerpt":"There has been much work on exhibiting mechanisms that implement various bargaining solutions, in particular, the Kalai-Smorodinsky solution \\cite{moulin1984implementing} and the Nash Bargaining solution. Another well-known and axiomatically well-studied solution is the lexicographic maxmin solution. However, there is no mechanism known for its implementation. To fill this gap, we construct a mechanism that implements the lexicographic maxmin solution as the unique subgame perfect equilibrium outcome in the n-player setting. As is standard in the literature on implementation of bargaining solu"},"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":"1810.01042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-10-02T02:55:59Z","cross_cats_sorted":[],"title_canon_sha256":"e48eb3d6a7d9d8372574d771e9291b77c4c36a6aefab9e17235f1c24fbb70fcd","abstract_canon_sha256":"7889630c33881011501069e043f90d14fbc1fc59ff4ecb4c678e8fd299a34e15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:19.076948Z","signature_b64":"B52WWA3VIsGtwud5V3s6+LM0BeZ2uXNE+O+nyxAM54QhImtqG4rfNgsFA0JZlW6Vs9e4eStlDdUSJTsHRwyDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e131fc7352248624d2ca5c4a5c7445741d30b4966e48a292e88eaf4e2b9626ba","last_reissued_at":"2026-05-18T00:04:19.076302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:19.076302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implementing the Lexicographic Maxmin Bargaining Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anilesh K. Krishnaswamy, Ashish Goel","submitted_at":"2018-10-02T02:55:59Z","abstract_excerpt":"There has been much work on exhibiting mechanisms that implement various bargaining solutions, in particular, the Kalai-Smorodinsky solution \\cite{moulin1984implementing} and the Nash Bargaining solution. Another well-known and axiomatically well-studied solution is the lexicographic maxmin solution. However, there is no mechanism known for its implementation. To fill this gap, we construct a mechanism that implements the lexicographic maxmin solution as the unique subgame perfect equilibrium outcome in the n-player setting. As is standard in the literature on implementation of bargaining solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01042","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":"1810.01042","created_at":"2026-05-18T00:04:19.076412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01042v1","created_at":"2026-05-18T00:04:19.076412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01042","created_at":"2026-05-18T00:04:19.076412+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EY7Y42SESDC","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EY7Y42SESDCJUWK","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EY7Y42S","created_at":"2026-05-18T12:32:05.422762+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/4EY7Y42SESDCJUWKLRFFY5CFOQ","json":"https://pith.science/pith/4EY7Y42SESDCJUWKLRFFY5CFOQ.json","graph_json":"https://pith.science/api/pith-number/4EY7Y42SESDCJUWKLRFFY5CFOQ/graph.json","events_json":"https://pith.science/api/pith-number/4EY7Y42SESDCJUWKLRFFY5CFOQ/events.json","paper":"https://pith.science/paper/4EY7Y42S"},"agent_actions":{"view_html":"https://pith.science/pith/4EY7Y42SESDCJUWKLRFFY5CFOQ","download_json":"https://pith.science/pith/4EY7Y42SESDCJUWKLRFFY5CFOQ.json","view_paper":"https://pith.science/paper/4EY7Y42S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01042&json=true","fetch_graph":"https://pith.science/api/pith-number/4EY7Y42SESDCJUWKLRFFY5CFOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4EY7Y42SESDCJUWKLRFFY5CFOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EY7Y42SESDCJUWKLRFFY5CFOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EY7Y42SESDCJUWKLRFFY5CFOQ/action/storage_attestation","attest_author":"https://pith.science/pith/4EY7Y42SESDCJUWKLRFFY5CFOQ/action/author_attestation","sign_citation":"https://pith.science/pith/4EY7Y42SESDCJUWKLRFFY5CFOQ/action/citation_signature","submit_replication":"https://pith.science/pith/4EY7Y42SESDCJUWKLRFFY5CFOQ/action/replication_record"}},"created_at":"2026-05-18T00:04:19.076412+00:00","updated_at":"2026-05-18T00:04:19.076412+00:00"}