Publication type: | Conference paper |
Type of review: | Peer review (abstract) |
Title: | How to design loyalty programs : a conjoint analytical approach |
Authors: | Müller, Steffen |
Conference details: | 38th EMAC Annual Conference 2009, Nantes, France, 26-29 May 2009 |
Issue Date: | 2009 |
Publisher / Ed. Institution: | European Marketing Academy |
Language: | English |
Subjects: | Analytical; Program; Loyalty; Design |
Subject (DDC): | 658.8: Marketing management |
URI: | https://digitalcollection.zhaw.ch/handle/11475/14411 |
Fulltext version: | Published version |
License (according to publishing contract): | Licence according to publishing contract |
Departement: | School of Management and Law |
Organisational Unit: | Institute of Marketing Management (IMM) |
Appears in collections: | Publikationen School of Management and Law |
Files in This Item:
There are no files associated with this item.
Show full item record
Müller, S. (2009). How to design loyalty programs : a conjoint analytical approach. 38th EMAC Annual Conference 2009, Nantes, France, 26-29 May 2009.
Müller, S. (2009) ‘How to design loyalty programs : a conjoint analytical approach’, in 38th EMAC Annual Conference 2009, Nantes, France, 26-29 May 2009. European Marketing Academy.
S. Müller, “How to design loyalty programs : a conjoint analytical approach,” in 38th EMAC Annual Conference 2009, Nantes, France, 26-29 May 2009, 2009.
MÜLLER, Steffen, 2009. How to design loyalty programs : a conjoint analytical approach. In: 38th EMAC Annual Conference 2009, Nantes, France, 26-29 May 2009. Conference paper. European Marketing Academy. 2009
Müller, Steffen. 2009. “How to Design Loyalty Programs : A Conjoint Analytical Approach.” Conference paper. In 38th EMAC Annual Conference 2009, Nantes, France, 26-29 May 2009. European Marketing Academy.
Müller, Steffen. “How to Design Loyalty Programs : A Conjoint Analytical Approach.” 38th EMAC Annual Conference 2009, Nantes, France, 26-29 May 2009, European Marketing Academy, 2009.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.