Arbeitspapier
Finding the path(s) towards profitable e-commerce
Relying on a unique and arguably representative sample of transaction e-commerce companies, this paper takes a closer look at whether and how companies could be profitable on-line. This analysis clearly demonstrates that a non-trivial set of winners are emerging, which combine both strong operational excellence as well as fine-tuned to about 3 generic strategic postures.
- Language
-
Englisch
- Bibliographic citation
-
Series: Research Notes ; No. 7
- Classification
-
Wirtschaft
- Subject
-
E-tailing
Strategic Clusters
Post entry performance
E-Business
Online-Handel
Rentabilität
Schätzung
Welt
- Event
-
Geistige Schöpfung
- (who)
-
Bughin, Jacques
- Event
-
Veröffentlichung
- (who)
-
Deutsche Bank Research
- (where)
-
Frankfurt a. M.
- (when)
-
2003
- Handle
- Last update
-
10.03.2025, 11:45 AM CET
Data provider
This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- Bughin, Jacques
- Deutsche Bank Research
Time of origin
- 2003
Other Objects (12)
Finding Supported Paths in Heterogeneous Networks
Finding the Most Preferred Path
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Path Finding Strategies in Stochastic Networks
Lebanon : finding a path from deadlock to democracy
Classical and quantum dynamics : from classical paths to path integrals
Classical and quantum dynamics : from classical paths to path integrals
Classical and quantum dynamics : from classical paths to path integrals
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
IFSA-EUSFLAT - Fuzzy-enhanced path-finding algorithm for AGV roadmaps
Finding Supported Paths in Heterogeneous Networks
Finding the Most Preferred Path
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Path Finding Strategies in Stochastic Networks
Lebanon : finding a path from deadlock to democracy
Classical and quantum dynamics : from classical paths to path integrals
Classical and quantum dynamics : from classical paths to path integrals
Classical and quantum dynamics : from classical paths to path integrals
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
IFSA-EUSFLAT - Fuzzy-enhanced path-finding algorithm for AGV roadmaps
Finding Supported Paths in Heterogeneous Networks
Finding the Most Preferred Path
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Path Finding Strategies in Stochastic Networks
Lebanon : finding a path from deadlock to democracy
Classical and quantum dynamics : from classical paths to path integrals
Classical and quantum dynamics : from classical paths to path integrals
Classical and quantum dynamics : from classical paths to path integrals
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap