Results 171 to 180 of about 3,305 (196)
Some of the next articles are maybe not open access.

A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model

2003
The stable marriage model due to Gale and Shapley is one of the most fundamental two-sided matching models. Recently, Fleiner generalized the model in terms of matroids, and Eguchi and Fujishige extended the matroidal model to the framework of discrete convex analysis.
Akinobu Eguchi   +2 more
openaire   +1 more source

Resource service sharing in cloud manufacturing based on the Gale–Shapley algorithm: advantages and challenge

International Journal of Computer Integrated Manufacturing, 2015
Cloud manufacturing CMfg is emerging as a novel manufacturing paradigm which enables large-scale resource service RS sharing by providing manufacturing resources as consumable services. However, the impacts of CMfg RS sharing on individual enterprise as well as the manufacturing industry in aspects such as resource utilisation, needs satisfaction and ...
Yongkui Liu 0002   +3 more
openaire   +1 more source

On the Gale-Shapley Algorithm for Stable Matchings with a Partial Honesty Nash Refinement

International Joint Conference on Autonomous Agents and Multiagent Systems
It has long been known that every individually rational matching is obtainable by some Nash equilibrium --- even those that make little sense in practice. In the social choice and voting literature, Nash refinements are commonly used to avoid these spurious equilibria.
James P. Bailey, Craig A. Tovey
openaire   +2 more sources

Cheating by Men in the Gale-Shapley Stable Matching Algorithm

2006
This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for every cheating man to get a better partner than the one he gets if everyone is truthful. We study how to circumvent this theorem and incite men to cheat.
openaire   +1 more source

Stable matchings and equilibrium outcomes of the Gale-Shapley's algorithm for the marriage problem

Economics Letters, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Applying the Gale-Shapley Stable Matching Algorithm to Peer Human-Robot Task Allocation

Volume 3: Industrial Applications; Modeling for Oil and Gas, Control and Validation, Estimation, and Control of Automotive Systems; Multi-Agent and Networked Systems; Control System Design; Physical Human-Robot Interaction; Rehabilitation Robotics; Sensing and Actuation for Control; Biomedical Systems; Time Delay Systems and Stability; Unmanned Ground and Surface Robotics; Vehicle Motion Controls; Vibration Analysis and Isolation; Vibration and Control for Energy Harvesting; Wind Energy, 2014
When human and robotic agents work together, the challenge in assigning tasks lies in exploiting human strengths, such as expertise and intuition, while still managing the heterogeneous agent team in a near-optimal way. An extension to the Gale-Shapley stable matching algorithm that combines a sequential greedy approach is proposed to apply to task ...
Elena L. Carano   +2 more
openaire   +1 more source

Coalitional permutation manipulations in the Gale-Shapley algorithm

Artificial Intelligence, 2021
Weiran Shen, Yuan Deng
exaly  

STUDENT SELECTION TO UNIVERSITY ADMISSION: STABLE MATCHING THEORY AND GALE-SHAPLEY ALGORITHM

FAIR KỶ YẾU HỘI NGHỊ KHOA HỌC CÔNG NGHỆ QUỐC GIA LẦN THỨ XVI Nghiên cứu cơ bản và Ứng dụng công nghệ thông tin Proceedings of the 16th National Conference on Fundamental and Applied Information Technology Research (FAIR’2023), 2023
Trinh Bao Ngoc   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy