The Complexity of Egalitarian Mechanisms for Linear Programming Games

Operations Research Letters - Netherlands
doi 10.1016/j.orl.2013.12.003
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

On the Worst Case Complexity of Potential Reduction Algorithms for Linear Programming

Mathematical Programming, Series B
MathematicsSoftware
1997English

Incorporating Condition Measures Into the Complexity Theory of Linear Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1995English

Smoothed Analysis of Condition Numbers and Complexity Implications for Linear Programming

Mathematical Programming, Series B
MathematicsSoftware
2009English

Bilevel Programming for Analysis of Low-Complexity Control of Linear Systems With Constraints

2009English

Linear Programming Approach to Matrix Games With Intuitionistic Fuzzy Goals

International Journal of Computational Intelligence Systems
Computational MathematicsComputer Science
2013English

Collinearity Between the Shapley Value and the Egalitarian Division Rules for Cooperative Games

Operations-Research-Spektrum
Management ScienceOperations Research
1996English

The Descriptive Complexity of Parity Games

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Polynomial Algorithms for Linear Programming

Lecture Notes in Economics and Mathematical Systems
MathematicsEconomicsEconometricsFinance
1988English

Linear Programming

OR
1967English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy