@article{45849, abstract = {{AbstractDependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic(PDL)and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) ofPDLisNP-complete (Ebbing and Lohmann, SOFSEM 2012). The subject of this research is to identify a list of parameterisations (formula-size, formula-depth, treewidth, team-size, number of variables) under which MC becomes fixed-parameter tractable. Furthermore, we show that the number of disjunctions or the arity of dependence atoms (dep-arity) as a parameter both yield a paraNP-completeness result. Then, we consider the satisfiability problem (SAT) which classically is known to beNP-complete as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different picture: under team-size, or dep-arity SAT isparaNP-complete whereas under all other mentioned parameters the problem isFPT. Finally, we introduce a variant of the satisfiability problem, asking for a team of a given size, and show for this problem an almost complete picture.}}, author = {{Mahmood, Yasir and Meier, Arne}}, issn = {{1012-2443}}, journal = {{Annals of Mathematics and Artificial Intelligence}}, keywords = {{Applied Mathematics, Artificial Intelligence}}, number = {{2-3}}, pages = {{271--296}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Parameterised complexity of model checking and satisfiability in propositional dependence logic}}}, doi = {{10.1007/s10472-021-09730-w}}, volume = {{90}}, year = {{2021}}, } @inproceedings{45846, author = {{Kontinen, Juha and Meier, Arne and Mahmood, Yasir}}, booktitle = {{Logical Foundations of Computer Science}}, isbn = {{9783030930998}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{A Parameterized View on the Complexity of Dependence Logic}}}, doi = {{10.1007/978-3-030-93100-1_9}}, year = {{2021}}, } @article{45640, abstract = {{I study a dynamic variant of the Dixit–Stiglitz (Am Econ Rev 67(3), 1977) model of monopolistic competition by introducing price stickiness à la Fershtman and Kamien (Econometrica 55(5), 1987). The analysis is restricted to bounded quantity and price paths that fulfill the necessary conditions for an open-loop Nash equilibrium. I show that there exists a symmetric steady state and that its stability depends on the degree of product differentiation. When moving from complements to perfect substitutes, the steady state is either a locally asymptotically unstable (spiral) source, a stable (spiral) sink or a saddle point. I further apply the Hopf bifurcation theorem and prove the existence of limit cycles, when passing from a stable to an unstable steady state. Lastly, I provide a numerical example and show that there exists a stable limit cycle.}}, author = {{Hoof, Simon}}, issn = {{1573-2878}}, journal = {{Journal of Optimization Theory and Applications}}, number = {{2}}, publisher = {{Springer}}, title = {{{Dynamic Monopolistic Competition}}}, volume = {{189}}, year = {{2021}}, } @techreport{45616, abstract = {{Aggregation metrics in reputation systems are important for overcoming information overload. When using these metrics, technical aggregation functions such as the arithmetic mean are implemented to measure the valence of product ratings. However, it is unclear whether the implemented aggregation functions match the inherent aggregation patterns of customers. In our experiment, we elicit customers' aggregation heuristics and contrast these with reference functions. Our findings indicate that, overall, the arithmetic mean performs best in comparison with other aggregation functions. However, our analysis on an individual level reveals heterogeneous aggregation patterns. Major clusters exhibit a binary bias (i.e., an over-weighting of moderate ratings and under-weighting of extreme ratings) in combination with the arithmetic mean. Minor clusters focus on 1-star ratings or negative (i.e., 1-star and 2-star) ratings. Thereby, inherent aggregation patterns are neither affected by variation of provided information nor by individual characteristics such as experience, risk attitudes, or demographics.}}, author = {{van Straaten, Dirk and Melnikov, Vitalik and Hüllermeier, Eyke and Mir Djawadi, Behnud and Fahr, René}}, title = {{{Accounting for Heuristics in Reputation Systems: An Interdisciplinary Approach on Aggregation Processes}}}, volume = {{72}}, year = {{2021}}, } @techreport{45617, author = {{van Straaten, Dirk}}, title = {{{Incentive Schemes in Customer Rating Systems - Comparing the Effects of Unconditional and Conditional Rebates on Intrinsic Motivation}}}, volume = {{71}}, year = {{2021}}, } @techreport{45618, author = {{van Straaten, Dirk and Fahr, René}}, title = {{{Fighting Fire with Fire - Overcoming Ambiguity Aversion by Introducing more Ambiguity}}}, volume = {{73}}, year = {{2021}}, } @misc{45788, author = {{Bülling, Jonas}}, title = {{{Political Speaker Transfer: Learning to Generate Text in the Styles of Barack Obama and Donald Trump}}}, year = {{2021}}, } @misc{45787, author = {{Mishra, Avishek}}, title = {{{Computational Text Professionalization using Neural Sequence-to-Sequence Models}}}, year = {{2021}}, } @inproceedings{30909, author = {{Clausing, Lennart}}, booktitle = {{Proceedings of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies}}, publisher = {{ACM}}, title = {{{ReconOS64: High-Performance Embedded Computing for Industrial Analytics on a Reconfigurable System-on-Chip}}}, doi = {{10.1145/3468044.3468056}}, year = {{2021}}, } @article{34673, author = {{Black, Tobias and Fuest, Mario and Lankeit, Johannes}}, issn = {{0044-2275}}, journal = {{Zeitschrift für angewandte Mathematik und Physik}}, keywords = {{Applied Mathematics, General Physics and Astronomy, General Mathematics}}, number = {{3}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Relaxed parameter conditions for chemotactic collapse in logistic-type parabolic–elliptic Keller–Segel systems}}}, doi = {{10.1007/s00033-021-01524-8}}, volume = {{72}}, year = {{2021}}, }