{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L4ZY7Y57ZTFPJ3RWCNKABHJK3B","short_pith_number":"pith:L4ZY7Y57","schema_version":"1.0","canonical_sha256":"5f338fe3bfcccaf4ee361354009d2ad87f2a5ad100a0ee7db81b86743d2396aa","source":{"kind":"arxiv","id":"1907.09198","version":1},"attestation_state":"computed","paper":{"title":"Today Me, Tomorrow Thee: Efficient Resource Allocation in Competitive Settings using Karma Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.MA","authors_text":"Andrea Censi, Emilio Frazzoli, Julian G. Zilly, Saverio Bolognani, Shima Sadat Mousavi","submitted_at":"2019-07-22T09:31:09Z","abstract_excerpt":"We present a new type of coordination mechanism among multiple agents for the allocation of a finite resource, such as the allocation of time slots for passing an intersection. We consider the setting where we associate one counter to each agent, which we call karma value, and where there is an established mechanism to decide resource allocation based on agents exchanging karma. The idea is that agents might be inclined to pass on using resources today, in exchange for karma, which will make it easier for them to claim the resource use in the future. To understand whether such a system might w"},"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":"1907.09198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-07-22T09:31:09Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"24a3b0c26ae40e7469ba83be059b36c52fa66dcf29d7fb59936e203bca37d802","abstract_canon_sha256":"18de7e754824e396616d329beda8989115d083140ee5aceecf47d0883915c854"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:59.878239Z","signature_b64":"+OUgCSVt84MiN1qPjWzbWQFiHv8LXmbZfqZOoDfqUm9Smdxw33P6Nt1ycVcHrjr+E9O+H5RsODXV25w9Q9RIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f338fe3bfcccaf4ee361354009d2ad87f2a5ad100a0ee7db81b86743d2396aa","last_reissued_at":"2026-05-17T23:39:59.877665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:59.877665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Today Me, Tomorrow Thee: Efficient Resource Allocation in Competitive Settings using Karma Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.MA","authors_text":"Andrea Censi, Emilio Frazzoli, Julian G. Zilly, Saverio Bolognani, Shima Sadat Mousavi","submitted_at":"2019-07-22T09:31:09Z","abstract_excerpt":"We present a new type of coordination mechanism among multiple agents for the allocation of a finite resource, such as the allocation of time slots for passing an intersection. We consider the setting where we associate one counter to each agent, which we call karma value, and where there is an established mechanism to decide resource allocation based on agents exchanging karma. The idea is that agents might be inclined to pass on using resources today, in exchange for karma, which will make it easier for them to claim the resource use in the future. To understand whether such a system might w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09198","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":"1907.09198","created_at":"2026-05-17T23:39:59.877747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09198v1","created_at":"2026-05-17T23:39:59.877747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09198","created_at":"2026-05-17T23:39:59.877747+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4ZY7Y57ZTFP","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4ZY7Y57ZTFPJ3RW","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4ZY7Y57","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11042","citing_title":"Towards Model-Free Learning in Dynamic Population Games: An Application to Karma Economies","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4ZY7Y57ZTFPJ3RWCNKABHJK3B","json":"https://pith.science/pith/L4ZY7Y57ZTFPJ3RWCNKABHJK3B.json","graph_json":"https://pith.science/api/pith-number/L4ZY7Y57ZTFPJ3RWCNKABHJK3B/graph.json","events_json":"https://pith.science/api/pith-number/L4ZY7Y57ZTFPJ3RWCNKABHJK3B/events.json","paper":"https://pith.science/paper/L4ZY7Y57"},"agent_actions":{"view_html":"https://pith.science/pith/L4ZY7Y57ZTFPJ3RWCNKABHJK3B","download_json":"https://pith.science/pith/L4ZY7Y57ZTFPJ3RWCNKABHJK3B.json","view_paper":"https://pith.science/paper/L4ZY7Y57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09198&json=true","fetch_graph":"https://pith.science/api/pith-number/L4ZY7Y57ZTFPJ3RWCNKABHJK3B/graph.json","fetch_events":"https://pith.science/api/pith-number/L4ZY7Y57ZTFPJ3RWCNKABHJK3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4ZY7Y57ZTFPJ3RWCNKABHJK3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4ZY7Y57ZTFPJ3RWCNKABHJK3B/action/storage_attestation","attest_author":"https://pith.science/pith/L4ZY7Y57ZTFPJ3RWCNKABHJK3B/action/author_attestation","sign_citation":"https://pith.science/pith/L4ZY7Y57ZTFPJ3RWCNKABHJK3B/action/citation_signature","submit_replication":"https://pith.science/pith/L4ZY7Y57ZTFPJ3RWCNKABHJK3B/action/replication_record"}},"created_at":"2026-05-17T23:39:59.877747+00:00","updated_at":"2026-05-17T23:39:59.877747+00:00"}