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.
- Sprache
-
Englisch
- Erschienen in
-
Series: Research Notes ; No. 7
- Klassifikation
-
Wirtschaft
- Thema
-
E-tailing
Strategic Clusters
Post entry performance
E-Business
Online-Handel
Rentabilität
Schätzung
Welt
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Bughin, Jacques
- Ereignis
-
Veröffentlichung
- (wer)
-
Deutsche Bank Research
- (wo)
-
Frankfurt a. M.
- (wann)
-
2003
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:45 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Bughin, Jacques
- Deutsche Bank Research
Entstanden
- 2003
Ähnliche Objekte (12)
Finding Supported Paths in Heterogeneous Networks
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k-shortest paths with limited overlap
Finding Temporal Paths Under Waiting Time Constraints
Finding the Most Preferred Path
Path Finding Strategies in Stochastic Networks
Profitabel.
Finding relevant semantic association paths through user-specific intermediate entities
Finding k Shortest Paths in Cayley Graphs of Finite Groups
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Finding Supported Paths in Heterogeneous Networks
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k-shortest paths with limited overlap
Finding Temporal Paths Under Waiting Time Constraints
Finding the Most Preferred Path
Path Finding Strategies in Stochastic Networks
Profitabel.
Finding relevant semantic association paths through user-specific intermediate entities
Finding k Shortest Paths in Cayley Graphs of Finite Groups
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Finding Supported Paths in Heterogeneous Networks
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k-shortest paths with limited overlap
Finding Temporal Paths Under Waiting Time Constraints
Finding the Most Preferred Path
Path Finding Strategies in Stochastic Networks
Profitabel.
Finding relevant semantic association paths through user-specific intermediate entities
Finding k Shortest Paths in Cayley Graphs of Finite Groups