@inbook{2044,
author = {Krimphove, Dieter},
booktitle = {Festschrift für Jürgen Keßler },
editor = {Fritz, Roland and Herzberg, Anja and Kühnberger, Manfred},
pages = {403 – 432},
publisher = {Verlag Dr. Kovač},
title = {{Kann der internationale, europäische und nationale Gesetzgeber angemessen auf Banken- und Kapitalmarktrisiken reagieren?, }},
year = {2015},
}
@inproceedings{232,
abstract = {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.},
author = {Monien, Burkhard and Mavronicolas, Marios and Wagner, Klaus},
booktitle = {the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday},
pages = {49--86},
title = {{Weighted Boolean Formula Games}},
doi = {10.1007/978-3-319-24024-4_6},
year = {2015},
}
@misc{237,
author = {Ochlast, Kerstin},
publisher = {Universität Paderborn},
title = {{Trust Me, I am Certified - Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen}},
year = {2015},
}
@article{244,
abstract = {We revisit the simple class of weighted congestion games on parallel links [10], where each player has a non-negative weight and her cost on the link she chooses is the sum of the weights of all players choosing the link. We extend this class to mix-weighted congestion games on parallel links, where weights may as well be negative. For the resulting simple class, we study the complexity of deciding the existence of a pure equilibrium, where no player could unilaterally improve her cost by switching to another link.We show that even for a singlenegative weight, this decision problem is strongly NP-complete when the number of links is part of the input; the problem is NP-complete already for two links. When the number of links is a fixed constant, we show, through a pseudopolynomial, dynamic programming algorithm, that the problem is not strongly NP-complete unless P = NP; the algorithm works for any number of negative weights.},
author = {Monien, Burkhard and Mavronicolas, Marios},
journal = {Information Processing Letters},
number = {12},
pages = {927--931},
publisher = {Elsevier},
title = {{The complexity of pure equilibria in mix-weighted congestion games on parallel links}},
doi = {10.1016/j.ipl.2015.07.012},
volume = {115},
year = {2015},
}
@techreport{249,
abstract = {We analyze the stability of networks when two intermediaries strategically form costly links to customers. We interpret these links as customer relationships that enable trade to sell a product. Equilibrium prices and equilibrium quantities on the output as well as on the input market are determined endogenously for a given network of customer relationships. We investigate in how far the substitutability of the intermediaries' products and the costs of link formation influence the intermediaries' equilibrium profits and thus have an impact on the incentives to strategically form relationships to customers. For networks with three customers we characterize locally stable networks, in particular existence is guaranteed for any degree of substitutability. Moreover for the special cases of perfect complements, independent products and perfect substitutes, local stability coincides with the stronger concept of Nash stability. Additionally, for networks with n customers we analyze stability regions for selected networks and determine their limits when n goes to infinity. It turns out that the shape of the stability regions for those networks does not significantly change compared to a setting with a small number of customers. },
author = {Brangewitz, Sonja and Haake, Claus-Jochen and Möhlmeier, Philipp},
publisher = {Universität Paderborn},
title = {{Strategic Formation of Customer Relationship Networks}},
volume = {91},
year = {2015},
}
@misc{251,
author = {Pfannschmidt, Karlson},
publisher = {Universität Paderborn},
title = {{Solving the aggregated bandits problem}},
year = {2015},
}
@misc{256,
author = {Zindler, Finn},
publisher = {Universität Paderborn},
title = {{Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung}},
year = {2015},
}
@article{263,
abstract = {In the last two decades, water consumption in Germany has been decreasing, which causes the water tanks and pipes in water distribution systems to work inefficiently. This paper proposes a method that supports the planning process for tanks in water distribution systems. The method uses a combination of network reduction, mathematical optimization and hydraulic simulation. The mathematical optimization model is a non-convex Mixed Integer Quadratically Constrained Program (MIQCP) that is solved by a piecewise linearization. As this may lead to many binary variables and therefore high computing times, the size of the water distribution system model is reduced before building the optimization model. After applying several network reduction techniques and using a piecewise approximation of the original model, there may be some hydraulic differences between the original network model and the reduced network model. To make sure that the solution obtained in the optimization process is feasible in the original water distribution system model, the solution is verified by a hydraulic simulation. If the solution is not feasible, the reduced model has to be modified and solved again until the hydraulic simulation verifies a solution as feasible. In this paper, each of these processes is described and the results indicate the usefulness of each of them.},
author = {Hallmann, Corinna and Suhl, Leena},
journal = {OR Spectrum},
pages = {1--19},
publisher = {Springer},
title = {{Optimizing Water Tanks in Water Distribution Systems by combining Network Reduction, Mathematical Optimization and Hydraulic Simulation}},
doi = {10.1007/s00291-015-0403-1},
year = {2015},
}
@misc{268,
author = {Lange, Alexander},
publisher = {Universität Paderborn},
title = {{Online Bewertungssysteme – Ein systematischer Überblick}},
year = {2015},
}
@phdthesis{270,
author = {Abshoff, Sebastian},
publisher = {Universität Paderborn},
title = {{On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}},
year = {2015},
}
@inproceedings{2703,
author = {Mutter, Tobias and Kundisch, Dennis},
booktitle = {Proceedings of the Twenty Third European Conference on Information Systems (ECIS)},
location = {Münster},
title = {{Behavioral Mechanisms Prompted by Virtual Rewards: The Small-Area Hypothesis}},
year = {2015},
}
@misc{282,
author = {Kirsch, Michelle},
publisher = {Universität Paderborn},
title = {{Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern}},
year = {2015},
}
@inproceedings{287,
abstract = {The size of modern data centers is constantly increasing. As it is not economic to interconnect all machines in the data center using a full-bisection-bandwidth network, techniques have to be developed to increase the efficiency of data-center networks. The Software-Defined Network paradigm opened the door for centralized traffic engineering (TE) in such environments. Up to now, there were already a number of TE proposals for SDN-controlled data centers that all work very well. However, these techniques either use a high amount of flow table entries or a high flow installation rate that overwhelms available switching hardware, or they require custom or very expensive end-of-line equipment to be usable in practice. We present HybridTE, a TE technique that uses (uncertain) information about large flows. Using this extra information, our technique has very low hardware requirements while maintaining better performance than existing TE techniques. This enables us to build very low-cost, high performance data-center networks.},
author = {Wette, Philip and Karl, Holger},
booktitle = {Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)},
pages = {1----7},
title = {{HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks}},
doi = {10.1109/EWSDN.2015.57},
year = {2015},
}
@misc{294,
author = {Materna, GinaJoanna},
publisher = {Universität Paderborn},
title = {{Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik}},
year = {2015},
}
@misc{299,
author = {Gerken, Britta},
publisher = {Universität Paderborn},
title = {{Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie}},
year = {2015},
}
@misc{302,
author = {Stroh, Christian},
publisher = {Universität Paderborn},
title = {{Efficient Attributes for Pairing-Based Anonymous Credentials}},
year = {2015},
}
@techreport{1147,
abstract = {Der Erfahrungsaustausch zwischen Patienten findet verstärkt über Arztbewertungsportale statt. Dabei ermöglicht die Anonymität des Netzes ein weitestgehend ehrliches Beschwerdeverhalten, von dem das sensible Arzt-Patienten-Vertrauensverhältnis unbeschädigt bleibt. Im Rahmen des vorliegenden Beitrags wurden anonyme Arztbewertungen im Web 2.0 automatisiert ausgewertet, um Einflussfaktoren auf das Beschwerdeverhalten deutscher Patienten zu bestimmen und in der Gesellschaft vermeintlich etablierte „Patienten-Mythen“ aufzuklären. Die Aufdeckung von Irrtümern und Zufriedenheitsindikatoren soll längerfristig dazu dienen, Patientenäußerungen differenzierter zu interpretieren und somit zu einer nachhaltigen Verbesserung der Arzt-Patienten-Beziehung beizutragen.},
author = {Geierhos, Michaela and Schulze, Sabine and Bäumer, Frederik Simon},
pages = {18},
publisher = {Verbraucherzentrale NRW/Kompetenzzentrum Verbraucherforschung NRW},
title = {{Der zufriedene Patient 2.0: Analyse anonymer Arztbewertungen im Web 2.0}},
doi = {10.15501/kvfwp_3},
volume = {3},
year = {2015},
}
@article{1370,
author = {Gries, Thomas and Palnau, Irene},
issn = {1554-8597},
journal = {Peace Economics, Peace Science and Public Policy},
number = {4},
publisher = {Walter de Gruyter GmbH},
title = {{Sustaining Civil Peace: A Configurational Comparative Analysis}},
doi = {10.1515/peps-2015-0020},
volume = {21},
year = {2015},
}
@article{1697,
author = {Zeuner, Franziska and Muldarisnur, Mulda and Hildebrandt, Andre and Förstner, Jens and Zentgraf, Thomas},
issn = {1530-6984},
journal = {Nano Letters},
keyword = {tet_topic_plasmonics},
number = {6},
pages = {4189--4193},
publisher = {American Chemical Society (ACS)},
title = {{Coupling Mediated Coherent Control of Localized Surface Plasmon Polaritons}},
doi = {10.1021/acs.nanolett.5b01381},
volume = {15},
year = {2015},
}
@article{1700,
author = {Zheng, Guoxing and Mühlenbernd, Holger and Kenney, Mitchell and Li, Guixin and Zentgraf, Thomas and Zhang, Shuang},
issn = {1748-3387},
journal = {Nature Nanotechnology},
number = {4},
pages = {308--312},
publisher = {Springer Nature},
title = {{Metasurface holograms reaching 80% efficiency}},
doi = {10.1038/nnano.2015.2},
volume = {10},
year = {2015},
}