Daniel Granot

According to our database, Daniel Granot authored at least 54 papers between 1975 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Tight Bounds for The Price of Fairness.

Yifeng Cao, Yichuan Ding, Daniel Granot

CoRR, 2023

2021

Consistent Allocation of Emission Responsibility in Fossil Fuel Supply Chains.

Sanjith Gopalakrishnan, Daniel Granot, Frieda Granot

Manag. Sci., 2021

Incentives and Emission Responsibility Allocation in Supply Chains.

Sanjith Gopalakrishnan, Daniel Granot, Frieda Granot, Greys Sosic, Hailong Cui

Manag. Sci., 2021

2019

Monotonicity and conformality in multicommodity network-flow problems.

Iara Ciurria-Infosino, Daniel Granot, Frieda Granot

Networks, 2019

2017

A dynamic price-only contract: Exact and asymptotic results.

Lifei Sheng, Daniel Granot, Woonghee Tim Huh, Mahesh Nagarajan

Oper. Res. Lett., 2017

2015

Multicommodity Production Planning: Qualitative Analysis and Applications.

Iara Ciurria-Infosino, Daniel Granot, Frieda Granot, Arthur F. Veinott Jr.

Manuf. Serv. Oper. Manag., 2015

2014

An auction with positive externality and possible application to overtime rules in football, soccer, and chess.

Daniel Granot, Yigal Gerchak

Oper. Res. Lett., 2014

Teaching & Learning Guide for Speech Variation, Utility, and Game Theory.

Moshe Dror, Daniel Granot, Malcah Yaeger-Dror

Lang. Linguistics Compass, 2014

The k-centrum Chinese Postman delivery problem and a related cost allocation game.

Daniel Granot, Frieda Granot, Harshavardhan Ravichandran

Discret. Appl. Math., 2014

2013

Speech Variation, Utility, and Game Theory.

Moshe Dror, Daniel Granot, Malcah Yaeger-Dror

Lang. Linguistics Compass, 2013

2012

On graphs which can or cannot induce Chinese Postman games with a non-empty core.

Daniel Granot, Frieda Granot

Discret. Appl. Math., 2012

2011

On Chinese postman games where residents of each road pay the cost of their road.

Daniel Granot, Herbert Hamers, Jeroen Kuipers, Michael Maschler

Games Econ. Behav., 2011

2010

The reactive bargaining set for cooperative games.

Daniel Granot

Int. J. Game Theory, 2010

On competitive sequential location in a network with a decreasing demand intensity.

Daniel Granot, Frieda Granot, Tal Raviv

Eur. J. Oper. Res., 2010

2008

Competition and Cooperation in Decentralized Push and Pull Assembly Systems.

Daniel Granot, Shuya Yin

Manag. Sci., 2008

Price and Order Postponement in a Decentralized Newsvendor Model with Multiplicative and Price-Dependent Demand.

Daniel Granot, Shuya Yin

Oper. Res., 2008

My referee and collaborator.

Daniel Granot

Games Econ. Behav., 2008

2007

On sequential commitment in the price-dependent newsvendor model.

Daniel Granot, Shuya Yin

Eur. J. Oper. Res., 2007

2005

Formation of Alliances in Internet-Based Supply Exchanges.

Daniel Granot, Greys Sosic

Manag. Sci., 2005

Ordered optimal solutions and parametric minimum cut problems.

Shelby Brumelle, Daniel Granot, Li Liu

Discret. Optim., 2005

2004

On the equivalence between some local and global Chinese postman and traveling salesman graphs.

Daniel Granot, Herbert Hamers

Discret. Appl. Math., 2004

2003

A Three-Stage Model for a Decentralized Distribution System of Retailers.

Daniel Granot, Greys Sosic

Oper. Res., 2003

Voting for voters: the unanimity case.

Daniel Granot, Michael Maschler, Jonathan Shalev

Int. J. Game Theory, 2003

2002

Cost Allocation for a Tree Network with Heterogeneous Customers.

Daniel Granot, Jeroen Kuipers, Sunil Chopra

Math. Oper. Res., 2002

