Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-05T22:30:53.614197Z
Paper Citation Record · LEDGER
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners
As of 14 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 1 inbound Pith citation observation for arXiv:2508.07145.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-11T04:59:20.159317Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-11T04:59:20.339036Z
Reference resolution
26 of 26 outbound references displayed
- verified exact0
- verified fuzzy26
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation dcd49517-0b6b-40bc-9b5e-4f5f387e201e · outbound
This paper cites Implementing mediators with asynchronous cheap talk.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Implementing mediators with asynchronous cheap talk
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:54.145773Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation d017306e-922f-4a2a-9886-a1293a3fe590 · outbound
This paper cites Mediated cheap talk design.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Mediated cheap talk design
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:54.129170Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation d1fd715a-0d08-4eee-9942-21749d795fc6 · outbound
This paper cites Resilient information aggregation.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Resilient information aggregation
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:54.113537Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 7438e57d-f93c-47a3-a4c4-642d770a84c4 · outbound
This paper cites Simultaneous ad auctions.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Simultaneous ad auctions
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:54.092976Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 0b362e6a-334c-4e7b-9783-74a60abec4e7 · outbound
This paper cites Mechanism design with strategic mediators.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Mechanism design with strategic mediators
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:54.074561Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 89a8bec2-acce-4db5-ae5f-7c887273e2c3 · outbound
This paper cites Cheap talk in games with incomplete information.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Cheap talk in games with incomplete information
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:54.057043Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation c022a539-9d63-41ef-841f-4aa3c40805d7 · outbound
This paper cites Computing optimal equilibria in repeated games with restarts.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Computing optimal equilibria in repeated games with restarts
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:54.039394Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 31741ed8-abff-42ad-8e12-b7b5388ad08d · outbound
This paper cites The myth of the folk theorem.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners The myth of the folk theorem
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:54.021340Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 072593ff-1819-4591-bb27-01b1478583ad · outbound
This paper cites Mediated communication with transparent motives.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Mediated communication with transparent motives
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:54.001728Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 9d589534-69d1-4df6-ad63-90aea0697aa4 · outbound
This paper cites Muthukrishnan, and Mallesh M.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Muthukrishnan, and Mallesh M
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.982266Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 0f7f9b32-0d62-489e-8153-2b8fc1a1daf8 · outbound
This paper cites Partition equilibrium.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Partition equilibrium
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.961266Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 78a80ddb-4b52-40bb-9f25-ad26431eb7bc · outbound
This paper cites Communication games, sequential equilibrium, and medi- ators.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Communication games, sequential equilibrium, and medi- ators
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.941594Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 5f9d5eaf-e758-47bb-a850-97805cece550 · outbound
This paper cites Making a nash equilibrium resilient to coalitions.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Making a nash equilibrium resilient to coalitions
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.921647Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation f5aa3860-5edc-49d8-acce-9cc328c3bb52 · outbound
This paper cites Unmediated communication in games with complete and incomplete information.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Unmediated communication in games with complete and incomplete information
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.901869Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 6e7f408d-7561-47d7-abec-2c4ac02c1bdb · outbound
This paper cites Network structure and strong equilibrium in route selection games.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Network structure and strong equilibrium in route selection games
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.877867Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation beaa93cf-8b69-46ce-b6dc-240f26ab1727 · outbound
This paper cites Strong equilibrium in network congestion games: increasing versus decreasing costs.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Strong equilibrium in network congestion games: increasing versus decreasing costs
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.856297Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 4b72265a-1266-491e-93aa-40b1365d3dc7 · outbound
This paper cites Worst-case equilibria.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Worst-case equilibria
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.838223Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation bf104bd9-3595-435f-98c4-47e0908c8db2 · outbound
This paper cites Game theory with simulation of other players.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Game theory with simulation of other players
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.819973Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 54856624-6d72-4d7a-8a0b-cf592bb7a0dc · outbound
This paper cites Equilibrium and potential in coalitional congestion games.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Equilibrium and potential in coalitional congestion games
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.800858Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 49f36e87-c5dd-490d-bfe2-ee790b4ae895 · outbound
This paper cites Bidding clubs in first-price auc- tions.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Bidding clubs in first-price auc- tions
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.783966Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 2eda5623-c210-43d2-88b4-8308553e80a7 · outbound
This paper cites k-implementation.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners k-implementation
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.765540Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 65283818-95c2-4685-8810-9d79d6c75992 · outbound
This paper cites K-price auctions: Revenue inequalities, utility equiva- lence, and competition in auction design.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners K-price auctions: Revenue inequalities, utility equiva- lence, and competition in auction design
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.744906Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation d207f5ba-10d1-431d-baf2-a0a63aea62e8 · outbound
This paper cites The economics of welfare.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners The economics of welfare
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.726549Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 1b60d8af-6ee4-45c0-a9e5-ffc1388482a3 · outbound
This paper cites How bad is selfish routing? Journal of the ACM (JACM) , 49(2):236–259, 2002.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners How bad is selfish routing? Journal of the ACM (JACM) , 49(2):236–259, 2002
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.708224Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation b8619959-1013-4e71-ba71-98b81075ef4f · outbound
This paper cites Program equilibrium.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Program equilibrium
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.683336Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation e7895186-f3bc-4b39-8ebb-f4cdb885f9ca · outbound
This paper cites Learning equilibria in repeated congestion games.
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners Learning equilibria in repeated congestion games
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-05T22:30:53.663075Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Pith citing papers
Observation eb922177-dc08-488a-8311-037a81660e1e · inbound
Competitive mediator games and urban CAV routing markets cites this paper.
Competitive mediator games and urban CAV routing markets When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners
Reference 20
- Resolution
- verified exact
- local_arxiv, observed 2026-08-11T04:59:20.342421Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.