{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LGHTSFPF7RZTZUBDBCCPNCYNOH","short_pith_number":"pith:LGHTSFPF","schema_version":"1.0","canonical_sha256":"598f3915e5fc733cd0230884f68b0d71fa33d1c1bf9e00fbf72c361fa200d6bd","source":{"kind":"arxiv","id":"1806.04067","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Mechanism Design: Learning to Promote Cooperation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"John Shawe-Taylor, Thore Graepel, Tobias Baumann","submitted_at":"2018-06-11T15:48:37Z","abstract_excerpt":"In the future, artificial learning agents are likely to become increasingly widespread in our society. They will interact with both other learning agents and humans in a variety of complex settings including social dilemmas. We consider the problem of how an external agent can promote cooperation between artificial learners by distributing additional rewards and punishments based on observing the learners' actions. We propose a rule for automatically learning how to create right incentives by considering the players' anticipated parameter updates. Using this learning rule leads to cooperation "},"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":"1806.04067","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2018-06-11T15:48:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7b8720947f9026f7a5f1c0613504dbd79642e22359c3ba9826614047cc507aa9","abstract_canon_sha256":"ef5087ef1b128c366ab131f1bc254a6e03eed8107ea98e1b0e2a2fe4ca1ef283"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:41.774110Z","signature_b64":"CwS4W0FVyE/0XutMA5RJsnH979RntVTpnKM8E+tud/Wy6G9UifRo88yvOpwkiBNPGdz1pa8l7Uip7rDQ4FZhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"598f3915e5fc733cd0230884f68b0d71fa33d1c1bf9e00fbf72c361fa200d6bd","last_reissued_at":"2026-07-05T00:20:41.773726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:41.773726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Mechanism Design: Learning to Promote Cooperation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"John Shawe-Taylor, Thore Graepel, Tobias Baumann","submitted_at":"2018-06-11T15:48:37Z","abstract_excerpt":"In the future, artificial learning agents are likely to become increasingly widespread in our society. They will interact with both other learning agents and humans in a variety of complex settings including social dilemmas. We consider the problem of how an external agent can promote cooperation between artificial learners by distributing additional rewards and punishments based on observing the learners' actions. We propose a rule for automatically learning how to create right incentives by considering the players' anticipated parameter updates. Using this learning rule leads to cooperation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04067","kind":"arxiv","version":2},"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/1806.04067/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":"1806.04067","created_at":"2026-07-05T00:20:41.773781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04067v2","created_at":"2026-07-05T00:20:41.773781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04067","created_at":"2026-07-05T00:20:41.773781+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGHTSFPF7RZT","created_at":"2026-07-05T00:20:41.773781+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGHTSFPF7RZTZUBD","created_at":"2026-07-05T00:20:41.773781+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGHTSFPF","created_at":"2026-07-05T00:20:41.773781+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.15887","citing_title":"Fair Contracts in Principal-Agent Games with Heterogeneous Types","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGHTSFPF7RZTZUBDBCCPNCYNOH","json":"https://pith.science/pith/LGHTSFPF7RZTZUBDBCCPNCYNOH.json","graph_json":"https://pith.science/api/pith-number/LGHTSFPF7RZTZUBDBCCPNCYNOH/graph.json","events_json":"https://pith.science/api/pith-number/LGHTSFPF7RZTZUBDBCCPNCYNOH/events.json","paper":"https://pith.science/paper/LGHTSFPF"},"agent_actions":{"view_html":"https://pith.science/pith/LGHTSFPF7RZTZUBDBCCPNCYNOH","download_json":"https://pith.science/pith/LGHTSFPF7RZTZUBDBCCPNCYNOH.json","view_paper":"https://pith.science/paper/LGHTSFPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04067&json=true","fetch_graph":"https://pith.science/api/pith-number/LGHTSFPF7RZTZUBDBCCPNCYNOH/graph.json","fetch_events":"https://pith.science/api/pith-number/LGHTSFPF7RZTZUBDBCCPNCYNOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGHTSFPF7RZTZUBDBCCPNCYNOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGHTSFPF7RZTZUBDBCCPNCYNOH/action/storage_attestation","attest_author":"https://pith.science/pith/LGHTSFPF7RZTZUBDBCCPNCYNOH/action/author_attestation","sign_citation":"https://pith.science/pith/LGHTSFPF7RZTZUBDBCCPNCYNOH/action/citation_signature","submit_replication":"https://pith.science/pith/LGHTSFPF7RZTZUBDBCCPNCYNOH/action/replication_record"}},"created_at":"2026-07-05T00:20:41.773781+00:00","updated_at":"2026-07-05T00:20:41.773781+00:00"}