EFFICIENT STRATEGY PROOF FAIR ALLOCATION ALGORITHMS
スポンサーリンク
概要
- 論文の詳細を見る
We study a fair division problem with indivisible objects like jobs, houses, and one divisible good like money. Each individual is to be assigned with one object and a certain amount of money. The preferences of individuals over the objects are private information but individuals are assumed to have quasi-linear utilities in money. It is shown that there exist efficient algorithms for eliciting honest preferences and assigning the objects with money to individuals efficiently and fairly.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
塩浦 昭義
上智大学理工学部
-
Sun Ning
Shanghai Univ. Finance And Economics Shanghai Chn
-
Sun Ning
Shanghai Jiao Tong University
-
Yang Zaifu
Yokohama National Univ. Yokohama Jpn
-
Yang Zaifu
Yokohama National University
-
塩浦 昭義
Tohoku University
-
Shioura Akiyoshi
Tohoku University
-
Shioura Akiyoshi
Tohoku Univ.
関連論文
- Scaling Algorithms for M-convex Function Minimization (Mathematical Optimization Theory and its Algorithm)
- M凸関数の最小化に対するスケーリングアルゴリズムとその実験的評価(組合せ)
- スケーリング技法を用いたM凸関数の最小化アルゴリズム
- Quasi M-convex Functions and Minimization Algorithms (Algorithm Engineering as a New Paradigm)
- Extension of M-convexity and L-convexity to Polyhedral Convex Functions : Extended Abstract (Continuous and Discrete Mathematics for Optimization)
- M-Convex Function on Generalized Polymatroid(Continuous and Discrete Mathematical Optimization)
- 一般化ポリマトロイド上のM凸関数(組合せ最適化(3))
- Quantitative determination of MCC-555, a novel insulin sensitizer in beagle dog plasma by high-performance liquid chromatography with fluorescence detection
- EFFICIENT STRATEGY PROOF FAIR ALLOCATION ALGORITHMS
- NOTE ON THE CONTINUITY OF M-CONVEX AND L-CONVEX FUNCTIONS IN CONTINUOUS VARIABLES
- On a class of discrete convolution concave functions and their applications
- Surjective function theorems with economic application
- Dijkstra Algorithm Viewed from Discrete Convex Analysis (コンピュテーション)
- OPTIMAL ALLOCATION PROBLEM WITH QUADRATIC UTILITY FUNCTIONS AND ITS RELATIONSHIP WITH GRAPH CUT PROBLEM
- 離散凸解析から見たDijkstra法