Eric Rémila - Academia.edu (original) (raw)
Papers by Eric Rémila
We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a ... more We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a polygon F as input, produces a tiling of F with translated copies of our rectangles (or indicates that there is no tiling). Moreover, we prove that any pair of tilings can be linked by a sequence of local transformations of tilings, called flips.
For any transferable utility game in coalitional form with a nonempty core, we show that that the... more For any transferable utility game in coalitional form with a nonempty core, we show that that the number of blocks required to switch from an imputation out of the core to an imputation in the core is at most n-1, where n is the number of players. This bound exploits the geometry of the core and is optimal. It considerably
We introduce the sequential equal surplus division for sharing the total welfare resulting form t... more We introduce the sequential equal surplus division for sharing the total welfare resulting form the cooperation of agents along a river with a delta. This allocation rule can be seen as a generalization of the contribution vectors introduced by Ju, Borm and Ruys (2007) in the context of TU-games. We provide two axiomatic characterizations of the sequential equal surplus division.
In this article we study cooperative multi-choice games with limited cooperation possibilities, r... more In this article we study cooperative multi-choice games with limited cooperation possibilities, represented by an undirected forest on the player set. Players in the game can cooperate if they are connected in the forest. We introduce a new (single-valued) solution concept which is a generalization of the average tree solution defined and characterized by Herings et al. [2008] for TU-games
We present the axiom of weighted component fairness for the class of forest games, a generalizati... more We present the axiom of weighted component fairness for the class of forest games, a generalization of component fairness introduced by Herings, Talman and van der Laan (2008) in order to characterize the average tree solution. Given a system of weights, component eciency and weighted component fairness yield a unique allocation rule. We provide an analysis of the set of
It is known that any two domino tilings of a polygon are flip-accessible, i.e., linked by a finit... more It is known that any two domino tilings of a polygon are flip-accessible, i.e., linked by a finite sequence of local transformations, called flips. This paper considers flip-accessibility for domino tilings of the whole plane, asking whether two of them are linked by a possibly infinite sequence of flips. The answer turning out to depend on tilings, we provide three
Lecture Notes in Computer Science, 2008
Lecture Notes in Computer Science, 1998
we give a linear time algorithm which, given a simply connected figure of the plane divided into ... more we give a linear time algorithm which, given a simply connected figure of the plane divided into cells, whose boundary is crossed by some colored inputs and outputs, produces non-intersecting directed flow lines which match inputs and outputs according to the colors, in such a way that each edge of any cell is crossed by at most one line. The
Lecture Notes in Computer Science, 2006
Lecture Notes in Computer Science, 2011
Lecture Notes in Computer Science, 2011
Proceedings of 37th Conference on Foundations of Computer Science, 1996
Imagine that in order to build a piece of furniture, you need n rectangular pieces of wood. The w... more Imagine that in order to build a piece of furniture, you need n rectangular pieces of wood. The wood store has a long an narrow piece of wood, and will cut you a strip, out of which you must cut out your n rectangles. The price is proportional to the length of the strip which you buy, ...
Lecture Notes in Computer Science, 2009
This article shows that, for any transferable utility game in coalitional form with nonempty coal... more This article shows that, for any transferable utility game in coalitional form with nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than or equal to (n*n+4n)/4, where n is the cardinality of the player set. This number considerably improves the upper bound found so far by Koczy and Lauwers (2004).
Theoretical Computer Science, 2005
Theoretical Computer Science, 2010
Theoretical Computer Science, 2011
Theoretical Computer Science, 2003
We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a ... more We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a polygon F as input, produces a tiling of F with translated copies of our rectangles (or indicates that there is no tiling). Moreover, we prove that any pair of tilings can be linked by a sequence of local transformations of tilings, called flips.
For any transferable utility game in coalitional form with a nonempty core, we show that that the... more For any transferable utility game in coalitional form with a nonempty core, we show that that the number of blocks required to switch from an imputation out of the core to an imputation in the core is at most n-1, where n is the number of players. This bound exploits the geometry of the core and is optimal. It considerably
We introduce the sequential equal surplus division for sharing the total welfare resulting form t... more We introduce the sequential equal surplus division for sharing the total welfare resulting form the cooperation of agents along a river with a delta. This allocation rule can be seen as a generalization of the contribution vectors introduced by Ju, Borm and Ruys (2007) in the context of TU-games. We provide two axiomatic characterizations of the sequential equal surplus division.
In this article we study cooperative multi-choice games with limited cooperation possibilities, r... more In this article we study cooperative multi-choice games with limited cooperation possibilities, represented by an undirected forest on the player set. Players in the game can cooperate if they are connected in the forest. We introduce a new (single-valued) solution concept which is a generalization of the average tree solution defined and characterized by Herings et al. [2008] for TU-games
We present the axiom of weighted component fairness for the class of forest games, a generalizati... more We present the axiom of weighted component fairness for the class of forest games, a generalization of component fairness introduced by Herings, Talman and van der Laan (2008) in order to characterize the average tree solution. Given a system of weights, component eciency and weighted component fairness yield a unique allocation rule. We provide an analysis of the set of
It is known that any two domino tilings of a polygon are flip-accessible, i.e., linked by a finit... more It is known that any two domino tilings of a polygon are flip-accessible, i.e., linked by a finite sequence of local transformations, called flips. This paper considers flip-accessibility for domino tilings of the whole plane, asking whether two of them are linked by a possibly infinite sequence of flips. The answer turning out to depend on tilings, we provide three
Lecture Notes in Computer Science, 2008
Lecture Notes in Computer Science, 1998
we give a linear time algorithm which, given a simply connected figure of the plane divided into ... more we give a linear time algorithm which, given a simply connected figure of the plane divided into cells, whose boundary is crossed by some colored inputs and outputs, produces non-intersecting directed flow lines which match inputs and outputs according to the colors, in such a way that each edge of any cell is crossed by at most one line. The
Lecture Notes in Computer Science, 2006
Lecture Notes in Computer Science, 2011
Lecture Notes in Computer Science, 2011
Proceedings of 37th Conference on Foundations of Computer Science, 1996
Imagine that in order to build a piece of furniture, you need n rectangular pieces of wood. The w... more Imagine that in order to build a piece of furniture, you need n rectangular pieces of wood. The wood store has a long an narrow piece of wood, and will cut you a strip, out of which you must cut out your n rectangles. The price is proportional to the length of the strip which you buy, ...
Lecture Notes in Computer Science, 2009
This article shows that, for any transferable utility game in coalitional form with nonempty coal... more This article shows that, for any transferable utility game in coalitional form with nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than or equal to (n*n+4n)/4, where n is the cardinality of the player set. This number considerably improves the upper bound found so far by Koczy and Lauwers (2004).
Theoretical Computer Science, 2005
Theoretical Computer Science, 2010
Theoretical Computer Science, 2011
Theoretical Computer Science, 2003