A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments

Rashid Farooq

首页> 外文期刊>Japan Journal of Industrial and Applied Mathematics >A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments

【24h】

A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments

机译：具有线性估值和有边际支付的稳定匹配问题的多项式时间算法

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We study an extension of the Gale-Shapley marriage model and the Shapley-Shubik assignment model by considering linear valuations and bounded side payments. Our model includes the Eriksson-Karlander hybrid model as a special case. We propose a polynomial-time algorithm which finds a pairwise-stable outcome.

机译：我们通过考虑线性估值和有限边际支付来研究Gale-Shapley婚姻模型和Shapley-Shubik分配模型的扩展。我们的模型包括Eriksson-Karlander混合模型作为特例。我们提出了一种多项式时间算法，该算法可以找到成对稳定的结果。

著录项

来源
《Japan Journal of Industrial and Applied Mathematics》 |2008年第1期|83-98|共16页
作者
Rashid Farooq;
展开▼
作者单位

Centre for Advanced Mathematics and Physics National University of Sciences and Technology Campus of College of Electrical and Mechanical Engineering Peshawar Road 46000 Rawalpindi Pakistan;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
stable marriage model; assignment game;

机译：稳定的婚姻模式;分配博弈;

相似文献

外文文献
中文文献
专利

1. A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments [J] . Farooq R Japan journal of industrial and applied mathematics . 2008,第1期

机译：线性估值稳定匹配问题的多项式算法和有界副本支付
2. A Polynomial-Time Algorithm to Find von Neumann-Morgenstern Stable Matchings in Marriage Games [J] . Jun Wako Algorithmica . 2010,第1期

机译：婚姻游戏中寻找冯·诺伊曼-摩根斯坦稳定匹配的多项式时间算法
3. A Polynomial-Time Algorithm to Find von Neumann-Morgenstern Stable Matchings in Marriage Games [J] . Jun Wako Algorithmica . 2010,第1期

机译：婚姻游戏中寻找冯·诺伊曼-摩根斯坦稳定匹配的多项式时间算法
4. A Polynomial-Time Algorithm for Computing Response Time Bounds in Static Priority Scheduling Employing Multi-Linear Workload Bounds [C] . Steffen Stein, Matthias Ivers, Jonas Diemer, Euromicro Conference on Real-Time Systems . 2010

机译：一种用于计算静态优先级调度的响应时间限制的多项式算法，采用多线性工作量界限
5. The bounded linear calculus: A characterization of the class of polynomial-time computable functions based on bounded linear logic [D] . Pitt, Francois 1994

机译：有界线性演算：基于有界线性逻辑的多项式时间可计算函数的表征
6. Bounds and Algorithms for Fast Exact Searches of Chemical Fingerprints in Linear and Sub-Linear Time [O] . S. Joshua Swamidass, Pierre Baldi -1

机译：在线性和亚线性时间内快速精确搜索化学指纹的界限和算法
7. A Polynomial-time Algorithm for a Stable Matching Problem with Linear Valuations and Bounded Side Payments [O] . Rashid Farooq 2013

机译：线性估值与有界边支付稳定匹配问题的多项式时间算法

A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments

摘要

著录项

相似文献

相关主题

期刊订阅