default search action
Daniel Granot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i1]Yifeng Cao, Yichuan Ding, Daniel Granot:
Tight Bounds for The Price of Fairness. CoRR abs/2311.18339 (2023) - 2021
- [j52]Sanjith Gopalakrishnan
, Daniel Granot
Incentives and Emission Responsibility Allocation in Supply Chains. Manag. Sci. 67(7): 4172-4190 (2021) - [j51]Sanjith Gopalakrishnan
Consistent Allocation of Emission Responsibility in Fossil Fuel Supply Chains. Manag. Sci. 67(12): 7637-7668 (2021)
2010 – 2019
- 2019
- [j50]Iara Ciurria-Infosino, Daniel Granot, Frieda Granot
Monotonicity and conformality in multicommodity network-flow problems. Networks 74(3): 302-319 (2019) - 2017
- [j49]Lifei Sheng, Daniel Granot, Woonghee Tim Huh, Mahesh Nagarajan:
A dynamic price-only contract: Exact and asymptotic results. Oper. Res. Lett. 45(6): 620-624 (2017) - 2015
- [j48]Iara Ciurria-Infosino, Daniel Granot, Frieda Granot, Arthur F. Veinott Jr.:
Multicommodity Production Planning: Qualitative Analysis and Applications. Manuf. Serv. Oper. Manag. 17(4): 589-607 (2015) - 2014
- [j47]Daniel Granot, Frieda Granot
The k-centrum Chinese Postman delivery problem and a related cost allocation game. Discret. Appl. Math. 179: 100-108 (2014) - [j46]Moshe Dror, Daniel Granot, Malcah Yaeger-Dror:
Teaching & Learning Guide for Speech Variation, Utility, and Game Theory. Lang. Linguistics Compass 8(6): 230-242 (2014) - [j45]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): 12-15 (2014) - 2013
- [j44]Moshe Dror, Daniel Granot, Malcah Yaeger-Dror:
Speech Variation, Utility, and Game Theory. Lang. Linguistics Compass 7(11): 561-579 (2013) - 2012
- [j43]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): 2054-2059 (2012) - 2011
- [j42]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): 427-438 (2011) - 2010
- [j41]Daniel Granot, Frieda Granot, Tal Raviv
On competitive sequential location in a network with a decreasing demand intensity. Eur. J. Oper. Res. 205(2): 301-312 (2010) - [j40]Daniel Granot:
The reactive bargaining set for cooperative games. Int. J. Game Theory 39(1-2): 163-170 (2010)
2000 – 2009
- 2008
- [j39]Daniel Granot:
My referee and collaborator. Games Econ. Behav. 64(2): 364 (2008) - [j38]Daniel Granot, Shuya Yin:
Price and Order Postponement in a Decentralized Newsvendor Model with Multiplicative and Price-Dependent Demand. Oper. Res. 56(1): 121-139 (2008) - [j37]Daniel Granot, Shuya Yin:
Competition and Cooperation in Decentralized Push and Pull Assembly Systems. Manag. Sci. 54(4): 733-747 (2008) - 2007
- [j36]Daniel Granot, Shuya Yin:
On sequential commitment in the price-dependent newsvendor model. Eur. J. Oper. Res. 177(2): 939-968 (2007) - 2005
- [j35]Shelby Brumelle, Daniel Granot, Li Liu:
Ordered optimal solutions and parametric minimum cut problems. Discret. Optim. 2(2): 123-134 (2005) - [j34]Daniel Granot, Greys Sosic:
Formation of Alliances in Internet-Based Supply Exchanges. Manag. Sci. 51(1): 92-105 (2005) - 2004
- [j33]Daniel Granot, Herbert Hamers:
On the equivalence between some local and global Chinese postman and traveling salesman graphs. Discret. Appl. Math. 134(1-3): 67-76 (2004) - 2003
- [j32]Daniel Granot, Michael Maschler, Jonathan Shalev:
Voting for voters: the unanimity case. Int. J. Game Theory 31(2): 155-202 (2003) - [j31]Daniel Granot, Greys Sosic:
A Three-Stage Model for a Decentralized Distribution System of Retailers. Oper. Res. 51(5): 771-784 (2003) - 2002
- [j30]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): 193-229 (2002) - [j29]Daniel Granot, Jeroen Kuipers, Sunil Chopra
Cost Allocation for a Tree Network with Heterogeneous Customers. Math. Oper. Res. 27(4): 647-661 (2002) - 2000
- [j28]Daniel Granot, Frieda Granot, Weiping R. Zhu:
Naturally submodular digraphs and forbidden digraph configurations. Discret. Appl. Math. 100(1-2): 67-84 (2000) - [j27]Daniel Granot, Michael Maschler, Jonathan Shalev:
Unanimity in Voting for voters. IGTR 2(2-3): 117-127 (2000)
1990 – 1999
- 1999
- [j26]Daniel Granot, Herbert Hamers, Stef Tijs:
On some balanced, totally balanced and submodular delivery games. Math. Program. 86(2): 355-366 (1999) - 1998
- [j25]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): 408-424 (1998) - [j24]Daniel Granot, Frieda Granot, Weiping R. Zhu:
Characterization sets for the nucleolus. Int. J. Game Theory 27(3): 359-374 (1998) - [j23]Daniel Granot, Michael Maschler:
Spanning network games. Int. J. Game Theory 27(4): 467-500 (1998) - 1997
- [j22]Daniel Granot, Michael Maschler:
The reactive bargaining set: Structure, dynamics and extension to NTU games. Int. J. Game Theory 26(1): 75-95 (1997) - [j21]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): 207-214 (1997) - 1994
- [j20]Daniel Granot, Darko Skorin-Kapov:
On Some Optimization Problems on k-Trees and Partial k-Trees. Discret. Appl. Math. 48(2): 129-145 (1994) - [c1]Daniel Granot:
On the Reduced Game of Some Linear Production Games. Essays in Game Theory 1994: 97-110 - 1993
- [j19]Shelby Brumelle, Daniel Granot:
The Repair Kit Problem Revisited. Oper. Res. 41(5): 994-1006 (1993) - 1992
- [j18]Daniel Granot, Frieda Granot:
Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem. Math. Oper. Res. 17(4): 765-780 (1992) - [j17]Daniel Granot, Frieda Granot:
On Some Network Flow Games. Math. Oper. Res. 17(4): 792-841 (1992) - [j16]Daniel Granot, Dror Zuckerman:
Training and job search in the labor market. Oper. Res. Lett. 11(2): 87-92 (1992) - 1991
- [j15]Daniel Granot, Darko Skorin-Kapov:
NC Algorithms for Recognizing Partial 2-Trees and 3-Trees. SIAM J. Discret. Math. 4(3): 342-354 (1991) - 1990
- [j14]Daniel Granot, Mehran Hojati
On cost allocation in communication networks. Networks 20(2): 209-229 (1990)
1980 – 1989
- 1987
- [j13]Daniel Granot:
The Role of Cost Allocation in Locational Models. Oper. Res. 35(2): 234-248 (1987) - 1986
- [j12]Daniel Granot:
A generalized linear production model: A unifying model. Math. Program. 34(2): 212-222 (1986) - 1985
- [j11]Richard Engelbrecht-Wiggans, Daniel Granot:
On market prices in linear production games. Math. Program. 32(3): 366-370 (1985) - 1984
- [j10]Daniel Granot, Frieda Granot:
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope. Discret. Appl. Math. 9(2): 171-185 (1984) - [j9]Daniel Granot:
A new exchange property for matroids and its application to max-min-problems. Z. Oper. Research 28(1): 41-45 (1984) - [j8]Daniel Granot, Gur Huberman:
On the core and nucleolus of minimum cost spanning tree games. Math. Program. 29(3): 323-347 (1984) - 1982
- [j7]Daniel Granot, Frieda Granot, Ellis L. Johnson:
Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems. Math. Oper. Res. 7(4): 545-556 (1982) - [j6]Daniel Granot, Frieda Granot, Willem Vaessen:
An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programs. Math. Program. 22(1): 350-357 (1982) - 1981
- [j5]Daniel Granot, Gur Huberman:
Minimum cost spanning tree games. Math. Program. 21(1): 1-18 (1981) - 1980
- [j4]Daniel Granot, Frieda Granot:
Technical Note - Generalized Covering Relaxation for 0-1 Programs. Oper. Res. 28(6): 1442-1450 (1980)
1970 – 1979
- 1977
- [j3]Abraham Charnes, Daniel Granot, Frieda Granot:
Technical Note - On Intersection Cuts in Interval Integer Linear Programming. Oper. Res. 25(2): 352-355 (1977) - [j2]Abraham Charnes, Daniel Granot:
Coalitional and Chance-Constrained Solutions to n-Person Games, II: Two-Stage Solutions. Oper. Res. 25(6): 1013-1019 (1977) - 1975
- [j1]Daniel Granot, Frieda Granot, Austin J. Lemoine:
Technical Note - Approximations for a Service System with Nonindependent Interarrival Times. Oper. Res. 23(1): 162-166 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: