<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel rdf:about="http://hdl.handle.net/10366/68605">
<title>BORDA. Ponencias / Actas</title>
<link>http://hdl.handle.net/10366/68605</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://hdl.handle.net/10366/167122"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/166398"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/159402"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/153193"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/150302"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/138293"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/137551"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/135627"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/135626"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/135573"/>
<rdf:li rdf:resource="http://hdl.handle.net/10366/135572"/>
</rdf:Seq>
</items>
<dc:date>2026-04-20T19:26:54Z</dc:date>
</channel>
<item rdf:about="http://hdl.handle.net/10366/167122">
<title>Theoretical advancements for the use of d-Choquet integrals with differential privacy</title>
<link>http://hdl.handle.net/10366/167122</link>
<description>[EN] This manuscript overviews the theoretical contribution of the author to the utilization of d-Choquet integrals with a guarantee for differential privacy. This topic has gained traction in 2025.
</description>
<dc:date>2025-09-22T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/166398">
<title>On d-Choquet integrals and differential privacy</title>
<link>http://hdl.handle.net/10366/166398</link>
<description>[EN] This manuscript overviews the contribution of the author to the uti- lization of d-Choquet integrals with a guarantee for differential privacy, a topic that has received considerable attention in 2025.
</description>
<dc:date>2025-07-09T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/159402">
<title>A joint Choquet index from two vectors of weights</title>
<link>http://hdl.handle.net/10366/159402</link>
<description>[EN] The topic of mixing the weighted average means (WAM) and ordered weighted average (OWA) operators has been studied in agonizing detail. It has become one of the most prominent ways to extend OWA operators. Mixed indices using both approaches must use two vectors of weights. Whereas the focus of weights associated with WAM is on the values, the weights associated with OWA focus on order. This work studies how two weights can be combined to produce one single operator sharing traits from both WAMs and OWAs. This operator takes the form of a Choquet integral defined by a 2-additive capacity.
</description>
<dc:date>2024-07-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/153193">
<title>Computation of Choquet integral for finite sets: Notes on a ChatGPT-driven experience</title>
<link>http://hdl.handle.net/10366/153193</link>
<description>The Choquet integral, credited to Gustave Choquet in 1954, initially found its roots in decision making under uncertainty following Schmeidler's pioneering work in this field. Surprisingly, it was not until the 1990s that this integral gained recognition in the realm of multi-criteria decision aid. Nowadays, the Choquet integral boasts numerous generalizations and serves as a focal point for intensive research and development across various domains.&#13;
Here we share our journey of utilizing ChatGPT as a helpful assistant to delve into the computation of the discrete Choquet integral using Mathematica. Additionally, we have demonstrated our ChatGPT experience by crafting a Beamer presentation with its assistance.&#13;
The ultimate aim of this exercise is to pave the way for the application of the discrete Choquet integral in the context of N-soft sets.
</description>
<dc:date>2023-10-06T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/150302">
<title>N-soft sets: semantics and aggregation</title>
<link>http://hdl.handle.net/10366/150302</link>
<description>[EN] We present the first rigorous analysis of both semantics and aggregation of N-soft sets, introduced by the author together with Fatimah et al.
</description>
<dc:date>2022-06-16T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/138293">
<title>Fuzzy soft sets: a model for making choices in an intertemporal framework</title>
<link>http://hdl.handle.net/10366/138293</link>
<description>[EN]This paper introduces a model where the options are characterized by one fuzzy soft set in each of an indefinite number of periods. This model extends the standard case of fuzzy soft sets. We explain how to associate a characteristic fuzzy soft set with each model. Finally, a decision making procedure for the selection of alternatives is proposed.&#13;
The target applications include portfolio selection in finance, environmental issues, et cetera.
</description>
<dc:date>2018-09-15T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/137551">
<title>Decision making under incompleteness based on soft set theory</title>
<link>http://hdl.handle.net/10366/137551</link>
<description>[EN]Decision making with complete and accurate information is ideal but infrequent. Unfortunately, in most cases the available infor- mation is vague, imprecise, uncertain or unknown. The theory of soft sets provides an appropriate framework for decision making that may be used to deal with uncertain decisions. The aim of this paper is to propose and analyze an effective algorithm for multiple attribute decision-making based on soft set theory in an incomplete information environment, when the distribution of incomplete data is unknown. This procedure provides an accurate solution through a combinatorial study of possible cases in the unknown data. Our theoretical development is complemented by practical examples that show the feasibility and implementability of this algorithm. Moreover, we review recent research on decision making from the standpoint of the theory of soft sets under incomplete information.
</description>
<dc:date>2018-06-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/135627">
<title>Ordering infinite utility streams: set-theoretical and topological issues</title>
<link>http://hdl.handle.net/10366/135627</link>
<description>[EN]Invited talk at the Eighth Italian-Spanish Conference on General Topology and its Applications.
</description>
<dc:date>2012-09-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/135626">
<title>Fuzzy sets from the ethics of social preferences: slides for ESTYLF 2014</title>
<link>http://hdl.handle.net/10366/135626</link>
<description>[EN]We show that the problem of evaluating infinite sequences (or streams) of utilities by a unique utility (or social welfare function) can be stated in terms of fuzzy subsets of the set of infinite utility sequences. For each stream, its evaluation can be viewed as its degree of membership to the subset of ‘ethically acceptable’ streams within the set of possible sequences. Since the property ‘being ethically acceptable’ is not well defined and cannot be exactly measured, the fuzzy approach seems especially adequate.
</description>
<dc:date>2014-02-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/135573">
<title>Expanded hesitant fuzzy sets and group decision making: slides for FUZZ-IEEE 2017</title>
<link>http://hdl.handle.net/10366/135573</link>
<description>[EN]We define expanded hesitant fuzzy sets, which incorporate all available information of the decision makers that provide the membership degrees that define a hesitant fuzzy set. We show how this notion relates to hesitant fuzzy set and extended hesitant fuzzy set. We define various scores for this setting, which generalize popular scores for hesitant fuzzy elements. Finally, a group decision making procedure is presented and illustrated with an example.
</description>
<dc:date>2017-07-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10366/135572">
<title>A Social Choice Approach to Graded Soft Sets: slides for FUZZ-IEEE 2017</title>
<link>http://hdl.handle.net/10366/135572</link>
<description>[EN]We establish a correspondence between ideas from soft computing and social choice. This connection permits to draw bridges between choice mechanisms in both frameworks. We prove that both Soft sets and the novel concept of Graded soft sets can be faithfully represented by well-established voting situations in Social Choice. To be precise, their decision making mechanism by choice values coincides with approval voting and the Borda rule respectively. This analysis lays the basis for new insights into soft-set-inspired decision making with a social choice foundation
</description>
<dc:date>2017-07-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
