261 search results - page 4 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
CSR
2008
Springer
15 years 1 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
105
click to vote
FOCS
2008
IEEE
14 years 11 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
ALT
2003
Springer
15 years 8 months ago
2003
Springer
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
104
click to vote
SIAMJO
2000
14 years 11 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...