The vehicle routing problem with pickups and deliveries on some special graphs.

Tali Eilam-Tzoreff, Daniel Granot, Frieda Granot, Greys Sosic

Discret. Appl. Math., 2002

2000

Unanimity in Voting for voters.

Daniel Granot, Michael Maschler, Jonathan Shalev

IGTR, 2000

Naturally submodular digraphs and forbidden digraph configurations.

Daniel Granot, Frieda Granot, Weiping R. Zhu

Discret. Appl. Math., 2000

1999

On some balanced, totally balanced and submodular delivery games.

Daniel Granot, Herbert Hamers, Stef Tijs

Math. Program., 1999

1998

Spanning network games.

Daniel Granot, Michael Maschler

Int. J. Game Theory, 1998

Characterization sets for the nucleolus.

Daniel Granot, Frieda Granot, Weiping R. Zhu

Int. J. Game Theory, 1998

A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints.

Shelby Brumelle, Daniel Granot, Merja Halme, Ilan Vertinsky

Eur. J. Oper. Res., 1998

1997

The reactive bargaining set: Structure, dynamics and extension to NTU games.

Daniel Granot, Michael Maschler

Int. J. Game Theory, 1997

The reactive bargaining set of some flow games and of superadditive simple games.

Daniel Granot, Frieda Granot, Weiping R. Zhu

Int. J. Game Theory, 1997

1994

On Some Optimization Problems on <i>k</i>-Trees and Partial <i>k</i>-Trees.

Daniel Granot, Darko Skorin-Kapov

Discret. Appl. Math., 1994

On the Reduced Game of Some Linear Production Games.

Daniel Granot

Proceedings of the Essays in Game Theory, In Honor of Michael Maschler, 1994

1993

The Repair Kit Problem Revisited.

Shelby Brumelle, Daniel Granot

Oper. Res., 1993

1992

Training and job search in the labor market.

Daniel Granot, Dror Zuckerman

Oper. Res. Lett., 1992

On Some Network Flow Games.

Daniel Granot, Frieda Granot

Math. Oper. Res., 1992

Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem.

Daniel Granot, Frieda Granot

Math. Oper. Res., 1992

1991

NC Algorithms for Recognizing Partial 2-Trees and 3-Trees.

Daniel Granot, Darko Skorin-Kapov

SIAM J. Discret. Math., 1991

1990

On cost allocation in communication networks.

Daniel Granot, Mehran Hojati

Networks, 1990

1987

The Role of Cost Allocation in Locational Models.

Daniel Granot

Oper. Res., 1987

1986

A generalized linear production model: A unifying model.

Daniel Granot

Math. Program., 1986

1985

On market prices in linear production games.

Richard Engelbrecht-Wiggans, Daniel Granot

Math. Program., 1985

1984

On the core and nucleolus of minimum cost spanning tree games.

Daniel Granot, Gur Huberman

Math. Program., 1984

A new exchange property for matroids and its application to max-min-problems.

Daniel Granot

Z. Oper. Research, 1984

Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope.

Daniel Granot, Frieda Granot

Discret. Appl. Math., 1984

1982

An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programs.

Daniel Granot, Frieda Granot, Willem Vaessen

Math. Program., 1982

Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems.

Daniel Granot, Frieda Granot, Ellis L. Johnson

Math. Oper. Res., 1982

1981

Minimum cost spanning tree games.

Daniel Granot, Gur Huberman

Math. Program., 1981

1980

Technical Note - Generalized Covering Relaxation for 0-1 Programs.

Daniel Granot, Frieda Granot

Oper. Res., 1980

1977

Technical Note - On Intersection Cuts in Interval Integer Linear Programming.

Abraham Charnes, Daniel Granot, Frieda Granot

Oper. Res., 1977

Coalitional and Chance-Constrained Solutions to <i>n</i>-Person Games, II: Two-Stage Solutions.

Abraham Charnes, Daniel Granot

Oper. Res., 1977

1975

Technical Note - Approximations for a Service System with Nonindependent Interarrival Times.

Daniel Granot, Frieda Granot, Austin J. Lemoine

Oper. Res., 1975