VLDB 2026 Research / reviewers in the wild / expert
Love Ekenberg
dblp:53/544
· DBLP profile ↗
35ranked-venue papers
12as first author
3since 2021 · last 2023
0000-0002-0665-1889ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 16 · 5 first-author · 1 since 2021Software engineering, systems software and programming languages · 11 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 4 · 3 first-authorComputer networks · 1Security and privacy · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Automatically Generated Weight Methods for Human and Machine Decision-Making
Sebastian Lakmayer, Mats Danielson, Love Ekenberg |
IEA/AIE (1) | 3 |
| 2023 | Aspects of Ranking Algorithms in Multi-Criteria Decision Support SystemsabstractThere are well-known issues in eliciting probabilities, utilities, and criteria weights in real-life decision analysis. In this paper, we examine automatic multi-criteria weight-generating algorithms which are seen as one remedy to some of the elicitation issues. The results show that the newer Sum Rank approaches perform better in terms of both performance and robustness than older (classical) methods, also when compared to the new and promising geometric class of methods. Additionally, as expected the cardinal surrogate models perform better than their ordinal counterparts (with one exception) due to their ability to take more information into account. Unexpectedly, though, the well-established linear programming model’s performance is worse in this respect than previously thought, despite a promising mapping between linear optimisation and surrogate weight generation which is explored in the paper. Sebastian Lakmayer, Mats Danielson, Love Ekenberg |
SoMeT | 3 |
| 2022 | Evidence-Based Methods for the Development of Computationally Supported Epidemic-Combating PoliciesabstractIn this article, we suggest a group decision method within an integrated computational framework for decision policy. Based on a co-creation workflow, epidemiological estimates, and socioeconomic factors, decisions are considered in a multi-stakeholder, multi-criteria context to elicit attitudes, perceptions, and preferences of relevant stakeholder groups. The complete framework has been applied in Botswana, Romania, and Jordan to assess mitigation actions related to the Covid-19 pandemic in order to mobilize better response strategies for other relevant future scenarios, and potentially more serious pandemics and other hazardous events. The framework was recommended as best practice in the EU under the European Open Science Cloud EOSC, Covid-19 Fast Track Funding. Mats Danielson, Love Ekenberg, Nadejda Komendantova, Adriana Mihai |
SoMeT | 2 |
| 2020 | A Decision Tool for the Water-Energy Nexus in JordanabstractJordan is currently facing a serious problem of water scarcity. It is the fourth water-scarce country in the world. The sustainability of water supply in Jordan is affected not only by the depletion of water reserves but also by increasing electricity tariffs. In this paper, we present some results regarding the water-energy nexus governance in Jordan using a computer-supported co-creative approach for evaluating stakeholder preferences on criteria and possible scenarios of development for the sectors. We describe a decision support tool and a methodology for evaluating stakeholder preferences for both sectors and on possible scenarios of development for the water and energy sectors. We rank possible energy and water futures ranked under a set of sector-relevant criteria while considering entire ranges of possible alternative values and criteria weights. Using second-order probabilistic considerations, we furthermore analyse how plausible it is that a scenario outranks the others. Mats Danielson, Love Ekenberg, Nadejda Komendantova |
SoMeT | 2 |
| 2020 | A second-order-based decision tool for evaluating decisions under conditions of severe uncertainty
Mats Danielson, Love Ekenberg, Aron Larsson |
Knowl. Based Syst. | 2 |
| 2019 | Satellite backhaul for macro-cells, as an alternative to optical fibre, to close the digital divideabstractThe lack of broadband access causes a serious risk of social exclusion, by preventing citizens from full social and economic participation in the society. To avoid this risk, the concept of subsidized rural networks was developed by the European Commission, in which an operator builds, maintains and operates a network (usually an open network) capable of providing at least a 100 Mbps connection to the subscribers; deployed in low density regions being publicly subsidized when unprofitable. In this article, we suggest a methodology to measure a realistic value for the average broadband used per subscriber at busy hour. We also present a simulation model for the backhaul infrastructure costs for very fast networks in rural areas to cover the last, and more expensive, 5% of the population, while comparing optical fibre with satellite for the middle mile from an economical and financial perspective. Marco Araújo, Love Ekenberg, João Confraria |
WCNC | 2 |
| 2019 | An improvement to swing techniques for elicitation in MCDM methods
Mats Danielson, Love Ekenberg |
Knowl. Based Syst. | 2 |
| 2018 | A utility based price model for high capacity rural networks in the European UnionabstractThe European Union has been battling against the digital divide for several decades now when trying to mitigate the risk of social exclusion arising from the lack of broadband access, preventing citizens from full social and economic participation in the society. This has been done in the past by ensuring that a minimum set of services would be available to all end-users at an affordable price. However, various aspects of the rapid advances in technology, market developments and changes in user demand as well as the evolution of the telecommunications infrastructure (5G, IoT, Cloud, gigabit access, etc) increase the risk that citizens of rural areas are facing a severe risk of digital exclusion. To avoid this risk, the concept of subsidised rural networks was created by the European Commission. The idea as such is laudable, but the price tag remains unknown, which severely violates its implementability. In this article, based on the actual cost in a subsidised, but competitive, environment, we suggest a novel approach to realistically determine fair end-user's prices. Marco Araújo, João Confraria, Love Ekenberg |
PIMRC | 3 |
| 2018 | Rural networks cost comparison between 5G (mobile) and FTTx (fixed) scenariosabstractIn this article we simulate the infrastructure costs for very fast networks in rural areas. FTTH technology has been around for at least a decade, but two brand new technologies are expected to launch commercially in the next couple of years: 5G and G. Fast. This could have a strong impact on infrastructure costs and the fulfilment of the European Union, rural coverage objectives. 5G seems to be very promising since LTE is not a reasonable solution for very fast networks. FTTC has so far not been a valid alternative, since for the last mile, the only options for FTTC has been ADSL and VDSL, which however cannot reach very fast data rates. G.Fast is three times faster than VDSL and has the advantage, comparing to FTTH, that the last mile infrastructure is already build in the form of copper local loop. Marco Araújo, Love Ekenberg, João Confraria |
PIMRC | 2 |
| 2018 | Space-Time Trade-Off in Decision Analysis SoftwareabstractIn decision analysis, there are several problems with the assignment of precise numbers to decision components, such as probabilities, values and weighs. These can very seldom realistically be estimated. Therefore, various alternative approaches have been suggested over the years, such as interval, capacity and ranking models. The more general of these are however problematical from several computational viewpoints and in this article, we deal with the server-side issues when converting the application from a stand-alone PC program to a server-client decision analytical software. On a server with a large number of users, space requirements become paramount as opposed to a single user on a PC. On a PC, matrices can be explicitly stored in memory, while on a server, to save space, matrices might have to be stored in an implicit (compacted) way, leading to space-time trade-offs. Mats Danielson, Love Ekenberg |
SoMeT | 2 |
| 2016 | Architectural Considerations for Decision Analysis SoftwareabstractIn classic decision theory, it is assumed that a decision-maker can assign precise numerical values corresponding to the true value of each consequence, as well as precise numerical probabilities for their occurrences. However, in real-life situations, the ordering of alternatives from most to least preferred is often a delicate matter and an adequate mathematical representation is crucial. In attempting to address real-life problems, where uncertainty about data prevails, some kind of representation of imprecise information is important and several have been proposed. However, general methods have turned out to be insufficient and we demonstrate in this article that there is not one set of coding techniques that result in the best performing software for decision analysis. Mats Danielson, Love Ekenberg |
SoMeT | 2 |
| 2015 | Robust Psychiatric Decision Support Using Surrogate Numbers
Mats Danielson, Love Ekenberg, Kristina Sygel |
SoMeT | 2 |
| 2013 | Development of software for decision analysisabstractTo be useful in reality, decision analytical tools must be able to handle imprecise information. This paper presents the algorithmic software design against a background of an evaluation method for analysing decision situations under semi-strong uncertainty. The design is built on a relaxation of the requirement for precise utilities, probabilities, and weights. To handle this, the calculations involved become computationally intensive to match an interactive work flow and the approach required implementation of new algorithms. We describe some particularly interesting implementation aspects of these and show how these computations can be tractable. Mats Danielson, Love Ekenberg |
SoMeT | 2 |
| 2011 | What is Requirements Volatility and How Does it Impact on Software Development?
Love Ekenberg |
SoMeT | 1 |
| 2010 | Web-based analytical decision support systemabstractThis paper presents a web-application supporting structured decision modelling and analysis. The application allows for decision modelling with respect to different preferences and views, allowing for numerically imprecise and vague background probabilities, values, and criteria weights, which further can be adjusted in an interactive fashion when considering calculated decision outcomes. The web-application is based on a decision tool that has been used in a large number of different domains over the last 15 years, ranging from investment decision analysis for companies to public decision support for local governments. Martti Sutinen, Mats Danielson, Love Ekenberg, Aron Larsson |
ISDA | 3 |
| 2010 | Model correspondence as a basis for schema domination
Guy Davies, Love Ekenberg |
Knowl. Based Syst. | 2 |
| 2009 | Development of Algorithms for Decision Analysis with Interval InformationabstractMulti-criteria decision analysis can be a useful tool in routing out and ranking different alternatives. However, many such analyses involve imprecise information, including estimates of utilities, outcome probabilities and criteria weights. This paper presents a general multi-criteria approach, allowing the modelling of multi-criteria and probabilistic problems in the same tree form, which includes a decision tree evaluation method integrated with a framework for analyzing decision situations under risk with a criteria hierarchy. The general method of probabilistic multi-criteria analysis extends the use of additive and multiplicative utility functions for supporting evaluation of imprecise and uncertain facts. Thus, it relaxes the requirement for precise numerical estimates of utilities, probabilities, and weights. The evaluation is done relative to a set of decision rules, generalizing the concept of admissibility and computationally handled through the optimization of aggregated utility functions. The approach required design and development of computationally intensive algorithms for which there was no template Mats Danielson, Love Ekenberg |
SoMeT | 2 |
| 2009 | Warp effects on calculating interval probabilities
David Sundgren, Mats Danielson, Love Ekenberg |
Int. J. Approx. Reason. | 3 |
| 2008 | Some Observations on Elusion, Enrichment and DominationabstractConceptual schemata each representing some component of a system in the making, can be integrated in a variety of ways. Herein, we explore some fundamental notions of this. More particularly, we investigate some ways in which integration through correspondence assertions affects the interrelationship of two component schemata. One of the consequences of combining schemata is the appearance of events, for the united schema, that allow spurious transitions between models, transitions that would not have been possible in one of the original schemata. Much previous work has focussed on dominance with regard to preservation of information capacity as a primary integration criterion. However, even though it is desirable that the information capacity of a combined schema dominate one or both of its constituent schemata, we here discuss some aspects of why domination based on information capacity is insufficient for the integration to be semantically satisfactory. Guy Davies, Love Ekenberg |
SoMeT | 2 |
| 2007 | Distribution of expected utility in decision trees
Mats Danielson, Love Ekenberg, Aron Larsson |
Int. J. Approx. Reason. | 2 |
| 2006 | Multiplicative Properties in Evaluation of Decision TreesabstractIn attempting to address real-life decision problems, where uncertainty about data prevails, some kind of representation of imprecise information is important and several have been proposed. In particular, first-order representations, such as sets of probability measures, upper and lower probabilities, and interval probabilities and utilities of various kinds, have been suggested for enabling a better representation of the input sentences for a subsequent decision analysis. However, sometimes second-order approaches are better suited for modelling incomplete knowledge and we demonstrate how such can add important information when handling aggregations of imprecise representations, as is the case in decision trees or probabilistic networks. Based on this, we suggest a measure of belief density for such intervals. We also demonstrate important properties when operating on general distributions. The results equally apply to approaches which do not explicitly deal with second-order distributions, instead using only first-order concepts such as upper and lower bounds. While the discussion focuses on probabilistic decision trees, the results apply to other formalisms involving products of probabilities, such as probabilistic networks, and to formalisms dealing with products of interval entities such as interval weight trees in multi-criteria decision making. Love Ekenberg, Mats Danielson, Johan Thorbiörnson |
Int. J. Uncertain. Fuzziness Knowl. Based Syst. | 1 |
| 2005 | A Gentle Introduction to System Verification
Love Ekenberg |
SoMeT | 1 |
| 2005 | Value differences using second-order distributions
Love Ekenberg, Johan Thorbiörnson, Tara Baidya |
Int. J. Approx. Reason. | 1 |
| 2005 | Decision Analysis with Multiple Objectives in a Framework for Evaluating ImprecisionabstractWe present a decision tree evaluation method for analyzing multi-attribute decisions under risk, where information is numerically imprecise. The approach extends the use of additive and multiplicative utility functions for supporting evaluation of imprecise statements, relaxing requirements for precise estimates of decision parameters. Information is modeled in convex sets of utility and probability measures restricted by closed intervals. Evaluation is done relative to a set of rules, generalizing the concept of admissibility, computationally handled through optimization of aggregated utility functions. Pros and cons of two approaches, and tradeoffs in selecting a utility function, are discussed. Aron Larsson, Jim Johansson, Love Ekenberg, Mats Danielson |
Int. J. Uncertain. Fuzziness Knowl. Based Syst. | 3 |
| 2004 | A transition logic for schemata conflicts
Veselka Boeva, Love Ekenberg |
Data Knowl. Eng. | 2 |
| 2004 | A framework for determining design correctness
Love Ekenberg, Paul Johannesson |
Knowl. Based Syst. | 1 |
| 2003 | From first-order logic to automated word generation for Lyee
Benedict Amon, Love Ekenberg, Paul Johannesson, Marcelo Munguanaze, Upendo Njabili, Rika Manka Tesha |
Knowl. Based Syst. | 2 |
| 2001 | Second-Order Decision AnalysisabstractThe purpose of this work is to provide theoretical foundations of, as well as some computational aspects on, a theory for analysing decisions under risk, when the available information is vague and imprecise. Many approaches to model unprecise information, e.g., by using interval methods, have prevailed. However, such representation models are unnecessarily restrictive since they do not admit discrimination between beliefs in different values, i.e., the epistemologically possible values have equal weights. In many situations, for instance, when the underlying information results from learning techniques based on variance analyses of statistical data, the expressibility must be extended for a more perceptive treatment of the decision situation. Our contribution herein is an approach for enabling a refinement of the representation model, allowing for an elaborated discrimination of possible values by using belief distributions with weak restrictions. We show how to derive admissible classes of local distributions from sets of global distributions and introduce measures expressing into which extent explicit local distributions can be used for modelling decision situations. As will turn out, this results in a theory that has very attractive features from a computational viewpoint. Love Ekenberg, Johan Thorbiörnson |
Int. J. Uncertain. Fuzziness Knowl. Based Syst. | 1 |
| 2000 | Committees of Learning AgentsabstractWe describe how machine learning and decision theory is combined in an application that supports control room operators of a combined heating and power plant to cope with the overwhelming complexity of situations when severe plant disturbances occur. The application is designed as an assistant, rather than as an automatic system that intervenes directly in the operator/plant loop. The application is required to handle vague and numerically imprecise background information in the construction of classifier committees. A classifier committee (or ensemble) is a classifier created by combining the predictions of multiple sub-classifiers. The presented method combines classifiers into a committee by using computational methods for decision analysis that are designed to work when the information at hand is imprecise. The application evaluates and make priorities between classified alarms according to credibilities that depend on the current context. Machine learning techniques are used to construct classifiers that recognize various malfunctions in a process, determine whether a situation is normal or not, and make priorities among alarms. Lars Asker, Mats Danielson, Love Ekenberg |
Int. J. Uncertain. Fuzziness Knowl. Based Syst. | 3 |
| 2000 | The logic of conflicts between decision making agentsabstractWe present a formal model for the analysis of conflicts in sets of autonomous agents restricted in the sense that they can be described in a (first-order) language and by a transaction mechanism. In this model, we allow for enrichment of agent systems with correspondence assertions, expressing the relationship between different entities in the formal specifications of the agents. Thereafter the specifications are analysed with respect to conflicts. If two specifications are free of conflicts, the formulae of one specification together with the set of correspondence assertions do not restrict the models of the other specification, i.e. the agent system does not restrict the individual agents. The approach takes into account static as well as dynamic aspects of this kind of interaction. Classifications of complexity of determining whether two specifications are free of conflicts are also presented. Furthermore, if the agents are allowed to act in accordance with the result of executions of a decision module, a situation may occur where, for example, subsets of their possible goal sets are consistent, but in actual fact the individual agents may nevertheless always terminate in states that are in conflict. Therefore, the model is also enriched by processes for analysing when specifications are compatible with respect to states for which it is reasonable to assume that they eventually will be reached. Love Ekenberg |
J. Log. Comput. | 1 |
| 1999 | Detecting Temporal Agent Conflicts
Love Ekenberg, Paul Johannesson |
EJC | 1 |
| 1997 | Imposing security constraints on agent-based decision support
Love Ekenberg, Mats Danielson, Magnus Boman |
Decis. Support Syst. | 1 |
| 1996 | A Formal Basis for Dynamic Schema Integration
Love Ekenberg, Paul Johannesson |
ER | 1 |
| 1996 | From Local Assessments to Global RationalityabstractWe present a theory and a tool for the treatment of problems arising when a decision making agent faces a situation involving a choice between a finite set of strategies, having access to a finite set of autonomous agents reporting their opinions. Each of these agents may itself be a decision making agent, and the theory is independent of whether there is a specific coordinating agent or not. Any decision making agent is allowed to assign different credibilities to the statements made by the other autonomous agents. The theory admits the representation of vague and numerically imprecise information, and the evaluation results in a set of admissible strategies by using criteria conforming to classical statistical decision theory. The admissible strategies can be further investigated with respect to strength and also with respect to the range of values that makes them admissible. Love Ekenberg, Mats Danielson, Magnus Boman |
Int. J. Cooperative Inf. Syst. | 1 |
| 1995 | A cost model for managing information security hazards
Love Ekenberg, Subhash Oberoi, István Orci |
Comput. Secur. | 1 |