Browsing All of EconStor by Author Zemel, Eitan
Showing results 1 to 20 of 20
Year of Publication | Title | Author(s) |
1978 | Functions for Measuring the Quality of Approximate Solutions to Zero-One Programming Problems | Zemel, Eitan |
1979 | Locating Centers on a Tree with Discontinuous Supply and Demand Regions | Tamir, Arie; Zemel, Eitan |
1980 | On Totally Balanced Games and Games of Flow | Kalai, Ehud; Zemel, Eitan |
1980 | Generalized Network Problems Yielding Totally Balanced Games | Kalai, Ehud; Zemel, Eitan |
1980 | Polynomial Algorithms for Estimating Network Reliability | Zemel, Eitan |
1980 | On Search Over Rationals | Zemel, Eitan |
1981 | On the Core and Dual Set of Linear Programming Games | Samet, Dov; Zemel, Eitan |
1983 | A Linear Time Randomizing Algorithm for Local Roots and Optima of Ranked Functions | Zemel, Eitan |
1984 | An O (n log n) Randomizing Algorithm for the Weighted Euclidean l-Center Problem | Megiddo, Nimrod; Zemel, Eitan |
1984 | Random Binary Search: A Randomizing Algorithm for Global Optimization in R1 | Zemel, Eitan |
1984 | On Shortest Paths in Graphs with Random Weights | Hassin, Refael; Zemel, Eitan |
1985 | Probabilistic Analysis of the Capacitated Transportation Problem | Hassin, Refael; Zemel, Eitan |
1985 | On Communication, Bounded Complexity, and Cooperation | Zemel, Eitan |
1986 | On Thc Computational Complexity of Facets of the Knapsack Problem | Zemel, Eitan |
1986 | Competitive Location in the Plane | Drezner, Zvi; Zemel, Eitan |
1988 | Nash and Correlated Equilibria: Some Complexity Considerations | Gilboa, Itzhak; Zemel, Eitan |
1988 | Small Talk and Cooperation A Note on Bounded Rationality | Zemel, Eitan |
1988 | On The Order of Eliminating Dominated Strategies | Kalai, Ehud; Zemel, Eitan |
1989 | The Complexity of Eliminating Dominated Strategies | Gilboa, Itzhak; Kalai, Ehud; Zemel, Eitan |
1990 | Learning from Mistakes: A Note on Just-in-Time Systems | Ocana, Carlos; Zemel, Eitan |