Search Results

In a housing market of Shapley and Scarf, each agent is endowed with one indivisible object and has preferences over all objects. An allocation of the objects is in the (strong) core if there exists no (weakly) blocking coalition. We show that, for strict ...

We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalizes committee elections (where there is a single constraint on the number of candidates that need to be selected), ...

In the paper, a cooperative differential network game with infinite duration in which players follow different types of behavior (to cooperate or to act individually in their own interests) is considered. As solutions the core and the Shapley ...

The core is a central solution concept in cooperative game theory, defined as the set of feasible allocations or payments such that no subset of agents has incentive to break away and form their own subgroup or coalition. However, it has long been known ...

A voting rule decides on a probability distribution over a set of m alternatives, based on rankings of those alternatives provided by agents. We assume that agents have cardinal utility functions over the alternatives, but voting rules have access to only ...

Problem definition: We consider the parallel machine scheduling (PMS) under job-splitting game defined by a set of manufacturers where each holds uniform parallel machines and each is committed to produce some jobs submitted to her by her clients while ...

The densest subgraph problem (DSP) is of great significance due to its wide applications in different domains. Meanwhile, diverse requirements in various applications lead to different density variants for DSP. Unfortunately, existing DSP algorithms ...

Conferences like AAMAS and NeurIPS have attracted submissions from a large number of communities. This has resulted in a poor reviewing experience for communities, whose submissions are assigned to less qualified reviewers outside of their communities. ...

We introduce a natural variant of weighted voting games, which we refer to as k-Prize Weighted Voting Games. Such games consist of n players with weights, and k prizes, of possibly differing values. The players form coalitions, and the i-th largest ...

Attribute reduction for incomplete data is a hot topic in rough set theory (RST). A fuzzy probabilistic information system (FPIS) combines of fuzzy relations that satisfy the probability distribution about objects, which can be regarded as an information ...

The present paper proposes a novel version of inducing nano topology by using new kinds of approximation operators via two ideals with respect to a general binary relation. This approach improves the accuracy of the approximation quite significantly. ...

The growth in air traffic (before the Covid-19 pandemic) made airport time slots an increasingly scarce resource (and it is believed that this growth will continue after recovery). It is widely acknowledged that the grandfathering schemes used nowadays ...

Combinatorial auctions are regularly used to allocate resources worth billions of dollars. However, finding optimal payment rules for such auctions is still an open problem. To this end, we develop a new computational search framework for finding payment ...

We study the design of core-selecting payment rules for combinatorial auctions, a challenging setting where no strategyproof rules exist. We show that the rule most commonly used in practice, the Quadratic rule, can be improved on in terms of efficiency, ...

A voting rule decides on a probability distribution over a set of m alternatives, based on rankings of those alternatives provided by agents. We assume that agents have cardinal utility functions over the alternatives, but voting rules have access to ...

To overcome incompatibility issues, kidney patients may swap their donors. In international kidney exchange programmes (IKEPs), countries merge their national patient-donor pools. We consider a recent credit system where in each round, countries are ...

Due to the rapid growth of the components encapsulated on the on-chip architecture, the performance degradation and communication issues between the cores significantly impact NoC architecture. It also increases the possibility of core failures ...

This document defines how to compress Constrained Application Protocol (CoAP) headers using the Static Context Header Compression and fragmentation (SCHC) framework. SCHC defines a header compression mechanism adapted for Constrained Devices. SCHC uses ...

This paper studies cooperative games in which players have multiple attributes. Such games are applicable to situations in which each player has a finite number of independent additive attributes in cooperative games and the payoffs of coalitions are ...

The aim of this paper is to introduce the concepts of soft rough q-rung orthopair fuzzy set (SRqROFS) and q-rung orthopair fuzzy soft rough set (qROPFSRS) based on soft rough set and fuzzy soft relation, respectively. We define some fundamental operations ...

An information system (IS) is an important mathematical tool for artificial intelligence. A fuzzy probabilistic information system (FPIS), the combination of some fuzzy relations in the same universe which satisfies the probability distribution, can be ...