Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for Freeways and Facilities with Parallel Queues Article Swipe
Roger Lloret-Batlle
,
R. Jayakrishnan
·
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1803.01265
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1803.01265
This article explores the coalitional stability of a new cooperative control policy for freeways and parallel queuing facilities with multiple servers. Based on predicted future delays per queue or lane, a VOT-heterogeneous population of agents can agree to switch lanes or queues and transfer payments to each other in order to minimize the total cost of the incoming platoon. The strategic interaction is captured by an n-level Stackelberg model with coalitions, while the cooperative structure is formulated as a partition function game (PFG). The stability concept explored is the strong-core for PFGs which we found appropiate given the nature of the problem. This concept ensures that the efficient allocation is individually rational and coalitionally stable. We analyze this control mechanism for two settings: a static vertical queue and a dynamic horizontal queue. For the former, we first characterize the properties of the underlying cooperative game. Our simulation results suggest that the setting is always strong-core stable. For the latter, we propose a new relaxation program for the strong-core concept. Our simulation results on a freeway bottleneck with constant outflow using Newell's car-following model show the imputations to be generally strong-core stable and the coalitional instabilities to remain small with regard to users' costs.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/1803.01265
- https://arxiv.org/pdf/1803.01265
- OA Status
- green
- Cited By
- 1
- References
- 15
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2793702469
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2793702469Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.1803.01265Digital Object Identifier
- Title
-
Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for Freeways and Facilities with Parallel QueuesWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2018Year of publication
- Publication date
-
2018-03-03Full publication date if available
- Authors
-
Roger Lloret-Batlle, R. JayakrishnanList of authors in order
- Landing page
-
https://arxiv.org/abs/1803.01265Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/1803.01265Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/1803.01265Direct OA link when available
- Concepts
-
Queue, Bottleneck, Computer science, Platoon, Queueing theory, Stackelberg competition, Mathematical optimization, Core (optical fiber), Control (management), Mathematical economics, Computer network, Mathematics, Telecommunications, Embedded system, Artificial intelligenceTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 1Per-year citation counts (last 5 years)
- References (count)
-
15Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2793702469 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.1803.01265 |
| ids.doi | https://doi.org/10.48550/arxiv.1803.01265 |
| ids.mag | 2793702469 |
| ids.openalex | https://openalex.org/W2793702469 |
| fwci | |
| type | preprint |
| title | Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for Freeways and Facilities with Parallel Queues |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10698 |
| topics[0].field.id | https://openalex.org/fields/33 |
| topics[0].field.display_name | Social Sciences |
| topics[0].score | 0.9998000264167786 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/3313 |
| topics[0].subfield.display_name | Transportation |
| topics[0].display_name | Transportation Planning and Optimization |
| topics[1].id | https://openalex.org/T10524 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9994000196456909 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2207 |
| topics[1].subfield.display_name | Control and Systems Engineering |
| topics[1].display_name | Traffic control and management |
| topics[2].id | https://openalex.org/T11942 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9908000230789185 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2203 |
| topics[2].subfield.display_name | Automotive Engineering |
| topics[2].display_name | Transportation and Mobility Innovations |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C160403385 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7379809021949768 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q220543 |
| concepts[0].display_name | Queue |
| concepts[1].id | https://openalex.org/C2780513914 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6231786608695984 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q18210350 |
| concepts[1].display_name | Bottleneck |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6127396821975708 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C2777735972 |
| concepts[3].level | 3 |
| concepts[3].score | 0.5447391867637634 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1061967 |
| concepts[3].display_name | Platoon |
| concepts[4].id | https://openalex.org/C22684755 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5433938503265381 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q847526 |
| concepts[4].display_name | Queueing theory |
| concepts[5].id | https://openalex.org/C199510392 |
| concepts[5].level | 2 |
| concepts[5].score | 0.46959128975868225 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1184602 |
| concepts[5].display_name | Stackelberg competition |
| concepts[6].id | https://openalex.org/C126255220 |
| concepts[6].level | 1 |
| concepts[6].score | 0.46366527676582336 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[6].display_name | Mathematical optimization |
| concepts[7].id | https://openalex.org/C2164484 |
| concepts[7].level | 2 |
| concepts[7].score | 0.41959360241889954 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q5170150 |
| concepts[7].display_name | Core (optical fiber) |
| concepts[8].id | https://openalex.org/C2775924081 |
| concepts[8].level | 2 |
| concepts[8].score | 0.3001793324947357 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q55608371 |
| concepts[8].display_name | Control (management) |
| concepts[9].id | https://openalex.org/C144237770 |
| concepts[9].level | 1 |
| concepts[9].score | 0.23965367674827576 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q747534 |
| concepts[9].display_name | Mathematical economics |
| concepts[10].id | https://openalex.org/C31258907 |
| concepts[10].level | 1 |
| concepts[10].score | 0.19003137946128845 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[10].display_name | Computer network |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.16702696681022644 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C76155785 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0746607780456543 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q418 |
| concepts[12].display_name | Telecommunications |
| concepts[13].id | https://openalex.org/C149635348 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q193040 |
| concepts[13].display_name | Embedded system |
| concepts[14].id | https://openalex.org/C154945302 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[14].display_name | Artificial intelligence |
| keywords[0].id | https://openalex.org/keywords/queue |
| keywords[0].score | 0.7379809021949768 |
| keywords[0].display_name | Queue |
| keywords[1].id | https://openalex.org/keywords/bottleneck |
| keywords[1].score | 0.6231786608695984 |
| keywords[1].display_name | Bottleneck |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.6127396821975708 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/platoon |
| keywords[3].score | 0.5447391867637634 |
| keywords[3].display_name | Platoon |
| keywords[4].id | https://openalex.org/keywords/queueing-theory |
| keywords[4].score | 0.5433938503265381 |
| keywords[4].display_name | Queueing theory |
| keywords[5].id | https://openalex.org/keywords/stackelberg-competition |
| keywords[5].score | 0.46959128975868225 |
| keywords[5].display_name | Stackelberg competition |
| keywords[6].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[6].score | 0.46366527676582336 |
| keywords[6].display_name | Mathematical optimization |
| keywords[7].id | https://openalex.org/keywords/core |
| keywords[7].score | 0.41959360241889954 |
| keywords[7].display_name | Core (optical fiber) |
| keywords[8].id | https://openalex.org/keywords/control |
| keywords[8].score | 0.3001793324947357 |
| keywords[8].display_name | Control (management) |
| keywords[9].id | https://openalex.org/keywords/mathematical-economics |
| keywords[9].score | 0.23965367674827576 |
| keywords[9].display_name | Mathematical economics |
| keywords[10].id | https://openalex.org/keywords/computer-network |
| keywords[10].score | 0.19003137946128845 |
| keywords[10].display_name | Computer network |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.16702696681022644 |
| keywords[11].display_name | Mathematics |
| keywords[12].id | https://openalex.org/keywords/telecommunications |
| keywords[12].score | 0.0746607780456543 |
| keywords[12].display_name | Telecommunications |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:1803.01265 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/1803.01265 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/1803.01265 |
| locations[1].id | doi:10.48550/arxiv.1803.01265 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.1803.01265 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5038627606 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-9336-3668 |
| authorships[0].author.display_name | Roger Lloret-Batlle |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Roger Lloret-Batlle |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5085499435 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-0155-3622 |
| authorships[1].author.display_name | R. Jayakrishnan |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | R. Jayakrishnan |
| authorships[1].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/1803.01265 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for Freeways and Facilities with Parallel Queues |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10698 |
| primary_topic.field.id | https://openalex.org/fields/33 |
| primary_topic.field.display_name | Social Sciences |
| primary_topic.score | 0.9998000264167786 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/3313 |
| primary_topic.subfield.display_name | Transportation |
| primary_topic.display_name | Transportation Planning and Optimization |
| related_works | https://openalex.org/W4286572054, https://openalex.org/W2555207388, https://openalex.org/W3171462553, https://openalex.org/W2983996496, https://openalex.org/W3168594544, https://openalex.org/W3189590538, https://openalex.org/W1967035263, https://openalex.org/W2982511116, https://openalex.org/W620645464, https://openalex.org/W2768886816 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:1803.01265 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/1803.01265 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/1803.01265 |
| primary_location.id | pmh:oai:arXiv.org:1803.01265 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/1803.01265 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/1803.01265 |
| publication_date | 2018-03-03 |
| publication_year | 2018 |
| referenced_works | https://openalex.org/W2062411974, https://openalex.org/W1541475132, https://openalex.org/W2024058777, https://openalex.org/W1989872469, https://openalex.org/W2519757625, https://openalex.org/W2626360457, https://openalex.org/W1979546961, https://openalex.org/W1964187104, https://openalex.org/W2124194695, https://openalex.org/W2050042869, https://openalex.org/W1999587457, https://openalex.org/W1976210094, https://openalex.org/W2911374400, https://openalex.org/W2144500880, https://openalex.org/W2148965922 |
| referenced_works_count | 15 |
| abstract_inverted_index.a | 7, 30, 78, 123, 128, 161, 173 |
| abstract_inverted_index.We | 115 |
| abstract_inverted_index.an | 65 |
| abstract_inverted_index.as | 77 |
| abstract_inverted_index.be | 187 |
| abstract_inverted_index.by | 64 |
| abstract_inverted_index.in | 48 |
| abstract_inverted_index.is | 62, 75, 87, 109, 152 |
| abstract_inverted_index.of | 6, 33, 55, 99, 140 |
| abstract_inverted_index.on | 22, 172 |
| abstract_inverted_index.or | 28, 40 |
| abstract_inverted_index.to | 37, 45, 50, 186, 195, 200 |
| abstract_inverted_index.we | 93, 135, 159 |
| abstract_inverted_index.For | 132, 156 |
| abstract_inverted_index.Our | 145, 169 |
| abstract_inverted_index.The | 59, 83 |
| abstract_inverted_index.and | 14, 42, 112, 127, 191 |
| abstract_inverted_index.can | 35 |
| abstract_inverted_index.for | 12, 90, 120, 165 |
| abstract_inverted_index.new | 8, 162 |
| abstract_inverted_index.per | 26 |
| abstract_inverted_index.the | 3, 52, 56, 72, 88, 97, 100, 106, 133, 138, 141, 150, 157, 166, 184, 192 |
| abstract_inverted_index.two | 121 |
| abstract_inverted_index.PFGs | 91 |
| abstract_inverted_index.This | 0, 102 |
| abstract_inverted_index.cost | 54 |
| abstract_inverted_index.each | 46 |
| abstract_inverted_index.game | 81 |
| abstract_inverted_index.show | 183 |
| abstract_inverted_index.that | 105, 149 |
| abstract_inverted_index.this | 117 |
| abstract_inverted_index.with | 18, 69, 176, 198 |
| abstract_inverted_index.Based | 21 |
| abstract_inverted_index.agree | 36 |
| abstract_inverted_index.first | 136 |
| abstract_inverted_index.found | 94 |
| abstract_inverted_index.game. | 144 |
| abstract_inverted_index.given | 96 |
| abstract_inverted_index.lane, | 29 |
| abstract_inverted_index.lanes | 39 |
| abstract_inverted_index.model | 68, 182 |
| abstract_inverted_index.order | 49 |
| abstract_inverted_index.other | 47 |
| abstract_inverted_index.queue | 27, 126 |
| abstract_inverted_index.small | 197 |
| abstract_inverted_index.total | 53 |
| abstract_inverted_index.using | 179 |
| abstract_inverted_index.which | 92 |
| abstract_inverted_index.while | 71 |
| abstract_inverted_index.(PFG). | 82 |
| abstract_inverted_index.agents | 34 |
| abstract_inverted_index.always | 153 |
| abstract_inverted_index.costs. | 202 |
| abstract_inverted_index.delays | 25 |
| abstract_inverted_index.future | 24 |
| abstract_inverted_index.nature | 98 |
| abstract_inverted_index.policy | 11 |
| abstract_inverted_index.queue. | 131 |
| abstract_inverted_index.queues | 41 |
| abstract_inverted_index.regard | 199 |
| abstract_inverted_index.remain | 196 |
| abstract_inverted_index.stable | 190 |
| abstract_inverted_index.static | 124 |
| abstract_inverted_index.switch | 38 |
| abstract_inverted_index.users' | 201 |
| abstract_inverted_index.analyze | 116 |
| abstract_inverted_index.article | 1 |
| abstract_inverted_index.concept | 85, 103 |
| abstract_inverted_index.control | 10, 118 |
| abstract_inverted_index.dynamic | 129 |
| abstract_inverted_index.ensures | 104 |
| abstract_inverted_index.former, | 134 |
| abstract_inverted_index.freeway | 174 |
| abstract_inverted_index.latter, | 158 |
| abstract_inverted_index.n-level | 66 |
| abstract_inverted_index.outflow | 178 |
| abstract_inverted_index.program | 164 |
| abstract_inverted_index.propose | 160 |
| abstract_inverted_index.queuing | 16 |
| abstract_inverted_index.results | 147, 171 |
| abstract_inverted_index.setting | 151 |
| abstract_inverted_index.stable. | 114, 155 |
| abstract_inverted_index.suggest | 148 |
| abstract_inverted_index.Newell's | 180 |
| abstract_inverted_index.captured | 63 |
| abstract_inverted_index.concept. | 168 |
| abstract_inverted_index.constant | 177 |
| abstract_inverted_index.explored | 86 |
| abstract_inverted_index.explores | 2 |
| abstract_inverted_index.freeways | 13 |
| abstract_inverted_index.function | 80 |
| abstract_inverted_index.incoming | 57 |
| abstract_inverted_index.minimize | 51 |
| abstract_inverted_index.multiple | 19 |
| abstract_inverted_index.parallel | 15 |
| abstract_inverted_index.payments | 44 |
| abstract_inverted_index.platoon. | 58 |
| abstract_inverted_index.problem. | 101 |
| abstract_inverted_index.rational | 111 |
| abstract_inverted_index.servers. | 20 |
| abstract_inverted_index.transfer | 43 |
| abstract_inverted_index.vertical | 125 |
| abstract_inverted_index.efficient | 107 |
| abstract_inverted_index.generally | 188 |
| abstract_inverted_index.mechanism | 119 |
| abstract_inverted_index.partition | 79 |
| abstract_inverted_index.predicted | 23 |
| abstract_inverted_index.settings: | 122 |
| abstract_inverted_index.stability | 5, 84 |
| abstract_inverted_index.strategic | 60 |
| abstract_inverted_index.structure | 74 |
| abstract_inverted_index.allocation | 108 |
| abstract_inverted_index.appropiate | 95 |
| abstract_inverted_index.bottleneck | 175 |
| abstract_inverted_index.facilities | 17 |
| abstract_inverted_index.formulated | 76 |
| abstract_inverted_index.horizontal | 130 |
| abstract_inverted_index.population | 32 |
| abstract_inverted_index.properties | 139 |
| abstract_inverted_index.relaxation | 163 |
| abstract_inverted_index.simulation | 146, 170 |
| abstract_inverted_index.underlying | 142 |
| abstract_inverted_index.Stackelberg | 67 |
| abstract_inverted_index.coalitional | 4, 193 |
| abstract_inverted_index.coalitions, | 70 |
| abstract_inverted_index.cooperative | 9, 73, 143 |
| abstract_inverted_index.imputations | 185 |
| abstract_inverted_index.interaction | 61 |
| abstract_inverted_index.strong-core | 89, 154, 167, 189 |
| abstract_inverted_index.characterize | 137 |
| abstract_inverted_index.individually | 110 |
| abstract_inverted_index.car-following | 181 |
| abstract_inverted_index.coalitionally | 113 |
| abstract_inverted_index.instabilities | 194 |
| abstract_inverted_index.VOT-heterogeneous | 31 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/17 |
| sustainable_development_goals[0].score | 0.5 |
| sustainable_development_goals[0].display_name | Partnerships for the goals |
| citation_normalized_percentile |