The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform

Tian Yu - One of the best experts on this subject based on the ideXlab platform.

  • logistics service quantity discount return subcontract model
    Industrial Engineering and Management, 2006
    Co-Authors: Tian Yu
    Abstract:

    This paper considers the problem of coordination mechanism between third-party logistics supplier and subcontractor.Comparing with the return contract opinion which focuses on optimization from the third-party logistics supplier,s perspective proposed by Alfredsson M,a three-stage logistics service quantity discount—return subcontract model is proposed from the subcontractor,s perspective which is composed by return contract models,subgame Nash-perfect equilibrium model and quantity discount—return model,comparing them with the initial model gradually,it is demonstrated that Pareto Efficiency can be attained in the model and the scenarios are illustrated through a numerical example.

  • logistics service quantity discount return subcontract model
    Journal of Hanzhou University of Commerce, 2005
    Co-Authors: Tian Yu
    Abstract:

    This paper considers the problem of coordination mechanism between third-party logistics supplier and subcontractor.Compared with the return contract opinion which focuses on optimization from the third-party logistics supplier's,s perspective proposed by Berglund M,a three-stage logistics service quantity discount—return subcontract model is proposed from the subcontractor's perspective which is composed by return contract models,subgame Nash-perfect equilibrium model and quantity discount—return model.Compared with the initial model gradually,it is demonstrated that Pareto Efficiency can be attained in the model and the scenarios are illustrated through a numerical example.

J M Schumacher - One of the best experts on this subject based on the ideXlab platform.

  • ex ante estate division under strong Pareto Efficiency
    Social Science Research Network, 2021
    Co-Authors: J M Schumacher
    Abstract:

    The bankruptcy problem is to divide a homogeneous divisible good (the “estate”) between claimants, when the sum of the claims exceeds the value of the estate. When the problem is looked at from an ex-ante point of view (i.e. before the size of the estate is revealed), it is possible to formulate a notion of Pareto Efficiency that is stronger than when the more common ex-post perspective is taken. Under the assumption of common beliefs, the strong notion of Efficiency leads, in combination with the requirement that all claims should be fulfilled when the value of the estate is equal to the sum of the claims, to a uniquely defined division rule when utility functions for all agents are given. The resulting rule can be represented in the form of a parametric function. A characterization is given of the parametric functions that can be obtained in this way when all agents are equipped with the same utility function. In particular, it is shown that two well-known division rules for the bankruptcy problem, namely Constrained Equal Losses and Proportional Division, can be rationalized under strong Pareto Efficiency by constant absolute risk aversion and constant relative risk aversion respectively.

  • ex ante estate division under strong Pareto Efficiency
    Mathematical Social Sciences, 2021
    Co-Authors: J M Schumacher
    Abstract:

    Abstract The bankruptcy problem is to divide a homogeneous divisible good (the “estate”) between claimants, when the sum of the claims exceeds the value of the estate. When the problem is looked at from an ex-ante point of view (i.e. before the size of the estate is revealed), it is possible to formulate a notion of Pareto Efficiency that is stronger than when the more common ex-post perspective is taken. Under the assumption of common beliefs, the strong notion of Efficiency leads, in combination with the requirement that all claims should be fulfilled when the value of the estate is equal to the sum of the claims, to a uniquely defined division rule when utility functions for all agents are given. The resulting rule can be represented in the form of a parametric function. For the case in which all agents are equipped with the same utility function, the class of parametric functions that can be obtained in this way is characterized. In particular, it is shown that two well-known division rules for the bankruptcy problem, namely Constrained Equal Losses and Proportional Division, can be rationalized under strong Pareto Efficiency by constant absolute risk aversion and constant relative risk aversion respectively.

