Reference : Agents in the shadow (cooperative games with non-cooperating players) |

Scientific congresses, symposiums and conference proceedings : Unpublished conference | |||

Physical, chemical, mathematical & earth Sciences : Mathematics | |||

http://hdl.handle.net/10993/9676 | |||

Agents in the shadow (cooperative games with non-cooperating players) | |

English | |

Waldhauser, Tamás [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit] | |

Couceiro, Miguel [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >] | |

Marichal, Jean-Luc [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >] | |

19-Jul-2011 | |

No | |

No | |

International | |

7th Meeting on Game Theory (SING 7) | |

from 18-07-2011 to 20-07-2011 | |

Michel Grabisch (Paris School of Economics, University of Paris 1) | |

Paris | |

France | |

[en] cooperative games ; non-cooperative games ; alpha- and beta -effectivity ; simple games ; strictly determined games | |

[en] The aim of this talk is to report on recent investigations about lattice derivatives of Boolean and pseudo-Boolean functions and their interpretations in game theory. The partial lattice derivatives of a (pseudo-) Boolean function are analogues of the classical partial derivatives, with the difference operation replaced by the minimum or the maximum operation. We focus on commutation properties of these lattice differential operators and relate them to local monotonicity properties. The least and greatest functions that can be obtained from a given function f, by forming lattice derivatives with respect to all variables, are called the lower and the upper shadows of f, respectively. It turns out that the lower and upper shadows of f coincide with the alpha- and beta-effectivity functions of the cooperative game corresponding to f. Thus a function f has a unique shadow if and only if the two effectivity functions coincide, which is equivalent to the fact that certain two-player zero-sum games associated with (the cooperative game corresponding to) f are strictly determined. We formulate a conjecture about Boolean functions (i.e., simple games) with a unique shadow, and present proofs in some special cases as well as results of computer experiments that support our conjecture. | |

University of Luxembourg - UL | |

Researchers ; Professionals ; Students | |

http://hdl.handle.net/10993/9676 | |

http://ces.univ-paris1.fr/SING_7.htm |

File(s) associated to this reference | ||||||||||||||||||||||

| ||||||||||||||||||||||

All documents in ORBi^{lu} are protected by a user license.