{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CML2T7EIXMEAJY4U23MLBUY6GS","short_pith_number":"pith:CML2T7EI","schema_version":"1.0","canonical_sha256":"1317a9fc88bb0804e394d6d8b0d31e34b2c0c3dc39aefa8292ede0b9e23e8d22","source":{"kind":"arxiv","id":"2506.00554","version":1},"attestation_state":"computed","paper":{"title":"Two-Sided Manipulation Games in Stable Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Grzegorz Lisowski, Hadi Hosseini, Shraddha Pathak","submitted_at":"2025-05-31T13:19:31Z","abstract_excerpt":"The Deferred Acceptance (DA) algorithm is an elegant procedure for finding a stable matching in two-sided matching markets. It ensures that no pair of agents prefers each other to their matched partners. In this work, we initiate the study of two-sided manipulations in matching markets as non-cooperative games. We introduce the accomplice manipulation game, where a man misreports to help a specific woman obtain a better partner, whenever possible. We provide a polynomial time algorithm for finding a pure strategy Nash equilibrium (NE) and show that our algorithm always yields a stable matching"},"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":"2506.00554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-05-31T13:19:31Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"75c255020f207d6abc061f6fc8993c214851991f5411564d2b03528d2a580ec5","abstract_canon_sha256":"4f547c9034ef775982d423262f6b59875ca56ed5e3d2b0da7a264c765b2f8cb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:36.858499Z","signature_b64":"M+anjuaTvy4eW9r6PE/5yaC2KvxE1VfX/hOnnekT85pdQtZ8AyakzkApc5uKNzC/7LXiTzWkOut95J47nvx5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1317a9fc88bb0804e394d6d8b0d31e34b2c0c3dc39aefa8292ede0b9e23e8d22","last_reissued_at":"2026-07-05T11:13:36.858102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:36.858102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Sided Manipulation Games in Stable Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Grzegorz Lisowski, Hadi Hosseini, Shraddha Pathak","submitted_at":"2025-05-31T13:19:31Z","abstract_excerpt":"The Deferred Acceptance (DA) algorithm is an elegant procedure for finding a stable matching in two-sided matching markets. It ensures that no pair of agents prefers each other to their matched partners. In this work, we initiate the study of two-sided manipulations in matching markets as non-cooperative games. We introduce the accomplice manipulation game, where a man misreports to help a specific woman obtain a better partner, whenever possible. We provide a polynomial time algorithm for finding a pure strategy Nash equilibrium (NE) and show that our algorithm always yields a stable matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00554","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/2506.00554/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":"2506.00554","created_at":"2026-07-05T11:13:36.858158+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00554v1","created_at":"2026-07-05T11:13:36.858158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00554","created_at":"2026-07-05T11:13:36.858158+00:00"},{"alias_kind":"pith_short_12","alias_value":"CML2T7EIXMEA","created_at":"2026-07-05T11:13:36.858158+00:00"},{"alias_kind":"pith_short_16","alias_value":"CML2T7EIXMEAJY4U","created_at":"2026-07-05T11:13:36.858158+00:00"},{"alias_kind":"pith_short_8","alias_value":"CML2T7EI","created_at":"2026-07-05T11:13:36.858158+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/CML2T7EIXMEAJY4U23MLBUY6GS","json":"https://pith.science/pith/CML2T7EIXMEAJY4U23MLBUY6GS.json","graph_json":"https://pith.science/api/pith-number/CML2T7EIXMEAJY4U23MLBUY6GS/graph.json","events_json":"https://pith.science/api/pith-number/CML2T7EIXMEAJY4U23MLBUY6GS/events.json","paper":"https://pith.science/paper/CML2T7EI"},"agent_actions":{"view_html":"https://pith.science/pith/CML2T7EIXMEAJY4U23MLBUY6GS","download_json":"https://pith.science/pith/CML2T7EIXMEAJY4U23MLBUY6GS.json","view_paper":"https://pith.science/paper/CML2T7EI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00554&json=true","fetch_graph":"https://pith.science/api/pith-number/CML2T7EIXMEAJY4U23MLBUY6GS/graph.json","fetch_events":"https://pith.science/api/pith-number/CML2T7EIXMEAJY4U23MLBUY6GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CML2T7EIXMEAJY4U23MLBUY6GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CML2T7EIXMEAJY4U23MLBUY6GS/action/storage_attestation","attest_author":"https://pith.science/pith/CML2T7EIXMEAJY4U23MLBUY6GS/action/author_attestation","sign_citation":"https://pith.science/pith/CML2T7EIXMEAJY4U23MLBUY6GS/action/citation_signature","submit_replication":"https://pith.science/pith/CML2T7EIXMEAJY4U23MLBUY6GS/action/replication_record"}},"created_at":"2026-07-05T11:13:36.858158+00:00","updated_at":"2026-07-05T11:13:36.858158+00:00"}