@inbook{3098,
  abstract     = {{One of the fundamental problems in applications of methods and results
from mechanism design and implementation theory is the effective enforcement of
theoretically established equilibria by which social choice rules are implemented.
Hurwicz (2008) and Myerson (2009) introduce different concepts of formalizing
enforcement of institutional rules via the introduction of legal and illegal games. In
this note the relation of their concepts with that of a social system defined inDebreu
(1952) is analyzed and its potential of being instrumental for modelling institution
design is discussed. The existence proof for such a system, also known as generalized
game or abstract economy had been the basis for the existence proof of a
competitive equilibrium of an economy.}},
  author       = {{Trockel, Walter and Haake, Claus-Jochen}},
  booktitle    = {{Studies in Economic Design}},
  editor       = {{Laslier, Jean-Francois and Moulin, Herve and Sanver, Remzi and Zwicker, William}},
  issn         = {{2510-3970}},
  publisher    = {{Springer}},
  title        = {{{Thoughts on Social Design}}},
  volume       = {{(n.d.)}},
  year         = {{2018}},
}

@phdthesis{2712,
  author       = {{Schlangenotto, Darius}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer}}},
  doi          = {{10.17619/UNIPB/1-312}},
  year         = {{2018}},
}

@phdthesis{1138,
  author       = {{Gmyr, Robert}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Distributed Algorithms for Overlay Networks and Programmable Matter}}},
  doi          = {{10.17619/UNIPB/1-265}},
  year         = {{2018}},
}

@inproceedings{1163,
  abstract     = {{In this paper we present two major results:
First, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.
Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.
That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.
}},
  author       = {{Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}},
  booktitle    = {{Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}},
  keywords     = {{Topological Self-stabilization, Supervised Overlay, Publish-Subscribe System}},
  location     = {{Vancouver}},
  publisher    = {{IEEE}},
  title        = {{{Self-Stabilizing Supervised Publish-Subscribe Systems}}},
  doi          = {{10.1109/IPDPS.2018.00114}},
  year         = {{2018}},
}

@inproceedings{1164,
  abstract     = {{We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.
Skueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.
Furthermore Skueue satisfies sequential consistency in the asynchronous message passing model.
Scalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.
Operations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests.}},
  author       = {{Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}},
  booktitle    = {{Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}},
  location     = {{Vancouver}},
  publisher    = {{IEEE}},
  title        = {{{Skueue: A Scalable and Sequentially Consistent Distributed Queue}}},
  doi          = {{10.1109/IPDPS.2018.00113}},
  year         = {{2018}},
}

@misc{18030,
  author       = {{N., N.}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}}},
  year         = {{2018}},
}

@misc{18033,
  author       = {{Wulfes, Robin}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}}},
  year         = {{2018}},
}

@misc{8074,
  author       = {{Aykanat, Cengiz}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Sharing Economy - Chancen und Risiken aus ökonomischer Sicht}}},
  year         = {{2018}},
}

@misc{8075,
  author       = {{Suvorina, Tatiana}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Heterogeneity in Contests, Sources and Implicants}}},
  year         = {{2018}},
}

@article{5772,
  author       = {{Fanasch, Patrizia and Frick, Bernd}},
  issn         = {{1931-4361}},
  journal      = {{Journal of Wine Economics}},
  pages        = {{1--27}},
  publisher    = {{Cambridge University Press (CUP)}},
  title        = {{{What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance}}},
  doi          = {{10.1017/jwe.2018.28}},
  year         = {{2018}},
}

@misc{5967,
  author       = {{Koch, Alexander}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung}}},
  year         = {{2018}},
}

@article{5984,
  author       = {{Scheideler, Christian}},
  journal      = {{Theor. Comput. Sci.}},
  pages        = {{1}},
  title        = {{{Preface}}},
  doi          = {{10.1016/j.tcs.2018.11.004}},
  volume       = {{751}},
  year         = {{2018}},
}

