Theory of linear and integer programming
Theory of linear and integer programming
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
Approximate majorization and fair online load balancing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Equitable cost allocations via primal-dual-type algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Cross-layer optimization in TCP/IP networks
IEEE/ACM Transactions on Networking (TON)
On Convex Minimization over Base Polytopes
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
New results on rationality and strongly polynomial time solvability in eisenberg-gale markets
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On Convex Minimization over Base Polytopes
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A Fast and Simple Algorithm for Computing Market Equilibria
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Proportional Response Dynamics in the Fisher Market
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On competitiveness in uniform utility allocation markets
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Balanced allocation with succinct representation
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Finding approximate competitive equilibria: efficient and fair course allocation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
How to allocate goods in an online market?
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Proportional response dynamics in the Fisher market
Theoretical Computer Science
Tatonnement in ongoing markets of complementary goods
Proceedings of the 13th ACM Conference on Electronic Commerce
On competitiveness in uniform utility allocation markets
Operations Research Letters
Mechanism design for fair division: allocating divisible items without payments
Proceedings of the fourteenth ACM conference on Electronic commerce
| Hi-index | 0.00 |
We define a new class of markets, the Eisenberg-Gale markets. This class contains Fisher's linear market, markets from the resource allocation framework of Kelly kelly, as well as numerous interesting new markets.We obtain combinatorial, strongly polynomial algorithms for severalmarkets in this class. Our algorithms have a simple description as ascending price auctions. Our algorithms lead to insights into the efficiency, fairness, rationality of solutions, and competition monotonicity of these markets. A classification of Eisenberg-Gale markets w.r.t. these properties reveals a surprisingly rich set of possibilities.