Page 1

Displaying 1 – 6 of 6

Showing per page

Equivalences and Congruences on Infinite Conway Games∗

Furio Honsell, Marina Lenisa, Rekha Redamalla (2012)

RAIRO - Theoretical Informatics and Applications

Taking the view that infinite plays are draws, we study Conway non-terminating games and non-losing strategies. These admit a sharp coalgebraic presentation, where non-terminating games are seen as a final coalgebra and game contructors, such as disjunctive sum, as final morphisms. We have shown, in a previous paper, that Conway’s theory of terminating games can be rephrased naturally in terms of game (pre)congruences. Namely, various...

Equivalences and Congruences on Infinite Conway Games∗

Furio Honsell, Marina Lenisa, Rekha Redamalla (2012)

RAIRO - Theoretical Informatics and Applications

Taking the view that infinite plays are draws, we study Conway non-terminating games and non-losing strategies. These admit a sharp coalgebraic presentation, where non-terminating games are seen as a final coalgebra and game contructors, such as disjunctive sum, as final morphisms. We have shown, in a previous paper, that Conway’s theory of terminating games can be rephrased naturally in terms of game (pre)congruences. Namely, various...

Estimating the supply chain efficiency loss when the seller has to estimate the buyer’s willingness to pay

Xavier Brusset (2014)

RAIRO - Operations Research - Recherche Opérationnelle

We study the pricing problem between two firms when the manufacturer’s willingness to pay (wtp) for the supplier’s good is not known by the latter. We demonstrate that it is in the interest of the manufacturer to hide this information from the supplier. The precision of the information available to the supplier modifies the rent distribution. The risk of opportunistic behaviour entails a loss of efficiency in the supply chain. The model is extended to the case of a supplier submitting offers to...

Currently displaying 1 – 6 of 6

Page 1