Daniel Granot

Publication Activity (10 Years)

Years Active: 1975-2023
Publications (10 Years): 5

Top Topics

Qualitative Analysis

Top Venues

Lang. Linguistics Compass

Oper. Res. Lett.

Manuf. Serv. Oper. Manag.

Publications

Yifeng Cao, Yichuan Ding, Daniel Granot
Tight Bounds for The Price of Fairness. CoRR (2023)
Sanjith Gopalakrishnan, Daniel Granot, Frieda Granot, Greys Sosic, Hailong Cui
Incentives and Emission Responsibility Allocation in Supply Chains. Manag. Sci. 67 (7) (2021)
Sanjith Gopalakrishnan, Daniel Granot, Frieda Granot
Consistent Allocation of Emission Responsibility in Fossil Fuel Supply Chains. Manag. Sci. 67 (12) (2021)
Iara Ciurria-Infosino, Daniel Granot, Frieda Granot
Monotonicity and conformality in multicommodity network-flow problems. Networks 74 (3) (2019)
Lifei Sheng, Daniel Granot, Woonghee Tim Huh, Mahesh Nagarajan
A dynamic price-only contract: Exact and asymptotic results. Oper. Res. Lett. 45 (6) (2017)
Iara Ciurria-Infosino, Daniel Granot, Frieda Granot, Arthur F. Veinott Jr.
Multicommodity Production Planning: Qualitative Analysis and Applications. Manuf. Serv. Oper. Manag. 17 (4) (2015)
Daniel Granot, Yigal Gerchak
An auction with positive externality and possible application to overtime rules in football, soccer, and chess. Oper. Res. Lett. 42 (1) (2014)
Daniel Granot, Frieda Granot, Harshavardhan Ravichandran
The k-centrum Chinese Postman delivery problem and a related cost allocation game. Discret. Appl. Math. 179 (2014)
Moshe Dror, Daniel Granot, Malcah Yaeger-Dror
Teaching & Learning Guide for Speech Variation, Utility, and Game Theory. Lang. Linguistics Compass 8 (6) (2014)
Moshe Dror, Daniel Granot, Malcah Yaeger-Dror
Speech Variation, Utility, and Game Theory. Lang. Linguistics Compass 7 (11) (2013)
Daniel Granot, Frieda Granot
On graphs which can or cannot induce Chinese Postman games with a non-empty core. Discret. Appl. Math. 160 (13-14) (2012)
Daniel Granot, Herbert Hamers, Jeroen Kuipers, Michael Maschler
On Chinese postman games where residents of each road pay the cost of their road. Games Econ. Behav. 72 (2) (2011)
Daniel Granot
The reactive bargaining set for cooperative games. Int. J. Game Theory 39 (1-2) (2010)
Daniel Granot, Frieda Granot, Tal Raviv
On competitive sequential location in a network with a decreasing demand intensity. Eur. J. Oper. Res. 205 (2) (2010)
Daniel Granot, Shuya Yin
Price and Order Postponement in a Decentralized Newsvendor Model with Multiplicative and Price-Dependent Demand. Oper. Res. 56 (1) (2008)
Daniel Granot, Shuya Yin
Competition and Cooperation in Decentralized Push and Pull Assembly Systems. Manag. Sci. 54 (4) (2008)
Daniel Granot
My referee and collaborator. Games Econ. Behav. 64 (2) (2008)
Daniel Granot, Shuya Yin
On sequential commitment in the price-dependent newsvendor model. Eur. J. Oper. Res. 177 (2) (2007)
Shelby Brumelle, Daniel Granot, Li Liu
Ordered optimal solutions and parametric minimum cut problems. Discret. Optim. 2 (2) (2005)
Daniel Granot, Greys Sosic
Formation of Alliances in Internet-Based Supply Exchanges. Manag. Sci. 51 (1) (2005)
Daniel Granot, Herbert Hamers
On the equivalence between some local and global Chinese postman and traveling salesman graphs. Discret. Appl. Math. 134 (1-3) (2004)
Daniel Granot, Michael Maschler, Jonathan Shalev
Voting for voters: the unanimity case. Int. J. Game Theory 31 (2) (2003)
Daniel Granot, Greys Sosic
A Three-Stage Model for a Decentralized Distribution System of Retailers. Oper. Res. 51 (5) (2003)
Daniel Granot, Jeroen Kuipers, Sunil Chopra
Cost Allocation for a Tree Network with Heterogeneous Customers. Math. Oper. Res. 27 (4) (2002)
Tali Eilam-Tzoreff, Daniel Granot, Frieda Granot, Greys Sosic
The vehicle routing problem with pickups and deliveries on some special graphs. Discret. Appl. Math. 116 (3) (2002)
Daniel Granot, Frieda Granot, Weiping R. Zhu
Naturally submodular digraphs and forbidden digraph configurations. Discret. Appl. Math. 100 (1-2) (2000)
Daniel Granot, Michael Maschler, Jonathan Shalev
Unanimity in Voting for voters. IGTR 2 (2-3) (2000)
Daniel Granot, Herbert Hamers, Stef Tijs
On some balanced, totally balanced and submodular delivery games. Math. Program. 86 (2) (1999)
Daniel Granot, Frieda Granot, Weiping R. Zhu
Characterization sets for the nucleolus. Int. J. Game Theory 27 (3) (1998)
Shelby Brumelle, Daniel Granot, Merja Halme, Ilan Vertinsky
A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints. Eur. J. Oper. Res. 106 (2-3) (1998)
Daniel Granot, Michael Maschler
Spanning network games. Int. J. Game Theory 27 (4) (1998)
Daniel Granot, Michael Maschler
The reactive bargaining set: Structure, dynamics and extension to NTU games. Int. J. Game Theory 26 (1) (1997)
Daniel Granot, Frieda Granot, Weiping R. Zhu
The reactive bargaining set of some flow games and of superadditive simple games. Int. J. Game Theory 26 (2) (1997)
Daniel Granot, Darko Skorin-Kapov
-Trees. Discret. Appl. Math. 48 (2) (1994)
Daniel Granot
On the Reduced Game of Some Linear Production Games. Essays in Game Theory (1994)
Shelby Brumelle, Daniel Granot
The Repair Kit Problem Revisited. Oper. Res. 41 (5) (1993)
Daniel Granot, Dror Zuckerman
Training and job search in the labor market. Oper. Res. Lett. 11 (2) (1992)
Daniel Granot, Frieda Granot
On Some Network Flow Games. Math. Oper. Res. 17 (4) (1992)
Daniel Granot, Frieda Granot
Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem. Math. Oper. Res. 17 (4) (1992)
Daniel Granot, Darko Skorin-Kapov
NC Algorithms for Recognizing Partial 2-Trees and 3-Trees. SIAM J. Discret. Math. 4 (3) (1991)
Daniel Granot, Mehran Hojati
On cost allocation in communication networks. Networks 20 (2) (1990)
Daniel Granot
The Role of Cost Allocation in Locational Models. Oper. Res. 35 (2) (1987)
Daniel Granot
A generalized linear production model: A unifying model. Math. Program. 34 (2) (1986)
Richard Engelbrecht-Wiggans, Daniel Granot
On market prices in linear production games. Math. Program. 32 (3) (1985)
Daniel Granot, Frieda Granot
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope. Discret. Appl. Math. 9 (2) (1984)
Daniel Granot
A new exchange property for matroids and its application to max-min-problems. Z. Oper. Research 28 (1) (1984)
Daniel Granot, Gur Huberman
On the core and nucleolus of minimum cost spanning tree games. Math. Program. 29 (3) (1984)
Daniel Granot, Frieda Granot, Ellis L. Johnson
Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems. Math. Oper. Res. 7 (4) (1982)
Daniel Granot, Frieda Granot, Willem Vaessen
An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programs. Math. Program. 22 (1) (1982)
Daniel Granot, Gur Huberman
Minimum cost spanning tree games. Math. Program. 21 (1) (1981)
Daniel Granot, Frieda Granot
Technical Note - Generalized Covering Relaxation for 0-1 Programs. Oper. Res. 28 (6) (1980)
Abraham Charnes, Daniel Granot, Frieda Granot
Technical Note - On Intersection Cuts in Interval Integer Linear Programming. Oper. Res. 25 (2) (1977)
Abraham Charnes, Daniel Granot
-Person Games, II: Two-Stage Solutions. Oper. Res. 25 (6) (1977)
Daniel Granot, Frieda Granot, Austin J. Lemoine
Technical Note - Approximations for a Service System with Nonindependent Interarrival Times. Oper. Res. 23 (1) (1975)