Alfred Galichon - One of the best experts on this subject based on the ideXlab platform.

  • Pareto Efficiency for the concave order and multivariate comonotonicity
    Journal of Economic Theory, 2012
    Co-Authors: Guillaume Carlier, Rose-anne Dana, Alfred Galichon
    Abstract:

    This paper studies efficient risk-sharing rules for the concave dominance order. For a univariate risk, it follows from a comonotone dominance principle, due to Landsberger and Meilijson [27], that Efficiency is characterized by a comonotonicity condition. The goal of the paper is to generalize the comonotone dominance principle as well as the equivalence between Efficiency and comonotonicity to the multidimensional case. The multivariate case is more involved (in particular because there is no immediate extension of the notion of comonotonicity), and it is addressed by using techniques from convex duality and optimal transportation.

  • Pareto Efficiency for the concave order and multivariate comonotonicity
    arXiv: Optimization and Control, 2009
    Co-Authors: Guillaume Carlier, Rose-anne Dana, Alfred Galichon
    Abstract:

    In this paper, we focus on efficient risk-sharing rules for the concave dominance order. For a univariate risk, it follows from a comonotone dominance principle, due to Landsberger and Meilijson [25], that Efficiency is characterized by a comonotonicity condition. The goal of this paper is to generalize the comonotone dominance principle as well as the equivalence between Efficiency and comonotonicity to the multi-dimensional case. The multivariate setting is more involved (in particular because there is no immediate extension of the notion of comonotonicity) and we address it using techniques from convex duality and optimal transportation.

Eve Ramaekers - One of the best experts on this subject based on the ideXlab platform.

  • fair allocation of indivisible goods the two agent case
    Social Choice and Welfare, 2013
    Co-Authors: Eve Ramaekers
    Abstract:

    One must allocate a finite set of indivisible goods among two agents without monetary compensation. We impose Pareto-Efficiency, anonymity, a weak notion of no-envy, a welfare lower bound based on each agent's ranking of the subsets of goods, and a monotonicity property w.r.t. changes in preferences. We prove that there is a rule satisfying these axioms. If there are three goods, it is the only rule, together with one of its subcorrespondences, satisfying each fairness axiom and not discriminating between goods.

  • characterizations of Pareto efficient fair and strategy proof allocation rules in queueing problems
    LIDAM Reprints CORE, 2010
    Co-Authors: Cagatay Kayi, Eve Ramaekers
    Abstract:

    A set of agents with possibly different waiting costs have to receive the same service one after the other. Efficiency requires to maximize total welfare. Equity requires to at least treat equal agents equally. One must form a queue, set up monetary transfers to compensate agents having to wait, and not a priori arbitrarily exclude agents from positions. As one may not know agents’ waiting costs, they may have no incentive to reveal them. We identify the only rule satisfying Pareto-Efficiency, a weak equity axiom as equal treatment of equals in welfare or symmetry, and strategy-proofness. It satisfies stronger axioms, as no-envy and anonymity. Further, its desirability extends to related problems. To obtain these results, we prove that even non-single-valued rules satisfy Pareto-Efficiency of queues and strategy-proofness if and only if they select Pareto-efficient queues and set transfers in the spirit of Groves (1973). This holds in other problems, provided the domain of quasi-linear preferences is rich enough. (This abstract was borrowed from another version of this item.)

Guillaume Carlier - One of the best experts on this subject based on the ideXlab platform.

  • Pareto Efficiency for the concave order and multivariate comonotonicity
    Journal of Economic Theory, 2012
    Co-Authors: Guillaume Carlier, Rose-anne Dana, Alfred Galichon
    Abstract:

    This paper studies efficient risk-sharing rules for the concave dominance order. For a univariate risk, it follows from a comonotone dominance principle, due to Landsberger and Meilijson [27], that Efficiency is characterized by a comonotonicity condition. The goal of the paper is to generalize the comonotone dominance principle as well as the equivalence between Efficiency and comonotonicity to the multidimensional case. The multivariate case is more involved (in particular because there is no immediate extension of the notion of comonotonicity), and it is addressed by using techniques from convex duality and optimal transportation.

  • Pareto Efficiency for the concave order and multivariate comonotonicity
    arXiv: Optimization and Control, 2009
    Co-Authors: Guillaume Carlier, Rose-anne Dana, Alfred Galichon
    Abstract:

    In this paper, we focus on efficient risk-sharing rules for the concave dominance order. For a univariate risk, it follows from a comonotone dominance principle, due to Landsberger and Meilijson [25], that Efficiency is characterized by a comonotonicity condition. The goal of this paper is to generalize the comonotone dominance principle as well as the equivalence between Efficiency and comonotonicity to the multi-dimensional case. The multivariate setting is more involved (in particular because there is no immediate extension of the notion of comonotonicity) and we address it using techniques from convex duality and optimal transportation.