A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features
A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public tra...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Gnecco, Giorgio [verfasserIn] Hadas, Yuval [verfasserIn] Sanguineti, Marcello [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022 |
|---|
| Rechteinformationen: |
Open Access Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International ; CC BY-NC-ND 4.0 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: EURO journal on transportation and logistics - Amsterdam, Niederlande : Elsevier, 2012, 11(2022), Artikel-ID 100090, Seite 1-18 |
|---|---|
| Übergeordnetes Werk: |
volume:11 ; year:2022 ; elocationid:100090 ; pages:1-18 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.ejtl.2022.100090 |
|---|
| Katalog-ID: |
183308070X |
|---|
| LEADER | 01000naa a2200265 4500 | ||
|---|---|---|---|
| 001 | 183308070X | ||
| 003 | DE-627 | ||
| 005 | 20230202150504.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 230202s2022 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.ejtl.2022.100090 |2 doi | |
| 035 | |a (DE-627)183308070X | ||
| 035 | |a (DE-599)KXP183308070X | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 100 | 1 | |a Gnecco, Giorgio |e verfasserin |4 aut | |
| 245 | 1 | 2 | |a A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features |c Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti |
| 264 | 1 | |c 2022 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 506 | 0 | |q DE-206 |a Open Access |e Controlled Vocabulary for Access Rights |u http://purl.org/coar/access_right/c_abf2 | |
| 520 | |a A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. | ||
| 540 | |q DE-206 |a Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International |f CC BY-NC-ND 4.0 |2 cc |u https://creativecommons.org/licenses/by-nc-nd/4.0/ | ||
| 650 | 4 | |a Public transportation systems |7 (dpeaa)DE-206 | |
| 650 | 4 | |a Analysis of transfers |7 (dpeaa)DE-206 | |
| 650 | 4 | |a Transferable utility games |7 (dpeaa)DE-206 | |
| 650 | 4 | |a Stochastic transfer times |7 (dpeaa)DE-206 | |
| 650 | 4 | |a Network reliability |7 (dpeaa)DE-206 | |
| 700 | 1 | |a Hadas, Yuval |e verfasserin |4 aut | |
| 700 | 1 | |a Sanguineti, Marcello |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t EURO journal on transportation and logistics |d Amsterdam, Niederlande : Elsevier, 2012 |g 11(2022), Artikel-ID 100090, Seite 1-18 |h Online-Ressource |w (DE-627)718610970 |w (DE-600)2660486-3 |w (DE-576)371983894 |x 2192-4384 |7 nnns |
| 773 | 1 | 8 | |g volume:11 |g year:2022 |g elocationid:100090 |g pages:1-18 |
| 856 | 4 | 0 | |u https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf |x Verlag |z kostenfrei |
| 856 | 4 | 0 | |u http://doi.org/10.1016/j.ejtl.2022.100090 |x Resolving-System |z kostenfrei |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ILN_26 | ||
| 912 | |a ISIL_DE-206 | ||
| 912 | |a SYSFLAG_1 | ||
| 912 | |a GBV_KXP | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_60 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_63 | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_69 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_73 | ||
| 912 | |a GBV_ILN_95 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_110 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_151 | ||
| 912 | |a GBV_ILN_161 | ||
| 912 | |a GBV_ILN_213 | ||
| 912 | |a GBV_ILN_230 | ||
| 912 | |a GBV_ILN_281 | ||
| 912 | |a GBV_ILN_285 | ||
| 912 | |a GBV_ILN_293 | ||
| 912 | |a GBV_ILN_370 | ||
| 912 | |a GBV_ILN_602 | ||
| 912 | |a GBV_ILN_2014 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4037 | ||
| 912 | |a GBV_ILN_4112 | ||
| 912 | |a GBV_ILN_4125 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4249 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4306 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4313 | ||
| 912 | |a GBV_ILN_4322 | ||
| 912 | |a GBV_ILN_4323 | ||
| 912 | |a GBV_ILN_4324 | ||
| 912 | |a GBV_ILN_4325 | ||
| 912 | |a GBV_ILN_4326 | ||
| 912 | |a GBV_ILN_4335 | ||
| 912 | |a GBV_ILN_4338 | ||
| 912 | |a GBV_ILN_4367 | ||
| 912 | |a GBV_ILN_4700 | ||
| 912 | |a GBV_ILN_2403 | ||
| 912 | |a GBV_ILN_2403 | ||
| 912 | |a ISIL_DE-LFER | ||
| 951 | |a AR | ||
| 952 | |d 11 |j 2022 |i 100090 |h 1-18 | ||
| 980 | |2 26 |1 01 |x 0206 |b 4262863115 |y x1z |z 02-02-23 | ||
| 980 | |2 2403 |1 01 |x DE-LFER |b 4269998172 |c 00 |f --%%-- |d --%%-- |e n |j --%%-- |y l01 |z 10-02-23 | ||
| 981 | |2 2403 |1 01 |x DE-LFER |r http://doi.org/10.1016/j.ejtl.2022.100090 | ||
| 981 | |2 2403 |1 01 |x DE-LFER |r https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf | ||
| author_variant |
g g gg y h yh m s ms |
|---|---|
| matchkey_str |
article:21924384:2022----::gmtertcprahorlaiiyvlainfulcrnprainrn |
| hierarchy_sort_str |
2022 |
| publishDate |
2022 |
| allfields |
10.1016/j.ejtl.2022.100090 doi (DE-627)183308070X (DE-599)KXP183308070X DE-627 ger DE-627 rda eng Gnecco, Giorgio verfasserin aut A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Public transportation systems (dpeaa)DE-206 Analysis of transfers (dpeaa)DE-206 Transferable utility games (dpeaa)DE-206 Stochastic transfer times (dpeaa)DE-206 Network reliability (dpeaa)DE-206 Hadas, Yuval verfasserin aut Sanguineti, Marcello verfasserin aut Enthalten in EURO journal on transportation and logistics Amsterdam, Niederlande : Elsevier, 2012 11(2022), Artikel-ID 100090, Seite 1-18 Online-Ressource (DE-627)718610970 (DE-600)2660486-3 (DE-576)371983894 2192-4384 nnns volume:11 year:2022 elocationid:100090 pages:1-18 https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf Verlag kostenfrei http://doi.org/10.1016/j.ejtl.2022.100090 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_151 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER AR 11 2022 100090 1-18 26 01 0206 4262863115 x1z 02-02-23 2403 01 DE-LFER 4269998172 00 --%%-- --%%-- n --%%-- l01 10-02-23 2403 01 DE-LFER http://doi.org/10.1016/j.ejtl.2022.100090 2403 01 DE-LFER https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf |
| spelling |
10.1016/j.ejtl.2022.100090 doi (DE-627)183308070X (DE-599)KXP183308070X DE-627 ger DE-627 rda eng Gnecco, Giorgio verfasserin aut A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Public transportation systems (dpeaa)DE-206 Analysis of transfers (dpeaa)DE-206 Transferable utility games (dpeaa)DE-206 Stochastic transfer times (dpeaa)DE-206 Network reliability (dpeaa)DE-206 Hadas, Yuval verfasserin aut Sanguineti, Marcello verfasserin aut Enthalten in EURO journal on transportation and logistics Amsterdam, Niederlande : Elsevier, 2012 11(2022), Artikel-ID 100090, Seite 1-18 Online-Ressource (DE-627)718610970 (DE-600)2660486-3 (DE-576)371983894 2192-4384 nnns volume:11 year:2022 elocationid:100090 pages:1-18 https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf Verlag kostenfrei http://doi.org/10.1016/j.ejtl.2022.100090 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_151 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER AR 11 2022 100090 1-18 26 01 0206 4262863115 x1z 02-02-23 2403 01 DE-LFER 4269998172 00 --%%-- --%%-- n --%%-- l01 10-02-23 2403 01 DE-LFER http://doi.org/10.1016/j.ejtl.2022.100090 2403 01 DE-LFER https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf |
| allfields_unstemmed |
10.1016/j.ejtl.2022.100090 doi (DE-627)183308070X (DE-599)KXP183308070X DE-627 ger DE-627 rda eng Gnecco, Giorgio verfasserin aut A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Public transportation systems (dpeaa)DE-206 Analysis of transfers (dpeaa)DE-206 Transferable utility games (dpeaa)DE-206 Stochastic transfer times (dpeaa)DE-206 Network reliability (dpeaa)DE-206 Hadas, Yuval verfasserin aut Sanguineti, Marcello verfasserin aut Enthalten in EURO journal on transportation and logistics Amsterdam, Niederlande : Elsevier, 2012 11(2022), Artikel-ID 100090, Seite 1-18 Online-Ressource (DE-627)718610970 (DE-600)2660486-3 (DE-576)371983894 2192-4384 nnns volume:11 year:2022 elocationid:100090 pages:1-18 https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf Verlag kostenfrei http://doi.org/10.1016/j.ejtl.2022.100090 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_151 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER AR 11 2022 100090 1-18 26 01 0206 4262863115 x1z 02-02-23 2403 01 DE-LFER 4269998172 00 --%%-- --%%-- n --%%-- l01 10-02-23 2403 01 DE-LFER http://doi.org/10.1016/j.ejtl.2022.100090 2403 01 DE-LFER https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf |
| allfieldsGer |
10.1016/j.ejtl.2022.100090 doi (DE-627)183308070X (DE-599)KXP183308070X DE-627 ger DE-627 rda eng Gnecco, Giorgio verfasserin aut A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Public transportation systems (dpeaa)DE-206 Analysis of transfers (dpeaa)DE-206 Transferable utility games (dpeaa)DE-206 Stochastic transfer times (dpeaa)DE-206 Network reliability (dpeaa)DE-206 Hadas, Yuval verfasserin aut Sanguineti, Marcello verfasserin aut Enthalten in EURO journal on transportation and logistics Amsterdam, Niederlande : Elsevier, 2012 11(2022), Artikel-ID 100090, Seite 1-18 Online-Ressource (DE-627)718610970 (DE-600)2660486-3 (DE-576)371983894 2192-4384 nnns volume:11 year:2022 elocationid:100090 pages:1-18 https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf Verlag kostenfrei http://doi.org/10.1016/j.ejtl.2022.100090 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_151 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER AR 11 2022 100090 1-18 26 01 0206 4262863115 x1z 02-02-23 2403 01 DE-LFER 4269998172 00 --%%-- --%%-- n --%%-- l01 10-02-23 2403 01 DE-LFER http://doi.org/10.1016/j.ejtl.2022.100090 2403 01 DE-LFER https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf |
| allfieldsSound |
10.1016/j.ejtl.2022.100090 doi (DE-627)183308070X (DE-599)KXP183308070X DE-627 ger DE-627 rda eng Gnecco, Giorgio verfasserin aut A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier DE-206 Open Access Controlled Vocabulary for Access Rights http://purl.org/coar/access_right/c_abf2 A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. DE-206 Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International CC BY-NC-ND 4.0 cc https://creativecommons.org/licenses/by-nc-nd/4.0/ Public transportation systems (dpeaa)DE-206 Analysis of transfers (dpeaa)DE-206 Transferable utility games (dpeaa)DE-206 Stochastic transfer times (dpeaa)DE-206 Network reliability (dpeaa)DE-206 Hadas, Yuval verfasserin aut Sanguineti, Marcello verfasserin aut Enthalten in EURO journal on transportation and logistics Amsterdam, Niederlande : Elsevier, 2012 11(2022), Artikel-ID 100090, Seite 1-18 Online-Ressource (DE-627)718610970 (DE-600)2660486-3 (DE-576)371983894 2192-4384 nnns volume:11 year:2022 elocationid:100090 pages:1-18 https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf Verlag kostenfrei http://doi.org/10.1016/j.ejtl.2022.100090 Resolving-System kostenfrei GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_151 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 GBV_ILN_2403 ISIL_DE-LFER AR 11 2022 100090 1-18 26 01 0206 4262863115 x1z 02-02-23 2403 01 DE-LFER 4269998172 00 --%%-- --%%-- n --%%-- l01 10-02-23 2403 01 DE-LFER http://doi.org/10.1016/j.ejtl.2022.100090 2403 01 DE-LFER https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf |
| language |
English |
| source |
Enthalten in EURO journal on transportation and logistics 11(2022), Artikel-ID 100090, Seite 1-18 volume:11 year:2022 elocationid:100090 pages:1-18 |
| sourceStr |
Enthalten in EURO journal on transportation and logistics 11(2022), Artikel-ID 100090, Seite 1-18 volume:11 year:2022 elocationid:100090 pages:1-18 |
| format_phy_str_mv |
Article |
| building |
26:1 2403:0 |
| institution |
findex.gbv.de |
| selectbib_iln_str_mv |
26@1z 2403@01 |
| topic_facet |
Public transportation systems Analysis of transfers Transferable utility games Stochastic transfer times Network reliability |
| isfreeaccess_bool |
true |
| container_title |
EURO journal on transportation and logistics |
| authorswithroles_txt_mv |
Gnecco, Giorgio @@aut@@ Hadas, Yuval @@aut@@ Sanguineti, Marcello @@aut@@ |
| publishDateDaySort_date |
2022-01-01T00:00:00Z |
| hierarchy_top_id |
718610970 |
| id |
183308070X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a2200265 4500</leader><controlfield tag="001">183308070X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230202150504.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230202s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.ejtl.2022.100090</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)183308070X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP183308070X</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gnecco, Giorgio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features</subfield><subfield code="c">Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="q">DE-206</subfield><subfield code="a">Open Access</subfield><subfield code="e">Controlled Vocabulary for Access Rights</subfield><subfield code="u">http://purl.org/coar/access_right/c_abf2</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="q">DE-206</subfield><subfield code="a">Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International</subfield><subfield code="f">CC BY-NC-ND 4.0</subfield><subfield code="2">cc</subfield><subfield code="u">https://creativecommons.org/licenses/by-nc-nd/4.0/</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Public transportation systems</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analysis of transfers</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transferable utility games</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic transfer times</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network reliability</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hadas, Yuval</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sanguineti, Marcello</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">EURO journal on transportation and logistics</subfield><subfield code="d">Amsterdam, Niederlande : Elsevier, 2012</subfield><subfield code="g">11(2022), Artikel-ID 100090, Seite 1-18</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)718610970</subfield><subfield code="w">(DE-600)2660486-3</subfield><subfield code="w">(DE-576)371983894</subfield><subfield code="x">2192-4384</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2022</subfield><subfield code="g">elocationid:100090</subfield><subfield code="g">pages:1-18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://doi.org/10.1016/j.ejtl.2022.100090</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2403</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2403</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-LFER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2022</subfield><subfield code="i">100090</subfield><subfield code="h">1-18</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">4262863115</subfield><subfield code="y">x1z</subfield><subfield code="z">02-02-23</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="b">4269998172</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">--%%--</subfield><subfield code="e">n</subfield><subfield code="j">--%%--</subfield><subfield code="y">l01</subfield><subfield code="z">10-02-23</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="r">http://doi.org/10.1016/j.ejtl.2022.100090</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="r">https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf</subfield></datafield></record></collection>
|
| standort_str_mv |
--%%-- |
| standort_iln_str_mv |
2403:--%%-- DE-LFER:--%%-- |
| author |
Gnecco, Giorgio |
| spellingShingle |
Gnecco, Giorgio misc Public transportation systems misc Analysis of transfers misc Transferable utility games misc Stochastic transfer times misc Network reliability A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features |
| authorStr |
Gnecco, Giorgio |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)718610970 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
KXP GVK SWB |
| remote_str |
true |
| last_changed_iln_str_mv |
26@02-02-23 2403@10-02-23 |
| illustrated |
Not Illustrated |
| issn |
2192-4384 |
| topic_title |
A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti Public transportation systems (dpeaa)DE-206 Analysis of transfers (dpeaa)DE-206 Transferable utility games (dpeaa)DE-206 Stochastic transfer times (dpeaa)DE-206 Network reliability (dpeaa)DE-206 |
| topic |
misc Public transportation systems misc Analysis of transfers misc Transferable utility games misc Stochastic transfer times misc Network reliability |
| topic_unstemmed |
misc Public transportation systems misc Analysis of transfers misc Transferable utility games misc Stochastic transfer times misc Network reliability |
| topic_browse |
misc Public transportation systems misc Analysis of transfers misc Transferable utility games misc Stochastic transfer times misc Network reliability |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| standort_txtP_mv |
--%%-- |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
EURO journal on transportation and logistics |
| hierarchy_parent_id |
718610970 |
| signature |
--%%-- |
| signature_str_mv |
--%%-- |
| hierarchy_top_title |
EURO journal on transportation and logistics |
| isfreeaccess_txt |
true |
| familylinks_str_mv |
(DE-627)718610970 (DE-600)2660486-3 (DE-576)371983894 |
| title |
A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features |
| ctrlnum |
(DE-627)183308070X (DE-599)KXP183308070X |
| title_full |
A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti |
| author_sort |
Gnecco, Giorgio |
| journal |
EURO journal on transportation and logistics |
| journalStr |
EURO journal on transportation and logistics |
| callnumber-first-code |
- |
| lang_code |
eng |
| isOA_bool |
true |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
txt |
| container_start_page |
1 |
| author_browse |
Gnecco, Giorgio Hadas, Yuval Sanguineti, Marcello |
| selectkey |
26:x 2403:l |
| container_volume |
11 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Gnecco, Giorgio |
| doi_str_mv |
10.1016/j.ejtl.2022.100090 |
| author2-role |
verfasserin |
| title_sort |
game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features |
| title_auth |
A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features |
| abstract |
A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. |
| abstractGer |
A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. |
| abstract_unstemmed |
A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. |
| collection_details |
GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_151 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 GBV_ILN_2403 ISIL_DE-LFER |
| title_short |
A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features |
| url |
https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf http://doi.org/10.1016/j.ejtl.2022.100090 |
| ausleihindikator_str_mv |
26 2403:n |
| remote_bool |
true |
| author2 |
Hadas, Yuval Sanguineti, Marcello |
| author2Str |
Hadas, Yuval Sanguineti, Marcello |
| ppnlink |
718610970 |
| mediatype_str_mv |
c |
| isOA_txt |
true |
| hochschulschrift_bool |
false |
| doi_str |
10.1016/j.ejtl.2022.100090 |
| callnumber-a |
--%%-- |
| up_date |
2024-07-04T16:56:13.139Z |
| _version_ |
1803668342062448640 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a2200265 4500</leader><controlfield tag="001">183308070X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230202150504.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230202s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.ejtl.2022.100090</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)183308070X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP183308070X</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gnecco, Giorgio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A game-theoretic approach for reliability evaluation of public transportation transfers with stochastic features</subfield><subfield code="c">Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="q">DE-206</subfield><subfield code="a">Open Access</subfield><subfield code="e">Controlled Vocabulary for Access Rights</subfield><subfield code="u">http://purl.org/coar/access_right/c_abf2</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value - a solution concept in cooperative game theory - is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="q">DE-206</subfield><subfield code="a">Namensnennung - Nicht kommerziell - Keine Bearbeitungen 4.0 International</subfield><subfield code="f">CC BY-NC-ND 4.0</subfield><subfield code="2">cc</subfield><subfield code="u">https://creativecommons.org/licenses/by-nc-nd/4.0/</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Public transportation systems</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analysis of transfers</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Transferable utility games</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic transfer times</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network reliability</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hadas, Yuval</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sanguineti, Marcello</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">EURO journal on transportation and logistics</subfield><subfield code="d">Amsterdam, Niederlande : Elsevier, 2012</subfield><subfield code="g">11(2022), Artikel-ID 100090, Seite 1-18</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)718610970</subfield><subfield code="w">(DE-600)2660486-3</subfield><subfield code="w">(DE-576)371983894</subfield><subfield code="x">2192-4384</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2022</subfield><subfield code="g">elocationid:100090</subfield><subfield code="g">pages:1-18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://doi.org/10.1016/j.ejtl.2022.100090</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2403</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2403</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-LFER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2022</subfield><subfield code="i">100090</subfield><subfield code="h">1-18</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">4262863115</subfield><subfield code="y">x1z</subfield><subfield code="z">02-02-23</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="b">4269998172</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">--%%--</subfield><subfield code="e">n</subfield><subfield code="j">--%%--</subfield><subfield code="y">l01</subfield><subfield code="z">10-02-23</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="r">http://doi.org/10.1016/j.ejtl.2022.100090</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2403</subfield><subfield code="1">01</subfield><subfield code="x">DE-LFER</subfield><subfield code="r">https://www.sciencedirect.com/science/article/pii/S2192437622000152/pdfft?md5=0124c37761fc61ea6cb79a3bd2163169&pid=1-s2.0-S2192437622000152-main.pdf</subfield></datafield></record></collection>
|
| score |
7.3998127 |