{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SBZVNDK52GV3MXSXEDZL6KMVOU","short_pith_number":"pith:SBZVNDK5","schema_version":"1.0","canonical_sha256":"9073568d5dd1abb65e5720f2bf299575121df29c2c3b37255bf1b39adb23d71b","source":{"kind":"arxiv","id":"1106.3858","version":1},"attestation_state":"computed","paper":{"title":"A Packet Dropping Mechanism for Efficient Operation of M/M/1 Queues with Selfish Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.OC"],"primary_cat":"cs.GT","authors_text":"Bhaskar Krishnamachari, Hua Liu, Yi Gai","submitted_at":"2011-06-20T10:40:21Z","abstract_excerpt":"We consider a fundamental game theoretic problem concerning selfish users contributing packets to an M/M/1 queue. In this game, each user controls its own input rate so as to optimize a desired tradeoff between throughput and delay. We first show that the original game has an inefficient Nash Equilibrium (NE), with a Price of Anarchy (PoA) that scales linearly or worse in the number of users. In order to improve the outcome efficiency, we propose an easily implementable mechanism design whereby the server randomly drops packets with a probability that is a function of the total arrival rate. 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":"1106.3858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-06-20T10:40:21Z","cross_cats_sorted":["cs.NI","math.OC"],"title_canon_sha256":"507177c9d1486a4f06e54ea50db2133ce30fdc0fce32b48fef7db4775011efb0","abstract_canon_sha256":"ed4478e4652d1e8803b3a43268465b191290ffc75631f5c51edcf8a52af1e42c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.407518Z","signature_b64":"wm8yvvkj1dc0vSDYYf/Z9ZJPyUp6XE0wcjmVePj+wLKpKY1OXrjDGtu7KubCSc7mm8wZ763wiBaJO781J4V0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9073568d5dd1abb65e5720f2bf299575121df29c2c3b37255bf1b39adb23d71b","last_reissued_at":"2026-05-18T00:58:43.406978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.406978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Packet Dropping Mechanism for Efficient Operation of M/M/1 Queues with Selfish Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.OC"],"primary_cat":"cs.GT","authors_text":"Bhaskar Krishnamachari, Hua Liu, Yi Gai","submitted_at":"2011-06-20T10:40:21Z","abstract_excerpt":"We consider a fundamental game theoretic problem concerning selfish users contributing packets to an M/M/1 queue. In this game, each user controls its own input rate so as to optimize a desired tradeoff between throughput and delay. We first show that the original game has an inefficient Nash Equilibrium (NE), with a Price of Anarchy (PoA) that scales linearly or worse in the number of users. In order to improve the outcome efficiency, we propose an easily implementable mechanism design whereby the server randomly drops packets with a probability that is a function of the total arrival rate. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3858","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":"1106.3858","created_at":"2026-05-18T00:58:43.407064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3858v1","created_at":"2026-05-18T00:58:43.407064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3858","created_at":"2026-05-18T00:58:43.407064+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBZVNDK52GV3","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBZVNDK52GV3MXSX","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBZVNDK5","created_at":"2026-05-18T12:26:41.206345+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/SBZVNDK52GV3MXSXEDZL6KMVOU","json":"https://pith.science/pith/SBZVNDK52GV3MXSXEDZL6KMVOU.json","graph_json":"https://pith.science/api/pith-number/SBZVNDK52GV3MXSXEDZL6KMVOU/graph.json","events_json":"https://pith.science/api/pith-number/SBZVNDK52GV3MXSXEDZL6KMVOU/events.json","paper":"https://pith.science/paper/SBZVNDK5"},"agent_actions":{"view_html":"https://pith.science/pith/SBZVNDK52GV3MXSXEDZL6KMVOU","download_json":"https://pith.science/pith/SBZVNDK52GV3MXSXEDZL6KMVOU.json","view_paper":"https://pith.science/paper/SBZVNDK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3858&json=true","fetch_graph":"https://pith.science/api/pith-number/SBZVNDK52GV3MXSXEDZL6KMVOU/graph.json","fetch_events":"https://pith.science/api/pith-number/SBZVNDK52GV3MXSXEDZL6KMVOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBZVNDK52GV3MXSXEDZL6KMVOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBZVNDK52GV3MXSXEDZL6KMVOU/action/storage_attestation","attest_author":"https://pith.science/pith/SBZVNDK52GV3MXSXEDZL6KMVOU/action/author_attestation","sign_citation":"https://pith.science/pith/SBZVNDK52GV3MXSXEDZL6KMVOU/action/citation_signature","submit_replication":"https://pith.science/pith/SBZVNDK52GV3MXSXEDZL6KMVOU/action/replication_record"}},"created_at":"2026-05-18T00:58:43.407064+00:00","updated_at":"2026-05-18T00:58:43.407064+00:00"}