{"entities":{"Q2205095":{"pageid":2215838,"ns":120,"title":"Item:Q2205095","lastrevid":73810803,"modified":"2026-04-14T17:20:14Z","type":"item","id":"Q2205095","labels":{"en":{"language":"en","value":"The efficiency of greedy best response algorithm in road traffic assignment"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7262422"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2205095$FFC65187-9C45-4AB1-947E-88B92B0F3BB6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"21e999320b9c7927a176416c29b1e641a8e5c983","datavalue":{"value":{"text":"The efficiency of greedy best response algorithm in road traffic assignment","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2205095$7AEA94E8-037D-453B-BC8A-5626F5D09AC8","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4bfa1b9e7e401e51e6fdb1337d1626d7eb89f583","datavalue":{"value":"1452.90089","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2205095$9BA04658-EDE9-4AF0-9431-6BC787FD60A8","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b3a4c4d0eff8428480e2f2fff95bbbf4baa7fc96","datavalue":{"value":"10.1504/IJMOR.2019.102077","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2205095$C5BA8E71-88EF-4307-90AD-51391F81DD80","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"99cc8567ef71e6ad56d9d537712e3eae3f6ca002","datavalue":{"value":{"entity-type":"item","numeric-id":2205094,"id":"Q2205094"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2205095$B7C30AD8-2508-4732-B90C-979648177B9A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d1682c075768650426edad1c791fc7d321b19a77","datavalue":{"value":{"entity-type":"item","numeric-id":320117,"id":"Q320117"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2205095$F446A830-C1BA-4146-9B66-6F64CCEECFB0","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"08904a7410b5f731fa63153720439160d216b374","datavalue":{"value":{"entity-type":"item","numeric-id":548461,"id":"Q548461"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2205095$F0AE3FE4-0219-4602-A129-1FAA1DA62283","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d408ba8ad01c9186edaaf432f84bedb5d9fa5980","datavalue":{"value":{"time":"+2020-10-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2205095$2625E8B4-D72A-4EBA-A79C-734BDE5B45F1","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"a3dccc0d46c02cbbfa0dd1d5f2a7208543b12158","datavalue":{"value":"Summary: In this work, we investigate the problem of the integer road traffic assignment. So, we model the interaction among the road users sharing the same origin-destination pair, as a symmetric network congestion game. We focus on Rosenthal's results to guarantee the existence of a pure Nash equilibrium (PNE). Then, we study the behaviour of an algorithm based on greedy best response (GBR) in finding PNE. In previous studies, the efficiency of GBR to compute a PNE of a symmetric network congestion game in series-parallel networks is proved. In our work, another approach is used to demonstrate its efficiency in more general networks. It is shown that the non-series parallel networks can be classed into two types. The conditions that make GBR succeeds for each type is then drawn. The advantage of GBR-algorithm is that provides a better approximation of the equilibrate assignment, since it is integer.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2205095$59B3BF13-A031-4390-9B06-D160F29DBC6D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1c819bcbc5228a4c15a0698bc48e27bac5cf3646","datavalue":{"value":"90B20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2205095$97414D4E-4853-45FA-9379-61F37C341988","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5c83f057600e5614b7fec59c8e4ac61cb41ba8d","datavalue":{"value":"91A80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2205095$C27AC541-D045-4459-B023-3883D3ED7296","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d36b4ef6da20fbfce420def2f0b3549b968eb2d6","datavalue":{"value":"7262422","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2205095$E356491A-D151-47D5-804D-431B0CB7417C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"883cf7af2c496e6641f7319513c428d7bef85c31","datavalue":{"value":"road traffic assignment","type":"string"},"datatype":"string"},"type":"statement","id":"Q2205095$A24368A5-FDF4-4D8E-84AF-F2353A0644F0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8215b7b0bcb3abeb5fdceaaf3cdf4b319ee28e30","datavalue":{"value":"congestion game","type":"string"},"datatype":"string"},"type":"statement","id":"Q2205095$E1BDA8C1-7EE9-4533-B733-834533A261F4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"53dde8b387b5cd23f4abb2e117e873f60004406d","datavalue":{"value":"Nash equilibrium","type":"string"},"datatype":"string"},"type":"statement","id":"Q2205095$7D28758B-F45E-4088-B4F3-B50F8F40AD47","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a25438d64be1b848dc1acdf6eca18628d58da7d6","datavalue":{"value":"GBR algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2205095$16AD776A-3C9D-4CB2-A8DF-7AB9E33A6B9E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2205095$AD3AB1D6-0B9F-40C6-96F8-A7E20343E4B2","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"f183bbe77fd648f9cdb30cbc405b522e969875db","datavalue":{"value":"Q127280873","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2205095$65D62C1B-1F64-468E-83B1-25038BF313EF","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"999a244eeff07091eec72cdb1773616cc8add036","datavalue":{"value":{"entity-type":"item","numeric-id":5898471,"id":"Q5898471"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"83d31783d60bf6dfe762ad51f2ab37460ff423ec","datavalue":{"value":{"amount":"+0.7515903115272522","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2205095$75F3F0D4-01EA-4707-BA24-DD5D3C44944F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2f3c4cf9e3f43fdd8bb6aacc97a8015b87aadf7a","datavalue":{"value":{"entity-type":"item","numeric-id":4352985,"id":"Q4352985"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"7267fc8fcad6897e078da71b7f5f9577a30ae281","datavalue":{"value":{"amount":"+0.7443935871124268","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2205095$8AEB90F4-8490-4997-9FDB-DE545B831428","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9904e56d6c6095f919496ebaea51f23f0585d580","datavalue":{"value":{"entity-type":"item","numeric-id":5704208,"id":"Q5704208"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ae51cc5c2eb2307e4c8bf8ad77aaf6b7bbc25fbe","datavalue":{"value":{"amount":"+0.7368814945220947","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2205095$37C20C71-F8CF-436D-A382-425F17C7E5FF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0b18ef5aa99ba31c5c10494f2412beebb35b75b9","datavalue":{"value":{"entity-type":"item","numeric-id":4411202,"id":"Q4411202"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"276b7920ce739843b4aa6220307057dcbff49a69","datavalue":{"value":{"amount":"+0.7365836501121521","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2205095$EAB729D3-A0F0-40B7-A179-994CC18D76E0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8989119125856796cd8455b35b62d96e0df5d4c8","datavalue":{"value":{"entity-type":"item","numeric-id":4638926,"id":"Q4638926"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9cd1a7ddbd5f56d919281609dd5c39eba04804eb","datavalue":{"value":{"amount":"+0.7346510291099548","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2205095$0CC28798-E8E3-4AD8-A70E-798FCADBD80A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The efficiency of greedy best response algorithm in road traffic assignment","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_efficiency_of_greedy_best_response_algorithm_in_road_traffic_assignment"}}}}}