[{"abstract":[{"text":"We introduce weighted boolean formula games (WBFG) as a new class of succinct games. Each player has a set of boolean formulas she wants to get satisfied; the formulas involve a ground set of boolean variables each of which is controlled by some player. The payoff of a player is a weighted sum of the values of her formulas. We consider both pure equilibria and their refinement of payoff-dominant equilibria [34], where every player is no worse-off than in any other pure equilibrium. We present both structural and complexity results:We consider mutual weighted boolean formula games (MWBFG), a subclass of WBFG making a natural mutuality assumption on the formulas of players. We present a very simple exact potential for MWBFG. We establish a polynomial monomorphism from certain classes of weighted congestion games to subclasses of WBFG and MWBFG, respectively, indicating their rich structure.We present a collection of complexity results about decision (and search) problems for both pure and payoff-dominant equilibria in WBFG. The precise complexities depend crucially on five parameters: (i) the number of players; (ii) the number of variables per player; (iii) the number of formulas per player; (iv) the weights in the payoff functions (whether identical or not), and (v) the syntax of the formulas. These results imply that, unless the polynomial hierarchy collapses, decision (and search) problems for payoff-dominant equilibria are harde than for pure equilibria.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1502","access_level":"closed","file_name":"232-chp_3A10.1007_2F978-3-319-24024-4_6.pdf","file_size":500543,"date_created":"2018-03-21T10:30:47Z","creator":"florida","date_updated":"2018-03-21T10:30:47Z"}],"status":"public","type":"conference","publication":"the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday","ddc":["040"],"file_date_updated":"2018-03-21T10:30:47Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"232","series_title":"LNCS","user_id":"15504","year":"2015","citation":{"chicago":"Monien, Burkhard, Marios Mavronicolas, and Klaus Wagner. “Weighted Boolean Formula Games.” In <i>The ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday</i>, 49–86. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-24024-4_6\">https://doi.org/10.1007/978-3-319-24024-4_6</a>.","ieee":"B. Monien, M. Mavronicolas, and K. Wagner, “Weighted Boolean Formula Games,” in <i>the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday</i>, 2015, pp. 49–86.","ama":"Monien B, Mavronicolas M, Wagner K. Weighted Boolean Formula Games. In: <i>The ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday</i>. LNCS. ; 2015:49-86. doi:<a href=\"https://doi.org/10.1007/978-3-319-24024-4_6\">10.1007/978-3-319-24024-4_6</a>","short":"B. Monien, M. Mavronicolas, K. Wagner, in: The ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday, 2015, pp. 49–86.","bibtex":"@inproceedings{Monien_Mavronicolas_Wagner_2015, series={LNCS}, title={Weighted Boolean Formula Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-24024-4_6\">10.1007/978-3-319-24024-4_6</a>}, booktitle={the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday}, author={Monien, Burkhard and Mavronicolas, Marios and Wagner, Klaus}, year={2015}, pages={49–86}, collection={LNCS} }","mla":"Monien, Burkhard, et al. “Weighted Boolean Formula Games.” <i>The ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday</i>, 2015, pp. 49–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-24024-4_6\">10.1007/978-3-319-24024-4_6</a>.","apa":"Monien, B., Mavronicolas, M., &#38; Wagner, K. (2015). Weighted Boolean Formula Games. In <i>the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday</i> (pp. 49–86). <a href=\"https://doi.org/10.1007/978-3-319-24024-4_6\">https://doi.org/10.1007/978-3-319-24024-4_6</a>"},"page":"49-86","has_accepted_license":"1","title":"Weighted Boolean Formula Games","doi":"10.1007/978-3-319-24024-4_6","date_updated":"2022-01-06T06:55:47Z","author":[{"last_name":"Monien","full_name":"Monien, Burkhard","first_name":"Burkhard"},{"first_name":"Marios","last_name":"Mavronicolas","full_name":"Mavronicolas, Marios"},{"first_name":"Klaus","full_name":"Wagner, Klaus","last_name":"Wagner"}],"date_created":"2017-10-17T12:41:37Z"},{"citation":{"ama":"Mikroökonomie L. <i>Bilateral Matching and Bargaining Games</i>. Universität Paderborn; 2015.","chicago":"Mikroökonomie, Lehrstuhl. <i>Bilateral Matching and Bargaining Games</i>. Universität Paderborn, 2015.","ieee":"L. Mikroökonomie, <i>Bilateral matching and bargaining games</i>. Universität Paderborn, 2015.","apa":"Mikroökonomie, L. (2015). <i>Bilateral matching and bargaining games</i>. Universität Paderborn.","short":"L. Mikroökonomie, Bilateral Matching and Bargaining Games, Universität Paderborn, 2015.","bibtex":"@book{Mikroökonomie_2015, title={Bilateral matching and bargaining games}, publisher={Universität Paderborn}, author={Mikroökonomie, Lehrstuhl}, year={2015} }","mla":"Mikroökonomie, Lehrstuhl. <i>Bilateral Matching and Bargaining Games</i>. Universität Paderborn, 2015."},"year":"2015","author":[{"last_name":"Mikroökonomie","full_name":"Mikroökonomie, Lehrstuhl","first_name":"Lehrstuhl"}],"date_created":"2018-11-28T10:09:18Z","date_updated":"2022-01-06T07:02:47Z","publisher":"Universität Paderborn","title":"Bilateral matching and bargaining games","type":"mastersthesis","status":"public","user_id":"65453","department":[{"_id":"205"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5930","language":[{"iso":"eng"}]},{"file_date_updated":"2018-03-15T13:44:15Z","department":[{"_id":"205"},{"_id":"475"}],"user_id":"1112","_id":"491","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"journal_article","doi":"10.1016/j.ejor.2014.07.019","volume":240,"author":[{"first_name":"Berno","full_name":"Buechel, Berno","last_name":"Buechel"},{"full_name":"Röhl, Nils","last_name":"Röhl","first_name":"Nils"}],"date_updated":"2022-01-06T07:01:29Z","intvolume":"       240","page":"505-517","citation":{"apa":"Buechel, B., &#38; Röhl, N. (2015). Robust Equilibria in Location Games. <i>European Journal of Operational Research</i>, <i>240</i>(2), 505–517. <a href=\"https://doi.org/10.1016/j.ejor.2014.07.019\">https://doi.org/10.1016/j.ejor.2014.07.019</a>","short":"B. Buechel, N. Röhl, European Journal of Operational Research 240 (2015) 505–517.","bibtex":"@article{Buechel_Röhl_2015, title={Robust Equilibria in Location Games}, volume={240}, DOI={<a href=\"https://doi.org/10.1016/j.ejor.2014.07.019\">10.1016/j.ejor.2014.07.019</a>}, number={2}, journal={European Journal of Operational Research}, publisher={Elsevier}, author={Buechel, Berno and Röhl, Nils}, year={2015}, pages={505–517} }","mla":"Buechel, Berno, and Nils Röhl. “Robust Equilibria in Location Games.” <i>European Journal of Operational Research</i>, vol. 240, no. 2, Elsevier, 2015, pp. 505–17, doi:<a href=\"https://doi.org/10.1016/j.ejor.2014.07.019\">10.1016/j.ejor.2014.07.019</a>.","ama":"Buechel B, Röhl N. Robust Equilibria in Location Games. <i>European Journal of Operational Research</i>. 2015;240(2):505-517. doi:<a href=\"https://doi.org/10.1016/j.ejor.2014.07.019\">10.1016/j.ejor.2014.07.019</a>","ieee":"B. Buechel and N. Röhl, “Robust Equilibria in Location Games,” <i>European Journal of Operational Research</i>, vol. 240, no. 2, pp. 505–517, 2015.","chicago":"Buechel, Berno, and Nils Röhl. “Robust Equilibria in Location Games.” <i>European Journal of Operational Research</i> 240, no. 2 (2015): 505–17. <a href=\"https://doi.org/10.1016/j.ejor.2014.07.019\">https://doi.org/10.1016/j.ejor.2014.07.019</a>."},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T13:44:15Z","creator":"florida","date_created":"2018-03-15T13:44:15Z","file_size":389892,"access_level":"closed","file_id":"1316","file_name":"491-WP58.pdf"}],"abstract":[{"lang":"eng","text":"In the framework of spatial competition, two or more players strategically choose a locationin order to attract consumers. It is assumed standardly that consumers with the same favorite location fully agree on the ranking of all possible locations. To investigate the necessity of this questionable and restrictive assumption, we model heterogeneity in consumers’ distance perceptions by individual edge lengths of a given graph. A profile of location choices is called a “robust equilibrium” if it is a Nash equilibrium in several games which differ only by the consumers’ perceptions of distances. For a finite number of players and any distribution of consumers, we provide a full characterization of all robust equilibria and derive structural conditions for their existence. Furthermore, we discuss whether the classical observations of minimal differentiation and inefficiency are robust phenomena. Thereby, we find strong support for an old conjecture that in equilibrium firms form local clusters."}],"publication":"European Journal of Operational Research","title":"Robust Equilibria in Location Games","date_created":"2017-10-17T12:42:28Z","publisher":"Elsevier","year":"2015","issue":"2"},{"has_accepted_license":"1","page":"6122--6127","citation":{"apa":"Schwabe, A., &#38; Karl, H. (2015). Topology model to generate realistic latency for simulations. In <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i> (pp. 6122--6127). <a href=\"https://doi.org/10.1109/ICC.2015.7249298\">https://doi.org/10.1109/ICC.2015.7249298</a>","bibtex":"@inproceedings{Schwabe_Karl_2015, title={Topology model to generate realistic latency for simulations}, DOI={<a href=\"https://doi.org/10.1109/ICC.2015.7249298\">10.1109/ICC.2015.7249298</a>}, booktitle={2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={6122--6127} }","mla":"Schwabe, Arne, and Holger Karl. “Topology Model to Generate Realistic Latency for Simulations.” <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i>, 2015, pp. 6122--6127, doi:<a href=\"https://doi.org/10.1109/ICC.2015.7249298\">10.1109/ICC.2015.7249298</a>.","short":"A. Schwabe, H. Karl, in: 2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015, 2015, pp. 6122--6127.","ama":"Schwabe A, Karl H. Topology model to generate realistic latency for simulations. In: <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i>. ; 2015:6122--6127. doi:<a href=\"https://doi.org/10.1109/ICC.2015.7249298\">10.1109/ICC.2015.7249298</a>","chicago":"Schwabe, Arne, and Holger Karl. “Topology Model to Generate Realistic Latency for Simulations.” In <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i>, 6122--6127, 2015. <a href=\"https://doi.org/10.1109/ICC.2015.7249298\">https://doi.org/10.1109/ICC.2015.7249298</a>.","ieee":"A. Schwabe and H. Karl, “Topology model to generate realistic latency for simulations,” in <i>2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015</i>, 2015, pp. 6122--6127."},"year":"2015","date_created":"2017-11-27T10:22:25Z","author":[{"first_name":"Arne","full_name":"Schwabe, Arne","last_name":"Schwabe"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_updated":"2022-01-06T07:03:37Z","doi":"10.1109/ICC.2015.7249298","title":"Topology model to generate realistic latency for simulations","publication":"2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015","type":"conference","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":3386981,"access_level":"closed","file_name":"Schwabe07249298.pdf","file_id":"5260","date_updated":"2018-11-02T14:03:07Z","date_created":"2018-11-02T14:03:07Z","creator":"ups"}],"department":[{"_id":"75"}],"user_id":"477","_id":"743","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A2","_id":"6"}],"file_date_updated":"2018-11-02T14:03:07Z","language":[{"iso":"eng"}],"ddc":["000"]},{"language":[{"iso":"eng"}],"ddc":["040"],"publication":"Theory of Computing Systems","file":[{"file_size":638191,"file_id":"1255","file_name":"398-MEPV14_02.pdf","access_level":"closed","date_updated":"2018-03-15T08:22:31Z","creator":"florida","date_created":"2018-03-15T08:22:31Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuation V (mapping probability distributions to reals); such valuations are used to model risk. In contrast to games with expectation-optimizer players where mixed equilibria always exist (Nash 1950; Nash Ann. Math. 54, 286–295, 1951), a mixed equilibrium for such games, called a V-equilibrium, may fail to exist, even though pure equilibria (if any) transfer over. What is the exact impact of such valuations on the existence, structure and complexity of mixed equilibria? We address this fundamental question in the context of expectation plus variance, a particular concave valuation denoted as RA, which stands for risk-averse; so, variance enters as a measure of risk and it is used as an additive adjustment to expectation. We obtain the following results about RA-equilibria:A collection of general structural properties of RA-equilibria connecting to (i) E-equilibria and Var-equilibria, which correspond to the expectation and variance valuations E and Var, respectively, and to (ii) other weaker or incomparable properties such as Weak Equilibrium and Strong Equilibrium. Some of these structural properties imply quantitative constraints on the existence of mixed RA-equilibria.A second collection of (i) existence, (ii) equivalence and separation (with respect to E-equilibria), and (iii) characterization results for RA-equilibria in the new class of player-specific scheduling games. We provide suitable examples with a mixed RA-equilibrium that is not an E-equilibrium and vice versa.A purification technique to transform a player-specific scheduling game on two identical links into a player-specific scheduling game on two links so that all non-pure RA-equilibria are eliminated while no new pure equilibria are created; so, a particular player-specific scheduling game on two identical links with no pure equilibrium yields a player-specific scheduling game with no RA-equilibrium (whether mixed or pure). As a by-product, the first PLS-completeness result for the computation of RA-equilibria follows.","lang":"eng"}],"date_created":"2017-10-17T12:42:09Z","publisher":"Springer","title":"Minimizing Expectation Plus Variance","issue":"3","year":"2015","user_id":"42447","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"398","file_date_updated":"2018-03-15T08:22:31Z","type":"journal_article","status":"public","author":[{"full_name":"Monien, Burkhard","last_name":"Monien","first_name":"Burkhard"},{"last_name":"Mavronicolas","full_name":"Mavronicolas, Marios","first_name":"Marios"}],"volume":57,"date_updated":"2022-01-06T07:00:04Z","doi":"10.1007/s00224-014-9542-z","has_accepted_license":"1","citation":{"mla":"Monien, Burkhard, and Marios Mavronicolas. “Minimizing Expectation Plus Variance.” <i>Theory of Computing Systems</i>, vol. 57, no. 3, Springer, 2015, pp. 617–54, doi:<a href=\"https://doi.org/10.1007/s00224-014-9542-z\">10.1007/s00224-014-9542-z</a>.","short":"B. Monien, M. Mavronicolas, Theory of Computing Systems 57 (2015) 617–654.","bibtex":"@article{Monien_Mavronicolas_2015, title={Minimizing Expectation Plus Variance}, volume={57}, DOI={<a href=\"https://doi.org/10.1007/s00224-014-9542-z\">10.1007/s00224-014-9542-z</a>}, number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Monien, Burkhard and Mavronicolas, Marios}, year={2015}, pages={617–654} }","apa":"Monien, B., &#38; Mavronicolas, M. (2015). Minimizing Expectation Plus Variance. <i>Theory of Computing Systems</i>, <i>57</i>(3), 617–654. <a href=\"https://doi.org/10.1007/s00224-014-9542-z\">https://doi.org/10.1007/s00224-014-9542-z</a>","ieee":"B. Monien and M. Mavronicolas, “Minimizing Expectation Plus Variance,” <i>Theory of Computing Systems</i>, vol. 57, no. 3, pp. 617–654, 2015.","chicago":"Monien, Burkhard, and Marios Mavronicolas. “Minimizing Expectation Plus Variance.” <i>Theory of Computing Systems</i> 57, no. 3 (2015): 617–54. <a href=\"https://doi.org/10.1007/s00224-014-9542-z\">https://doi.org/10.1007/s00224-014-9542-z</a>.","ama":"Monien B, Mavronicolas M. Minimizing Expectation Plus Variance. <i>Theory of Computing Systems</i>. 2015;57(3):617-654. doi:<a href=\"https://doi.org/10.1007/s00224-014-9542-z\">10.1007/s00224-014-9542-z</a>"},"page":"617-654","intvolume":"        57"},{"type":"bachelorsthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"5090","user_id":"477","department":[{"_id":"205"}],"language":[{"iso":"eng"}],"year":"2015","citation":{"apa":"Streck, T. (2015). <i>Praktikabilität des Adjusted Winner Verfahrens bei variablem Status Quo- Punkt und exogenen Einflüssen</i>. Universität Paderborn.","short":"T. Streck, Praktikabilität Des Adjusted Winner Verfahrens Bei Variablem Status Quo- Punkt Und Exogenen Einflüssen, Universität Paderborn, 2015.","mla":"Streck, Thomas. <i>Praktikabilität Des Adjusted Winner Verfahrens Bei Variablem Status Quo- Punkt Und Exogenen Einflüssen</i>. Universität Paderborn, 2015.","bibtex":"@book{Streck_2015, title={Praktikabilität des Adjusted Winner Verfahrens bei variablem Status Quo- Punkt und exogenen Einflüssen}, publisher={Universität Paderborn}, author={Streck, Thomas}, year={2015} }","ama":"Streck T. <i>Praktikabilität Des Adjusted Winner Verfahrens Bei Variablem Status Quo- Punkt Und Exogenen Einflüssen</i>. Universität Paderborn; 2015.","ieee":"T. Streck, <i>Praktikabilität des Adjusted Winner Verfahrens bei variablem Status Quo- Punkt und exogenen Einflüssen</i>. Universität Paderborn, 2015.","chicago":"Streck, Thomas. <i>Praktikabilität Des Adjusted Winner Verfahrens Bei Variablem Status Quo- Punkt Und Exogenen Einflüssen</i>. Universität Paderborn, 2015."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:37Z","author":[{"id":"33041","full_name":"Streck, Thomas","last_name":"Streck","first_name":"Thomas"}],"date_created":"2018-10-30T14:56:49Z","supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"title":"Praktikabilität des Adjusted Winner Verfahrens bei variablem Status Quo- Punkt und exogenen Einflüssen"},{"year":"2015","citation":{"bibtex":"@book{Stilow_2015, title={Mobile Agenten in Netzwerken: Analyse von Hotspots}, publisher={Universität Paderborn}, author={Stilow, Georg}, year={2015} }","mla":"Stilow, Georg. <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>. Universität Paderborn, 2015.","short":"G. Stilow, Mobile Agenten in Netzwerken: Analyse von Hotspots, Universität Paderborn, 2015.","apa":"Stilow, G. (2015). <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>. Universität Paderborn.","ama":"Stilow G. <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>. Universität Paderborn; 2015.","ieee":"G. Stilow, <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>. Universität Paderborn, 2015.","chicago":"Stilow, Georg. <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>. Universität Paderborn, 2015."},"status":"public","type":"bachelorsthesis","title":"Mobile Agenten in Netzwerken: Analyse von Hotspots","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:03:23Z","publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"694","author":[{"first_name":"Georg","last_name":"Stilow","full_name":"Stilow, Georg"}],"date_created":"2017-11-14T06:55:56Z","user_id":"477"},{"department":[{"_id":"205"}],"user_id":"477","_id":"5927","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_created":"2018-11-28T10:02:43Z","author":[{"first_name":"N","full_name":"N, N","last_name":"N"}],"supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"date_updated":"2022-11-30T14:24:30Z","publisher":"Universität Paderborn","title":"Simultane bilaterale Verhandlungen - Zur Zusammenstellung eines Sortiments","citation":{"short":"N. N, Simultane Bilaterale Verhandlungen - Zur Zusammenstellung Eines Sortiments, Universität Paderborn, 2015.","mla":"N, N. <i>Simultane Bilaterale Verhandlungen - Zur Zusammenstellung Eines Sortiments</i>. Universität Paderborn, 2015.","bibtex":"@book{N_2015, title={Simultane bilaterale Verhandlungen - Zur Zusammenstellung eines Sortiments}, publisher={Universität Paderborn}, author={N, N}, year={2015} }","apa":"N, N. (2015). <i>Simultane bilaterale Verhandlungen - Zur Zusammenstellung eines Sortiments</i>. Universität Paderborn.","ama":"N N. <i>Simultane Bilaterale Verhandlungen - Zur Zusammenstellung Eines Sortiments</i>. Universität Paderborn; 2015.","chicago":"N, N. <i>Simultane Bilaterale Verhandlungen - Zur Zusammenstellung Eines Sortiments</i>. Universität Paderborn, 2015.","ieee":"N. N, <i>Simultane bilaterale Verhandlungen - Zur Zusammenstellung eines Sortiments</i>. Universität Paderborn, 2015."},"year":"2015"},{"type":"bachelorsthesis","status":"public","_id":"5928","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"205"}],"user_id":"477","language":[{"iso":"eng"}],"year":"2015","citation":{"apa":"N, N. (2015). <i>Cournot-Nash-Bertrand Wettbewerb im serviceorientierten Internet</i>. Universität Paderborn.","short":"N. N, Cournot-Nash-Bertrand Wettbewerb Im Serviceorientierten Internet, Universität Paderborn, 2015.","mla":"N, N. <i>Cournot-Nash-Bertrand Wettbewerb Im Serviceorientierten Internet</i>. Universität Paderborn, 2015.","bibtex":"@book{N_2015, title={Cournot-Nash-Bertrand Wettbewerb im serviceorientierten Internet}, publisher={Universität Paderborn}, author={N, N}, year={2015} }","ama":"N N. <i>Cournot-Nash-Bertrand Wettbewerb Im Serviceorientierten Internet</i>. Universität Paderborn; 2015.","chicago":"N, N. <i>Cournot-Nash-Bertrand Wettbewerb Im Serviceorientierten Internet</i>. Universität Paderborn, 2015.","ieee":"N. N, <i>Cournot-Nash-Bertrand Wettbewerb im serviceorientierten Internet</i>. Universität Paderborn, 2015."},"date_updated":"2022-11-30T14:24:17Z","publisher":"Universität Paderborn","author":[{"first_name":"N","last_name":"N","full_name":"N, N"}],"date_created":"2018-11-28T10:04:29Z","supervisor":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"title":"Cournot-Nash-Bertrand Wettbewerb im serviceorientierten Internet"},{"citation":{"mla":"N, N. <i>Multilaterale Verhandlungen Aus Produzentensicht</i>. Universität Paderborn, 2015.","short":"N. N, Multilaterale Verhandlungen Aus Produzentensicht, Universität Paderborn, 2015.","bibtex":"@book{N_2015, title={Multilaterale Verhandlungen aus Produzentensicht}, publisher={Universität Paderborn}, author={N, N}, year={2015} }","apa":"N, N. (2015). <i>Multilaterale Verhandlungen aus Produzentensicht</i>. Universität Paderborn.","chicago":"N, N. <i>Multilaterale Verhandlungen Aus Produzentensicht</i>. Universität Paderborn, 2015.","ieee":"N. N, <i>Multilaterale Verhandlungen aus Produzentensicht</i>. Universität Paderborn, 2015.","ama":"N N. <i>Multilaterale Verhandlungen Aus Produzentensicht</i>. Universität Paderborn; 2015."},"year":"2015","title":"Multilaterale Verhandlungen aus Produzentensicht","supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2018-11-28T10:07:47Z","author":[{"first_name":"N","last_name":"N","full_name":"N, N"}],"date_updated":"2022-11-30T14:24:43Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"205"}],"user_id":"477","_id":"5929","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}]},{"author":[{"first_name":"N","full_name":"N, N","last_name":"N"}],"date_created":"2018-11-28T09:58:42Z","supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"}],"date_updated":"2022-11-30T14:24:57Z","publisher":"Universität Paderborn","title":"Produktdifferenzierung und Verhandlungsposition im duopolistischen Wettbewerb","citation":{"apa":"N, N. (2015). <i>Produktdifferenzierung und Verhandlungsposition im duopolistischen Wettbewerb</i>. Universität Paderborn.","short":"N. N, Produktdifferenzierung Und Verhandlungsposition Im Duopolistischen Wettbewerb, Universität Paderborn, 2015.","bibtex":"@book{N_2015, title={Produktdifferenzierung und Verhandlungsposition im duopolistischen Wettbewerb}, publisher={Universität Paderborn}, author={N, N}, year={2015} }","mla":"N, N. <i>Produktdifferenzierung Und Verhandlungsposition Im Duopolistischen Wettbewerb</i>. Universität Paderborn, 2015.","ama":"N N. <i>Produktdifferenzierung Und Verhandlungsposition Im Duopolistischen Wettbewerb</i>. Universität Paderborn; 2015.","chicago":"N, N. <i>Produktdifferenzierung Und Verhandlungsposition Im Duopolistischen Wettbewerb</i>. Universität Paderborn, 2015.","ieee":"N. N, <i>Produktdifferenzierung und Verhandlungsposition im duopolistischen Wettbewerb</i>. Universität Paderborn, 2015."},"year":"2015","department":[{"_id":"205"}],"user_id":"477","_id":"5925","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"department":[{"_id":"205"}],"user_id":"477","_id":"5923","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_created":"2018-11-28T09:53:12Z","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"supervisor":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"}],"date_updated":"2022-11-30T14:25:10Z","publisher":"Universität Paderborn","title":"Aggregating Online Reputation Feedback","citation":{"bibtex":"@book{N_2015, title={Aggregating Online Reputation Feedback}, publisher={Universität Paderborn}, author={N, N}, year={2015} }","short":"N. N, Aggregating Online Reputation Feedback, Universität Paderborn, 2015.","mla":"N, N. <i>Aggregating Online Reputation Feedback</i>. Universität Paderborn, 2015.","apa":"N, N. (2015). <i>Aggregating Online Reputation Feedback</i>. Universität Paderborn.","ama":"N N. <i>Aggregating Online Reputation Feedback</i>. Universität Paderborn; 2015.","chicago":"N, N. <i>Aggregating Online Reputation Feedback</i>. Universität Paderborn, 2015.","ieee":"N. N, <i>Aggregating Online Reputation Feedback</i>. Universität Paderborn, 2015."},"year":"2015"},{"_id":"5926","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"}],"user_id":"477","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-11-30T14:28:44Z","publisher":"Universität Paderborn","author":[{"first_name":"N","last_name":"N","full_name":"N, N"}],"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2018-11-28T10:00:27Z","title":"Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien - eine Analyse mit dem Adjusted-Winner-Verfahren","year":"2015","citation":{"chicago":"N, N. <i>Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine Analyse Mit Dem Adjusted-Winner-Verfahren</i>. Universität Paderborn, 2015.","ieee":"N. N, <i>Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien - eine Analyse mit dem Adjusted-Winner-Verfahren</i>. Universität Paderborn, 2015.","ama":"N N. <i>Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine Analyse Mit Dem Adjusted-Winner-Verfahren</i>. Universität Paderborn; 2015.","bibtex":"@book{N_2015, title={Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien - eine Analyse mit dem Adjusted-Winner-Verfahren}, publisher={Universität Paderborn}, author={N, N}, year={2015} }","mla":"N, N. <i>Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine Analyse Mit Dem Adjusted-Winner-Verfahren</i>. Universität Paderborn, 2015.","short":"N. N, Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine Analyse Mit Dem Adjusted-Winner-Verfahren, Universität Paderborn, 2015.","apa":"N, N. (2015). <i>Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien - eine Analyse mit dem Adjusted-Winner-Verfahren</i>. Universität Paderborn."}},{"date_updated":"2022-02-04T10:42:15Z","author":[{"full_name":"Herrmann, Philipp","last_name":"Herrmann","first_name":"Philipp"},{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"},{"first_name":"Steffen","last_name":"Zimmermann","full_name":"Zimmermann, Steffen"},{"first_name":"Barry","last_name":"Nault","full_name":"Nault, Barry"}],"date_created":"2017-10-17T12:41:51Z","title":"Different Sources of the Variance of Online Consumer Ratings and their Impact on Price and Demand","conference":{"location":"Philadelphia, USA","name":"INFORMS Conference on Information Systems and Technology (CIST)"},"has_accepted_license":"1","year":"2015","citation":{"apa":"Herrmann, P., Kundisch, D., Zimmermann, S., &#38; Nault, B. (2015). <i>Different Sources of the Variance of Online Consumer Ratings and their Impact on Price and Demand</i>. INFORMS Conference on Information Systems and Technology (CIST), Philadelphia, USA.","short":"P. Herrmann, D. Kundisch, S. Zimmermann, B. Nault, in: 2015.","mla":"Herrmann, Philipp, et al. <i>Different Sources of the Variance of Online Consumer Ratings and Their Impact on Price and Demand</i>. 2015.","bibtex":"@inproceedings{Herrmann_Kundisch_Zimmermann_Nault_2015, title={Different Sources of the Variance of Online Consumer Ratings and their Impact on Price and Demand}, author={Herrmann, Philipp and Kundisch, Dennis and Zimmermann, Steffen and Nault, Barry}, year={2015} }","ama":"Herrmann P, Kundisch D, Zimmermann S, Nault B. Different Sources of the Variance of Online Consumer Ratings and their Impact on Price and Demand. In: ; 2015.","chicago":"Herrmann, Philipp, Dennis Kundisch, Steffen Zimmermann, and Barry Nault. “Different Sources of the Variance of Online Consumer Ratings and Their Impact on Price and Demand,” 2015.","ieee":"P. Herrmann, D. Kundisch, S. Zimmermann, and B. Nault, “Different Sources of the Variance of Online Consumer Ratings and their Impact on Price and Demand,” presented at the INFORMS Conference on Information Systems and Technology (CIST), Philadelphia, USA, 2015."},"_id":"307","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"276"}],"user_id":"16205","ddc":["330"],"file_date_updated":"2019-01-29T14:22:12Z","language":[{"iso":"eng"}],"type":"conference_abstract","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"Rating Variance_CIST_Abstract.pdf","file_id":"7241","access_level":"closed","file_size":83968,"creator":"abursig","date_created":"2019-01-29T14:22:12Z","date_updated":"2019-01-29T14:22:12Z"}]},{"publication":"Economic Theory","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-08-09T09:35:19Z","creator":"cjhaake","date_updated":"2018-08-09T09:35:19Z","file_id":"3868","access_level":"closed","file_name":"Competitive outcomes and the inner core of NTU market games.pdf","file_size":391317}],"language":[{"iso":"eng"}],"ddc":["040"],"issue":"3","year":"2014","date_created":"2018-04-26T10:52:28Z","publisher":"Springer Nature","title":"Competitive outcomes and the inner core of NTU market games","type":"journal_article","status":"public","user_id":"65453","department":[{"_id":"205"},{"_id":"475"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"2522","file_date_updated":"2018-08-09T09:35:19Z","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0938-2259","1432-0479"]},"citation":{"apa":"Brangewitz, S., &#38; Gamp, J.-P. (2014). Competitive outcomes and the inner core of NTU market games. <i>Economic Theory</i>, <i>57</i>(3), 529–554. <a href=\"https://doi.org/10.1007/s00199-014-0846-7\">https://doi.org/10.1007/s00199-014-0846-7</a>","mla":"Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.” <i>Economic Theory</i>, vol. 57, no. 3, Springer Nature, 2014, pp. 529–54, doi:<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>.","short":"S. Brangewitz, J.-P. Gamp, Economic Theory 57 (2014) 529–554.","bibtex":"@article{Brangewitz_Gamp_2014, title={Competitive outcomes and the inner core of NTU market games}, volume={57}, DOI={<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>}, number={3}, journal={Economic Theory}, publisher={Springer Nature}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2014}, pages={529–554} }","ama":"Brangewitz S, Gamp J-P. Competitive outcomes and the inner core of NTU market games. <i>Economic Theory</i>. 2014;57(3):529-554. doi:<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>","chicago":"Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.” <i>Economic Theory</i> 57, no. 3 (2014): 529–54. <a href=\"https://doi.org/10.1007/s00199-014-0846-7\">https://doi.org/10.1007/s00199-014-0846-7</a>.","ieee":"S. Brangewitz and J.-P. Gamp, “Competitive outcomes and the inner core of NTU market games,” <i>Economic Theory</i>, vol. 57, no. 3, pp. 529–554, 2014."},"intvolume":"        57","page":"529-554","author":[{"first_name":"Sonja","last_name":"Brangewitz","full_name":"Brangewitz, Sonja"},{"last_name":"Gamp","full_name":"Gamp, Jan-Philip","first_name":"Jan-Philip"}],"volume":57,"date_updated":"2022-01-06T06:56:55Z","doi":"10.1007/s00199-014-0846-7"},{"publication":"Proceedings of the 2014 IFIP Networking Conference (Networking 2014)","type":"conference","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":786320,"file_name":"329-maxinet_networking14_01.pdf","file_id":"1425","access_level":"closed","date_updated":"2018-03-20T07:30:29Z","creator":"florida","date_created":"2018-03-20T07:30:29Z"}],"abstract":[{"lang":"eng","text":"Network emulations are widely used for testing novel network protocols and routing algorithms in realistic scenarios. Up to now, there is no emulation tool that is able to emulate large software-defined data center networks that consist of several thousand nodes. Mininet is the most common tool to emulate Software-Defined Networks of several hundred nodes. We extend Mininet to span an emulated network over several physical machines, making it possible to emulate networks of several thousand nodes on just a handful of physical machines. This enables us to emulate, e.g., large data center networks. To test this approach, we additionally introduce a traffic generator for data center traffic. Since there are no data center traffic traces publicly available we use the results of two recent traffic studies to create synthetic traffic. We show the design and discuss some challenges we had in building our traffic generator. As a showcase for our work we emulated a data center consisting of 3200 hosts on a cluster of only 12 physical machines. We show the resulting workloads and the trade-offs involved."}],"department":[{"_id":"75"}],"user_id":"15572","_id":"329","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-20T07:30:29Z","ddc":["040"],"has_accepted_license":"1","page":"1-9","citation":{"apa":"Wette, P., Dräxler, M., Schwabe, A., Wallaschek, F., Zahraee, M. H., &#38; Karl, H. (2014). MaxiNet: Distributed Emulation of Software-Defined Networks. In <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i> (pp. 1–9). <a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">https://doi.org/10.1109/IFIPNetworking.2014.6857078</a>","bibtex":"@inproceedings{Wette_Dräxler_Schwabe_Wallaschek_Zahraee_Karl_2014, title={MaxiNet: Distributed Emulation of Software-Defined Networks}, DOI={<a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">10.1109/IFIPNetworking.2014.6857078</a>}, booktitle={Proceedings of the 2014 IFIP Networking Conference (Networking 2014)}, author={Wette, Philip and Dräxler, Martin and Schwabe, Arne and Wallaschek, Felix and Zahraee, Mohammad Hassan and Karl, Holger}, year={2014}, pages={1–9} }","mla":"Wette, Philip, et al. “MaxiNet: Distributed Emulation of Software-Defined Networks.” <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>, 2014, pp. 1–9, doi:<a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">10.1109/IFIPNetworking.2014.6857078</a>.","short":"P. Wette, M. Dräxler, A. Schwabe, F. Wallaschek, M.H. Zahraee, H. Karl, in: Proceedings of the 2014 IFIP Networking Conference (Networking 2014), 2014, pp. 1–9.","ama":"Wette P, Dräxler M, Schwabe A, Wallaschek F, Zahraee MH, Karl H. MaxiNet: Distributed Emulation of Software-Defined Networks. In: <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>. ; 2014:1-9. doi:<a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">10.1109/IFIPNetworking.2014.6857078</a>","chicago":"Wette, Philip, Martin Dräxler, Arne Schwabe, Felix Wallaschek, Mohammad Hassan Zahraee, and Holger Karl. “MaxiNet: Distributed Emulation of Software-Defined Networks.” In <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>, 1–9, 2014. <a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">https://doi.org/10.1109/IFIPNetworking.2014.6857078</a>.","ieee":"P. Wette, M. Dräxler, A. Schwabe, F. Wallaschek, M. H. Zahraee, and H. Karl, “MaxiNet: Distributed Emulation of Software-Defined Networks,” in <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>, 2014, pp. 1–9."},"year":"2014","author":[{"first_name":"Philip","full_name":"Wette, Philip","last_name":"Wette"},{"first_name":"Martin","last_name":"Dräxler","full_name":"Dräxler, Martin"},{"full_name":"Schwabe, Arne","last_name":"Schwabe","first_name":"Arne"},{"first_name":"Felix","last_name":"Wallaschek","full_name":"Wallaschek, Felix"},{"first_name":"Mohammad Hassan","last_name":"Zahraee","full_name":"Zahraee, Mohammad Hassan"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_created":"2017-10-17T12:41:56Z","date_updated":"2022-01-06T06:59:09Z","doi":"10.1109/IFIPNetworking.2014.6857078","title":"MaxiNet: Distributed Emulation of Software-Defined Networks"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"330","user_id":"42447","department":[{"_id":"280"}],"year":"2014","citation":{"apa":"Drigalsky, L. (2014). <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn.","short":"L. Drigalsky, Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse, Universität Paderborn, 2014.","mla":"Drigalsky, Liesa. <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn, 2014.","bibtex":"@book{Drigalsky_2014, title={Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse}, publisher={Universität Paderborn}, author={Drigalsky, Liesa}, year={2014} }","chicago":"Drigalsky, Liesa. <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn, 2014.","ieee":"L. Drigalsky, <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn, 2014.","ama":"Drigalsky L. <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn; 2014."},"title":"Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse","date_updated":"2022-01-06T06:59:09Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339","first_name":"Burkhard"}],"date_created":"2017-10-17T12:41:56Z","author":[{"first_name":"Liesa","last_name":"Drigalsky","full_name":"Drigalsky, Liesa"}]},{"year":"2014","citation":{"apa":"Lange, M. (2014). <i>Was tun um Kunden von der Qualität seiner Produkte zu überzeugen - Möglichkeiten der Zertifizierung und von Reputationssystemen auf Onlinemärkten</i>. Universität Paderborn.","mla":"Lange, Maximilian. <i>Was tun um Kunden von der Qualität seiner Produkte zu überzeugen - Möglichkeiten der Zertifizierung und von Reputationssystemen auf Onlinemärkten</i>. Universität Paderborn, 2014.","short":"M. Lange, Was tun um Kunden von der Qualität seiner Produkte zu überzeugen - Möglichkeiten der Zertifizierung und von Reputationssystemen auf Onlinemärkten, Universität Paderborn, 2014.","bibtex":"@book{Lange_2014, title={Was tun um Kunden von der Qualität seiner Produkte zu überzeugen - Möglichkeiten der Zertifizierung und von Reputationssystemen auf Onlinemärkten}, publisher={Universität Paderborn}, author={Lange, Maximilian}, year={2014} }","ama":"Lange M. <i>Was tun um Kunden von der Qualität seiner Produkte zu überzeugen - Möglichkeiten der Zertifizierung und von Reputationssystemen auf Onlinemärkten</i>. Universität Paderborn; 2014.","chicago":"Lange, Maximilian. <i>Was tun um Kunden von der Qualität seiner Produkte zu überzeugen - Möglichkeiten der Zertifizierung und von Reputationssystemen auf Onlinemärkten</i>. Universität Paderborn, 2014.","ieee":"M. Lange, <i>Was tun um Kunden von der Qualität seiner Produkte zu überzeugen - Möglichkeiten der Zertifizierung und von Reputationssystemen auf Onlinemärkten</i>. Universität Paderborn, 2014."},"status":"public","type":"bachelorsthesis","title":"Was tun um Kunden von der Qualität seiner Produkte zu überzeugen - Möglichkeiten der Zertifizierung und von Reputationssystemen auf Onlinemärkten","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:10Z","_id":"332","date_created":"2017-10-17T12:41:56Z","author":[{"full_name":"Lange, Maximilian","last_name":"Lange","first_name":"Maximilian"}],"user_id":"477"},{"author":[{"full_name":"Berkemeier, Christopher","last_name":"Berkemeier","first_name":"Christopher"}],"date_created":"2017-10-17T12:41:57Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:13Z","title":"Verhandlungen vs Auktionen im Beschäftigungsmanagement","citation":{"chicago":"Berkemeier, Christopher. <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn, 2014.","ieee":"C. Berkemeier, <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn, 2014.","ama":"Berkemeier C. <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn; 2014.","mla":"Berkemeier, Christopher. <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn, 2014.","bibtex":"@book{Berkemeier_2014, title={Verhandlungen vs Auktionen im Beschäftigungsmanagement}, publisher={Universität Paderborn}, author={Berkemeier, Christopher}, year={2014} }","short":"C. Berkemeier, Verhandlungen vs Auktionen im Beschäftigungsmanagement, Universität Paderborn, 2014.","apa":"Berkemeier, C. (2014). <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn."},"year":"2014","user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"337","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"type":"bachelorsthesis","citation":{"apa":"Beck, H. (2014). <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn.","short":"H. Beck, Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens, Universität Paderborn, 2014.","mla":"Beck, Henri. <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn, 2014.","bibtex":"@book{Beck_2014, title={Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens}, publisher={Universität Paderborn}, author={Beck, Henri}, year={2014} }","ama":"Beck H. <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn; 2014.","chicago":"Beck, Henri. <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn, 2014.","ieee":"H. Beck, <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn, 2014."},"status":"public","year":"2014","user_id":"477","date_created":"2017-10-17T12:41:57Z","author":[{"first_name":"Henri","last_name":"Beck","full_name":"Beck, Henri"}],"date_updated":"2022-01-06T06:59:13Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publisher":"Universität Paderborn","_id":"338","language":[{"iso":"ger"}],"title":"Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens"}]