[{"date_updated":"2023-05-16T15:57:32Z","publication_status":"published","intvolume":"       249","year":"2019","title":"The value of signals: Do self-declaration and certification generate price premiums for organic and biodynamic wines?","publication_identifier":{"issn":["0959-6526"]},"author":[{"full_name":"Fanasch, Patrizia","first_name":"Patrizia","last_name":"Fanasch"},{"id":"16019","first_name":"Bernd","last_name":"Frick","full_name":"Frick, Bernd"}],"doi":"10.1016/j.jclepro.2019.119415","article_number":"119415","language":[{"iso":"eng"}],"publication":"Journal of Cleaner Production","type":"journal_article","keyword":["Industrial and Manufacturing Engineering","Strategy and Management","General Environmental Science","Renewable Energy","Sustainability and the Environment"],"date_created":"2023-05-16T15:56:34Z","status":"public","user_id":"18949","volume":249,"publisher":"Elsevier BV","_id":"44898","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - A4: SFB 901 - Subproject A4"}],"citation":{"mla":"Fanasch, Patrizia, and Bernd Frick. “The Value of Signals: Do Self-Declaration and Certification Generate Price Premiums for Organic and Biodynamic Wines?” <i>Journal of Cleaner Production</i>, vol. 249, 119415, Elsevier BV, 2019, doi:<a href=\"https://doi.org/10.1016/j.jclepro.2019.119415\">10.1016/j.jclepro.2019.119415</a>.","bibtex":"@article{Fanasch_Frick_2019, title={The value of signals: Do self-declaration and certification generate price premiums for organic and biodynamic wines?}, volume={249}, DOI={<a href=\"https://doi.org/10.1016/j.jclepro.2019.119415\">10.1016/j.jclepro.2019.119415</a>}, number={119415}, journal={Journal of Cleaner Production}, publisher={Elsevier BV}, author={Fanasch, Patrizia and Frick, Bernd}, year={2019} }","ama":"Fanasch P, Frick B. The value of signals: Do self-declaration and certification generate price premiums for organic and biodynamic wines? <i>Journal of Cleaner Production</i>. 2019;249. doi:<a href=\"https://doi.org/10.1016/j.jclepro.2019.119415\">10.1016/j.jclepro.2019.119415</a>","ieee":"P. Fanasch and B. Frick, “The value of signals: Do self-declaration and certification generate price premiums for organic and biodynamic wines?,” <i>Journal of Cleaner Production</i>, vol. 249, Art. no. 119415, 2019, doi: <a href=\"https://doi.org/10.1016/j.jclepro.2019.119415\">10.1016/j.jclepro.2019.119415</a>.","apa":"Fanasch, P., &#38; Frick, B. (2019). The value of signals: Do self-declaration and certification generate price premiums for organic and biodynamic wines? <i>Journal of Cleaner Production</i>, <i>249</i>, Article 119415. <a href=\"https://doi.org/10.1016/j.jclepro.2019.119415\">https://doi.org/10.1016/j.jclepro.2019.119415</a>","short":"P. Fanasch, B. Frick, Journal of Cleaner Production 249 (2019).","chicago":"Fanasch, Patrizia, and Bernd Frick. “The Value of Signals: Do Self-Declaration and Certification Generate Price Premiums for Organic and Biodynamic Wines?” <i>Journal of Cleaner Production</i> 249 (2019). <a href=\"https://doi.org/10.1016/j.jclepro.2019.119415\">https://doi.org/10.1016/j.jclepro.2019.119415</a>."}},{"author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"status":"public","title":"Intermediaries in Networks","year":"2019","date_updated":"2023-05-23T12:46:23Z","_id":"42296","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","supervisor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen","id":"20801"}],"citation":{"bibtex":"@book{N._2019, title={Intermediaries in Networks}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Intermediaries in Networks</i>. Universität Paderborn; 2019.","mla":"N., N. <i>Intermediaries in Networks</i>. Universität Paderborn, 2019.","chicago":"N., N. <i>Intermediaries in Networks</i>. Universität Paderborn, 2019.","short":"N. N., Intermediaries in Networks, Universität Paderborn, 2019.","ieee":"N. N., <i>Intermediaries in Networks</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Intermediaries in Networks</i>. Universität Paderborn."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"date_created":"2023-02-22T11:08:43Z","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"mastersthesis"},{"title":"Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode","year":"2019","status":"public","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}],"date_updated":"2023-05-23T12:47:33Z","_id":"42286","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"477","citation":{"ieee":"N. N., <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn.","short":"N. N., Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode, Universität Paderborn, 2019.","chicago":"N., N. <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn, 2019.","mla":"N., N. <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn; 2019."},"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"date_created":"2023-02-22T10:59:24Z","type":"bachelorsthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}]},{"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"mastersthesis","date_created":"2023-02-22T11:02:24Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"supervisor":[{"id":"20801","first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"}],"citation":{"ama":"N. N. <i>Stability in Two-Sided Matchings with Asymmetric Information</i>. Universität Paderborn; 2019.","bibtex":"@book{N._2019, title={Stability in two-sided matchings with asymmetric information}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","mla":"N., N. <i>Stability in Two-Sided Matchings with Asymmetric Information</i>. Universität Paderborn, 2019.","chicago":"N., N. <i>Stability in Two-Sided Matchings with Asymmetric Information</i>. Universität Paderborn, 2019.","short":"N. N., Stability in Two-Sided Matchings with Asymmetric Information, Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Stability in two-sided matchings with asymmetric information</i>. Universität Paderborn.","ieee":"N. N., <i>Stability in two-sided matchings with asymmetric information</i>. Universität Paderborn, 2019."},"user_id":"477","_id":"42290","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"date_updated":"2023-05-23T12:47:20Z","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}],"title":"Stability in two-sided matchings with asymmetric information","year":"2019","status":"public"},{"year":"2019","status":"public","title":"Sincere and Sophisticated Players in Matching Markets","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"date_updated":"2023-05-23T12:47:13Z","_id":"42289","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","citation":{"mla":"N., N. <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn; 2019.","bibtex":"@book{N._2019, title={Sincere and Sophisticated Players in Matching Markets}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","apa":"N., N. (2019). <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn.","ieee":"N. N., <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn, 2019.","short":"N. N., Sincere and Sophisticated Players in Matching Markets, Universität Paderborn, 2019.","chicago":"N., N. <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn, 2019."},"supervisor":[{"id":"20801","last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"date_created":"2023-02-22T11:01:30Z","type":"mastersthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}]},{"author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}],"year":"2019","status":"public","title":"Mechanismen zur Informationsgewinnung in Verhandlungen","date_updated":"2023-05-23T12:47:05Z","_id":"42291","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"477","citation":{"ieee":"N. N., <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn.","short":"N. N., Mechanismen zur Informationsgewinnung in Verhandlungen, Universität Paderborn, 2019.","chicago":"N., N. <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn, 2019.","mla":"N., N. <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Mechanismen zur Informationsgewinnung in Verhandlungen}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn; 2019."},"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"date_created":"2023-02-22T11:03:32Z","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"mastersthesis"},{"title":"Die faire Verteilung unteilbarer Güter","status":"public","year":"2019","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"date_updated":"2023-05-23T12:47:26Z","language":[{"iso":"ger"}],"_id":"42288","publisher":"Universität Paderborn","user_id":"477","supervisor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801"}],"citation":{"mla":"N., N. <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Die faire Verteilung unteilbarer Güter}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn; 2019.","ieee":"N. N., <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn.","chicago":"N., N. <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn, 2019.","short":"N. N., Die faire Verteilung unteilbarer Güter, Universität Paderborn, 2019."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"date_created":"2023-02-22T11:00:16Z","type":"bachelorsthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}]},{"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake"}],"citation":{"chicago":"N., N. <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn, 2019.","short":"N. N., Axiomatisierungen des Banzhaf-Wertes, Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn.","ieee":"N. N., <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn; 2019.","bibtex":"@book{N._2019, title={Axiomatisierungen des Banzhaf-Wertes}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","mla":"N., N. <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn, 2019."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"date_created":"2023-02-22T11:07:53Z","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"bachelorsthesis","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"status":"public","title":"Axiomatisierungen des Banzhaf-Wertes","year":"2019","date_updated":"2023-05-23T12:46:37Z","publisher":"Universität Paderborn","_id":"42295","language":[{"iso":"ger"}],"user_id":"477"},{"user_id":"477","_id":"42293","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","date_updated":"2023-05-23T12:46:51Z","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}],"status":"public","year":"2019","title":"Compatibilities in Matching Mechanisms","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"mastersthesis","date_created":"2023-02-22T11:05:59Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"citation":{"bibtex":"@book{N._2019, title={Compatibilities in Matching Mechanisms}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn; 2019.","mla":"N., N. <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn, 2019.","chicago":"N., N. <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn, 2019.","short":"N. N., Compatibilities in Matching Mechanisms, Universität Paderborn, 2019.","ieee":"N. N., <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn."},"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake"}]},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"citation":{"ieee":"N. N., <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn.","short":"N. N., Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit, Universität Paderborn, 2019.","chicago":"N., N. <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn, 2019.","mla":"N., N. <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn; 2019."},"supervisor":[{"id":"20801","first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"}],"type":"bachelorsthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"date_created":"2023-02-22T10:56:40Z","date_updated":"2023-05-23T12:47:46Z","year":"2019","status":"public","title":"Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit","author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}],"user_id":"477","language":[{"iso":"ger"}],"_id":"42284","publisher":"Universität Paderborn"},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"citation":{"apa":"N., N. (2019). <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn.","ieee":"N. N., <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn, 2019.","short":"N. N., Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem, Universität Paderborn, 2019.","chicago":"N., N. <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn, 2019.","mla":"N., N. <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn; 2019.","bibtex":"@book{N._2019, title={Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }"},"supervisor":[{"id":"20801","last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"}],"type":"mastersthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"date_created":"2023-02-22T10:52:19Z","date_updated":"2023-05-23T12:48:04Z","year":"2019","title":"Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem","status":"public","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"user_id":"477","language":[{"iso":"ger"}],"_id":"42280","publisher":"Universität Paderborn"},{"type":"bachelorsthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"date_created":"2023-02-22T10:58:10Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"citation":{"ieee":"N. N., <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn.","short":"N. N., Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse, Universität Paderborn, 2019.","chicago":"N., N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn, 2019.","mla":"N., N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn; 2019."},"supervisor":[{"id":"20801","first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"}],"user_id":"477","language":[{"iso":"ger"}],"_id":"42285","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:47:40Z","title":"Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse","year":"2019","status":"public","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}]},{"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"mastersthesis","date_created":"2023-02-22T10:53:58Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake","id":"20801"}],"citation":{"mla":"N., N. <i>A Bargaining Model for Relative Profit and Market Share Delegation Contracts</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={A bargaining model for relative profit and market share delegation contracts}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>A Bargaining Model for Relative Profit and Market Share Delegation Contracts</i>. Universität Paderborn; 2019.","ieee":"N. N., <i>A bargaining model for relative profit and market share delegation contracts</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>A bargaining model for relative profit and market share delegation contracts</i>. Universität Paderborn.","chicago":"N., N. <i>A Bargaining Model for Relative Profit and Market Share Delegation Contracts</i>. Universität Paderborn, 2019.","short":"N. N., A Bargaining Model for Relative Profit and Market Share Delegation Contracts, Universität Paderborn, 2019."},"user_id":"477","language":[{"iso":"eng"}],"_id":"42281","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:47:58Z","author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}],"status":"public","year":"2019","title":"A bargaining model for relative profit and market share delegation contracts"},{"author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"year":"2019","status":"public","title":"Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden","date_updated":"2023-05-23T12:48:17Z","_id":"41926","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"477","citation":{"ieee":"N. N., <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn.","short":"N. N., Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden, Universität Paderborn, 2019.","chicago":"N., N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn, 2019.","mla":"N., N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn; 2019."},"supervisor":[{"id":"20801","first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"date_created":"2023-02-09T09:23:13Z","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"bachelorsthesis"},{"date_updated":"2023-05-23T12:48:10Z","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"year":"2019","status":"public","title":"Der Shapley-Wert als Index für phylogenetische Diversität","user_id":"477","publisher":"Universität Paderborn","_id":"42277","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"citation":{"short":"N. N., Der Shapley-Wert als Index für phylogenetische Diversität, Universität Paderborn, 2019.","chicago":"N., N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn, 2019.","ieee":"N. N., <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn.","bibtex":"@book{N._2019, title={Der Shapley-Wert als Index für phylogenetische Diversität}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn; 2019.","mla":"N., N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn, 2019."},"supervisor":[{"id":"20801","first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"}],"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"bachelorsthesis","date_created":"2023-02-22T10:49:08Z"},{"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"bachelorsthesis","date_created":"2023-02-22T10:55:19Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"citation":{"chicago":"N., N. <i>Student’s School Matching Mechanisms in the US</i>. Universität Paderborn, 2019.","short":"N. N., Student’s School Matching Mechanisms in the US, Universität Paderborn, 2019.","ieee":"N. N., <i>Student’s school matching mechanisms in the US</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Student’s school matching mechanisms in the US</i>. Universität Paderborn.","bibtex":"@book{N._2019, title={Student’s school matching mechanisms in the US}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Student’s School Matching Mechanisms in the US</i>. Universität Paderborn; 2019.","mla":"N., N. <i>Student’s School Matching Mechanisms in the US</i>. Universität Paderborn, 2019."},"supervisor":[{"id":"20801","last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"}],"user_id":"477","_id":"42283","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"date_updated":"2023-05-23T12:47:52Z","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"status":"public","title":"Student's school matching mechanisms in the US","year":"2019"},{"user_id":"47208","language":[{"iso":"eng"}],"_id":"45231","date_updated":"2023-05-23T13:00:49Z","author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}],"year":"2019","status":"public","title":"Conception of a digital Sales Bonus System based on Blockchain Technology","department":[{"_id":"66"}],"type":"bachelorsthesis","date_created":"2023-05-23T13:00:40Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"}],"supervisor":[{"full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","first_name":"Thim Frederik","id":"11319"},{"last_name":"Gottschalk","first_name":"Sebastian","full_name":"Gottschalk, Sebastian","id":"47208"}],"citation":{"mla":"N., N. <i>Conception of a Digital Sales Bonus System Based on Blockchain Technology</i>. 2019.","ama":"N. N. <i>Conception of a Digital Sales Bonus System Based on Blockchain Technology</i>.; 2019.","bibtex":"@book{N._2019, title={Conception of a digital Sales Bonus System based on Blockchain Technology}, author={N., N.}, year={2019} }","apa":"N., N. (2019). <i>Conception of a digital Sales Bonus System based on Blockchain Technology</i>.","ieee":"N. N., <i>Conception of a digital Sales Bonus System based on Blockchain Technology</i>. 2019.","short":"N. N., Conception of a Digital Sales Bonus System Based on Blockchain Technology, 2019.","chicago":"N., N. <i>Conception of a Digital Sales Bonus System Based on Blockchain Technology</i>, 2019."}},{"project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"}],"citation":{"chicago":"Schubert, Philipp, Richard Leer, Ben Hermann, and Eric Bodden. “Know Your Analysis: How Instrumentation Aids Understanding Static Analysis.” In <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>, 2019. <a href=\"https://doi.org/10.1145/3315568.3329965\">https://doi.org/10.1145/3315568.3329965</a>.","ama":"Schubert P, Leer R, Hermann B, Bodden E. Know your analysis: how instrumentation aids understanding static analysis. In: <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>. ; 2019. doi:<a href=\"https://doi.org/10.1145/3315568.3329965\">10.1145/3315568.3329965</a>","short":"P. Schubert, R. Leer, B. Hermann, E. Bodden, in: Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019, 2019.","bibtex":"@inproceedings{Schubert_Leer_Hermann_Bodden_2019, title={Know your analysis: how instrumentation aids understanding static analysis}, DOI={<a href=\"https://doi.org/10.1145/3315568.3329965\">10.1145/3315568.3329965</a>}, booktitle={Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019}, author={Schubert, Philipp and Leer, Richard and Hermann, Ben and Bodden, Eric}, year={2019} }","apa":"Schubert, P., Leer, R., Hermann, B., &#38; Bodden, E. (2019). Know your analysis: how instrumentation aids understanding static analysis. <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>. <a href=\"https://doi.org/10.1145/3315568.3329965\">https://doi.org/10.1145/3315568.3329965</a>","mla":"Schubert, Philipp, et al. “Know Your Analysis: How Instrumentation Aids Understanding Static Analysis.” <i>Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019</i>, 2019, doi:<a href=\"https://doi.org/10.1145/3315568.3329965\">10.1145/3315568.3329965</a>.","ieee":"P. Schubert, R. Leer, B. Hermann, and E. Bodden, “Know your analysis: how instrumentation aids understanding static analysis,” 2019, doi: <a href=\"https://doi.org/10.1145/3315568.3329965\">10.1145/3315568.3329965</a>."},"publication":"Proceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis  - SOAP 2019","department":[{"_id":"76"},{"_id":"34"},{"_id":"26"}],"type":"conference","date_created":"2019-11-12T12:22:16Z","publication_status":"published","date_updated":"2023-06-15T08:52:37Z","publication_identifier":{"isbn":["9781450367202"]},"author":[{"id":"60543","full_name":"Schubert, Philipp","last_name":"Schubert","first_name":"Philipp","orcid":"0000-0002-8674-1859"},{"last_name":"Leer","first_name":"Richard","full_name":"Leer, Richard"},{"orcid":"0000-0001-9848-2017","last_name":"Hermann","first_name":"Ben","full_name":"Hermann, Ben","id":"66173"},{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256"}],"status":"public","year":"2019","title":"Know your analysis: how instrumentation aids understanding static analysis","user_id":"15249","doi":"10.1145/3315568.3329965","language":[{"iso":"eng"}],"_id":"14898"},{"oa":"1","citation":{"mla":"Lienen, Christian. <i>Implementing a Real-Time System on a Platform FPGA Operated with ReconOS</i>. Universität Paderborn.","bibtex":"@book{Lienen, title={Implementing a Real-time System on a Platform FPGA operated with ReconOS}, publisher={Universität Paderborn}, author={Lienen, Christian} }","ama":"Lienen C. <i>Implementing a Real-Time System on a Platform FPGA Operated with ReconOS</i>. Universität Paderborn","ieee":"C. Lienen, <i>Implementing a Real-time System on a Platform FPGA operated with ReconOS</i>. Universität Paderborn.","apa":"Lienen, C. (n.d.). <i>Implementing a Real-time System on a Platform FPGA operated with ReconOS</i>. Universität Paderborn.","short":"C. Lienen, Implementing a Real-Time System on a Platform FPGA Operated with ReconOS, Universität Paderborn, n.d.","chicago":"Lienen, Christian. <i>Implementing a Real-Time System on a Platform FPGA Operated with ReconOS</i>. Universität Paderborn, n.d."},"supervisor":[{"id":"74287","full_name":"Clausing, Lennart","last_name":"Clausing","orcid":"0000-0003-3789-6034","first_name":"Lennart"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"},{"full_name":"Hellebrand, Sybille","last_name":"Hellebrand","orcid":"0000-0002-3717-3939","first_name":"Sybille","id":"209"}],"file_date_updated":"2021-02-13T16:46:58Z","project":[{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"}],"publisher":"Universität Paderborn","_id":"15874","user_id":"60323","ddc":["004"],"status":"public","has_accepted_license":"1","date_created":"2020-02-11T10:22:06Z","file":[{"content_type":"application/pdf","file_id":"17351","file_size":5920668,"access_level":"open_access","file_name":"thesis_main.pdf","date_updated":"2021-02-13T16:46:58Z","relation":"main_file","date_created":"2020-07-01T11:46:49Z","creator":"clienen"}],"department":[{"_id":"78"}],"type":"mastersthesis","language":[{"iso":"eng"}],"author":[{"id":"60323","last_name":"Lienen","first_name":"Christian","full_name":"Lienen, Christian"}],"year":"2019","title":"Implementing a Real-time System on a Platform FPGA operated with ReconOS","publication_status":"submitted","date_updated":"2023-07-31T11:58:50Z"},{"file_date_updated":"2018-11-06T15:08:39Z","citation":{"ieee":"F. Mohr, M. D. Wever, E. Hüllermeier, and A. Faez, “(WIP) Towards the Automated Composition of Machine Learning Services,” in <i>SCC</i>, San Francisco, CA, USA, 2018.","apa":"Mohr, F., Wever, M. D., Hüllermeier, E., &#38; Faez, A. (2018). (WIP) Towards the Automated Composition of Machine Learning Services. In <i>SCC</i>. San Francisco, CA, USA: IEEE. <a href=\"https://doi.org/10.1109/SCC.2018.00039\">https://doi.org/10.1109/SCC.2018.00039</a>","short":"F. Mohr, M.D. Wever, E. Hüllermeier, A. Faez, in: SCC, IEEE, San Francisco, CA, USA, 2018.","chicago":"Mohr, Felix, Marcel Dominik Wever, Eyke Hüllermeier, and Amin Faez. “(WIP) Towards the Automated Composition of Machine Learning Services.” In <i>SCC</i>. San Francisco, CA, USA: IEEE, 2018. <a href=\"https://doi.org/10.1109/SCC.2018.00039\">https://doi.org/10.1109/SCC.2018.00039</a>.","mla":"Mohr, Felix, et al. “(WIP) Towards the Automated Composition of Machine Learning Services.” <i>SCC</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/SCC.2018.00039\">10.1109/SCC.2018.00039</a>.","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier_Faez_2018, place={San Francisco, CA, USA}, title={(WIP) Towards the Automated Composition of Machine Learning Services}, DOI={<a href=\"https://doi.org/10.1109/SCC.2018.00039\">10.1109/SCC.2018.00039</a>}, booktitle={SCC}, publisher={IEEE}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke and Faez, Amin}, year={2018} }","ama":"Mohr F, Wever MD, Hüllermeier E, Faez A. (WIP) Towards the Automated Composition of Machine Learning Services. In: <i>SCC</i>. San Francisco, CA, USA: IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/SCC.2018.00039\">10.1109/SCC.2018.00039</a>"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"place":"San Francisco, CA, USA","oa":"1","status":"public","conference":{"location":"San Francisco, CA, USA","name":"IEEE International Conference on Services Computing, SCC 2018","start_date":"2018-07-02","end_date":"2018-07-07"},"has_accepted_license":"1","publisher":"IEEE","_id":"2479","ddc":["000"],"user_id":"49109","publication":"SCC","file":[{"date_created":"2018-11-06T15:08:39Z","creator":"wever","content_type":"application/pdf","file_id":"5382","access_level":"closed","file_size":237890,"file_name":"08456425.pdf","date_updated":"2018-11-06T15:08:39Z","relation":"main_file"}],"date_created":"2018-04-24T08:34:52Z","type":"conference","department":[{"_id":"355"}],"title":"(WIP) Towards the Automated Composition of Machine Learning Services","year":"2018","author":[{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"id":"33176","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke","id":"48129"},{"last_name":"Faez","first_name":"Amin","full_name":"Faez, Amin"}],"date_updated":"2022-01-06T06:56:35Z","publication_status":"published","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8456425","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1109/SCC.2018.00039"}]