Browsing All of EconStor by Author Zemel, Eitan


Showing results 1 to 20 of 20
Year of PublicationTitleAuthor(s)
1978Functions for Measuring the Quality of Approximate Solutions to Zero-One Programming ProblemsZemel, Eitan
1979Locating Centers on a Tree with Discontinuous Supply and Demand RegionsTamir, Arie; Zemel, Eitan
1980On Totally Balanced Games and Games of FlowKalai, Ehud; Zemel, Eitan
1980Generalized Network Problems Yielding Totally Balanced GamesKalai, Ehud; Zemel, Eitan
1980Polynomial Algorithms for Estimating Network ReliabilityZemel, Eitan
1980On Search Over RationalsZemel, Eitan
1981On the Core and Dual Set of Linear Programming GamesSamet, Dov; Zemel, Eitan
1983A Linear Time Randomizing Algorithm for Local Roots and Optima of Ranked FunctionsZemel, Eitan
1984An O (n log n) Randomizing Algorithm for the Weighted Euclidean l-Center ProblemMegiddo, Nimrod; Zemel, Eitan
1984Random Binary Search: A Randomizing Algorithm for Global Optimization in R1Zemel, Eitan
1984On Shortest Paths in Graphs with Random WeightsHassin, Refael; Zemel, Eitan
1985Probabilistic Analysis of the Capacitated Transportation ProblemHassin, Refael; Zemel, Eitan
1985On Communication, Bounded Complexity, and CooperationZemel, Eitan
1986On Thc Computational Complexity of Facets of the Knapsack ProblemZemel, Eitan
1986Competitive Location in the PlaneDrezner, Zvi; Zemel, Eitan
1988Nash and Correlated Equilibria: Some Complexity ConsiderationsGilboa, Itzhak; Zemel, Eitan
1988Small Talk and Cooperation A Note on Bounded RationalityZemel, Eitan
1988On The Order of Eliminating Dominated StrategiesKalai, Ehud; Zemel, Eitan
1989The Complexity of Eliminating Dominated StrategiesGilboa, Itzhak; Kalai, Ehud; Zemel, Eitan
1990Learning from Mistakes: A Note on Just-in-Time SystemsOcana, Carlos; Zemel, Eitan