Diverse Weighted Bipartite b-Matching

Bipartite matching, where agents on one side of a market are matched to agents or items on the other, is a classical problem in computer science and economics, with widespread application in healthcare, education, advertising, and general resource allocation. A practitioner's goal is typically to maximize a matching market's economic efficiency, possibly subject to some fairness requirements that promote equal access to resources. A natural balancing act exists between fairness and efficiency in matching markets, and has been the subject of much research. In this paper, we study a complementary goal---balancing diversity and efficiency---in a generalization of bipartite matching where agents on one side of the market can be matched to sets of agents on the other. Adapting a classical definition of the diversity of a set, we propose a quadratic programming-based approach to solving a supermodular minimization problem that balances diversity and total weight of the solution. We also provide a scalable greedy algorithm with theoretical performance bounds. We then define the price of diversity, a measure of the efficiency loss due to enforcing diversity, and give a worst-case theoretical bound. Finally, we demonstrate the efficacy of our methods on three real-world datasets, and show that the price of diversity is not bad in practice

Computational Aspects of Extending the Shapley Value to Coalitional Games with Externalities

Until recently, computational aspects of the Shapley value were only studied under the assumption that there are no externalities from coalition formation, i.e., that the value of any coalition is independent of other coalitions in the system. However, externalities play a key role in many real-life situations and have been extensively studied in the game-theoretic and economic literature. In this paper, we consider the issue of computing extensions of the Shapley value to coalitional games with externalities proposed by Myerson [21], Pham Do and Norde [23], and McQuillin [17]. To facilitate efficient computation of these extensions, we propose a new representation for coalitional games with externalities, which is based on weighted logical expressions. We demonstrate that this representation is fully expressive and, sometimes, exponentially more concise than the conventional partition function game model. Furthermore, it allows us to compute the aforementioned extensions of the Shapley value in time linear in the size of the input

Aggregated fuzzy answer set programming

Fuzzy Answer Set programming (FASP) is an extension of answer set programming (ASP), based on fuzzy logic. It allows to encode continuous optimization problems in the same concise manner as ASP allows to model combinatorial problems. As a result of its inherent continuity, rules in FASP may be satisfied or violated to certain degrees. Rather than insisting that all rules are fully satisfied, we may only require that they are satisfied partially, to the best extent possible. However, most approaches that feature partial rule satisfaction limit themselves to attaching predefined weights to rules, which is not sufficiently flexible for most real-life applications. In this paper, we develop an alternative, based on aggregator functions that specify which (combination of) rules are most important to satisfy. We extend upon previous work by allowing aggregator expressions to define partially ordered preferences, and by the use of a fixpoint semantics

Automatic assessment of creativity in heuristic problem-solving based on query diversity

Indexación: Web of Science; Scopus.Research, development and innovation are the pillars on which companies rely to offer new products and services capable of attracting consumer demand. This is why creative problem-solving emerges as one of the most relevant skills of the 21st century. Fortunately, there are many creativity training programs that have proven effective. However, many of these programs and methods base on a previous measurement of creativity and require experienced reviewers, they consume time for being manual, and they are far from everyday activities. In this study, we propose a model to estimate the creative quality of users' solutions dealing with heuristic problems, based on the automatic analysis of query patterns issued during the information search to solve the problem. This model has been able to predict the creative quality of solutions produced by 226 users, reaching a sensitivity of 78.43%. Likewise, the level of agreement among reviewers in relation to the creative characteristics is evaluated through two rubrics, and thereby, observing the difficulties of the manual evaluation: subjectivity and effort. The proposed model could be used to foster prompt detection of non-creative solutions and it could be implemented in diverse industrial processes that can range from the recruitment of talent to the evaluation of performance in R&D&I processes.https://www.revistadyna.com/search/automatic-assessment-of-creativity-in-heuristic-problem-solving-based-on-query-diversit