@inproceedings{4411,
  abstract     = {{While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.
Considering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.
In this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.
The data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.
Especially, longest prefix matching for $x$ can be done in $\mathcal{O}(\log |x|)$ hash table read accesses.
We show how to maintain the structure in a self-stabilizing way.
Our protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys.}},
  author       = {{Knollmann, Till and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
  editor       = {{Izumi, Taisuke and Kuznetsov, Petr}},
  keywords     = {{Self-Stabilizing, Prefix Search, Distributed Data Structure}},
  location     = {{Tokyo}},
  publisher    = {{Springer, Cham}},
  title        = {{{A Self-Stabilizing Hashed Patricia Trie}}},
  doi          = {{10.1007/978-3-030-03232-6_1}},
  volume       = {{11201}},
  year         = {{2018}},
}

@inproceedings{4520,
  author       = {{Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}},
  booktitle    = {{Workshop on IS Design and Economic Behavior (ISDEB)}},
  location     = {{Lüneburg, Germany}},
  title        = {{{The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior}}},
  year         = {{2018}},
}

@inproceedings{4563,
  abstract     = {{Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.

In this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\mathcal{O}\left(\log ^2 n\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.
}},
  author       = {{Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}},
  booktitle    = {{Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }},
  keywords     = {{greedy routing, ad hoc networks, convex hulls, c-competitiveness}},
  location     = {{Helsinki}},
  publisher    = {{Springer}},
  title        = {{{Competitive Routing in Hybrid Communication Networks}}},
  year         = {{2018}},
}

@article{4564,
  abstract     = {{  In our model two divisions negotiate over type-dependent contracts to
  determine an intrafirm transfer price for an intermediate product. Since the
  upstream division's (seller's) costs and downstream division's (buyer's)
  revenues are supposed to be private information, we formally consider
  cooperative bargaining problems under incomplete information.  This means
  that the two divisions consider allocations of expected utility generated by
  mechanisms that satisfy (interim) individual rationality, incentive
  compatibility and/or ex post efficiency.  Assuming two possible types for
  buyer and seller each, we first establish that the bargaining problem is
  regular, regardless whether or not incentive and/or efficiency constraints
  are imposed. This allows us to apply the generalized Nash bargaining
  solution to determine fair transfer payments and transfer
  quantities. In particular, the generalized Nash bargaining solution tries to
  balance divisional profits, while incentive constraints are still in
  place. In that sense a fair profit division is generated. Furthermore, by
  means of illustrative examples we derive general properties of this solution
  for the transfer pricing problem and compare the model developed here with
  the models existing in the literature. We demonstrate that there is a
  tradeoff between ex post efficiency and fairness.
}},
  author       = {{Haake, Claus-Jochen and Recker, Sonja}},
  journal      = {{Group Decision and Negotiation}},
  number       = {{6}},
  pages        = {{905--932}},
  publisher    = {{Springer}},
  title        = {{{The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information}}},
  doi          = {{10.1007/s10726-018-9592-8}},
  volume       = {{27}},
  year         = {{2018}},
}

@inproceedings{4565,
  author       = {{Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}},
  booktitle    = {{Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
  isbn         = {{9781450357999}},
  location     = {{Wien}},
  publisher    = {{ACM Press}},
  title        = {{{Brief Announcement: Competitive Routing in Hybrid Communication Networks}}},
  doi          = {{10.1145/3210377.3210663}},
  year         = {{2018}},
}

@phdthesis{4797,
  author       = {{Wu, Xing}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Essays on Competition in Health Care Markets}}},
  doi          = {{10.17619/UNIPB/1-358}},
  year         = {{2018}},
}

@misc{4802,
  author       = {{Akcay, Yasemen}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb}}},
  year         = {{2018}},
}

@misc{4804,
  author       = {{Görken, Emre}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern}}},
  year         = {{2018}},
}