Filtrer vos résultats
- 75
- 44
- 44
- 42
- 16
- 16
- 1
- 15
- 1
- 68
- 51
- 12
- 5
- 2
- 1
- 1
- 3
- 1
- 2
- 3
- 4
- 4
- 7
- 10
- 20
- 10
- 6
- 8
- 7
- 6
- 1
- 4
- 2
- 2
- 3
- 4
- 3
- 3
- 3
- 1
- 2
- 117
- 2
- 84
- 56
- 55
- 8
- 5
- 5
- 5
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 119
- 69
- 65
- 9
- 9
- 8
- 7
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
119 résultats
|
|
Tiling with Trichromatic Colored-Edges TrianglesTheoretical Computer Science, 2004, 319 (1-3), pp.59-70. ⟨10.1016/j.tcs.2004.02.021⟩
Article dans une revue
lirmm-00108587v1
|
||
|
|
On the number of blocks required to access the coreDiscrete Applied Mathematics, 2012, 160 (7-8), pp.925-932. ⟨10.1016/j.dam.2011.12.022⟩
Article dans une revue
halshs-00662489v1
|
||
|
|
Distances on rhombus tilingsTheoretical Computer Science, 2011, 412 (36), pp.4787-- 4794. ⟨10.1016/j.tcs.2011.04.015⟩
Article dans une revue
hal-01146174v1
|
||
Solidarity within a Fixed CommunityEconomics Letters, 2014, 125 (3), pp. 440-443. ⟨10.1016/j.econlet.2014.10.023⟩
Article dans une revue
halshs-01090487v1
|
|||
An Optimal Bound to Access the Core in TU-GamesSAGT 2012, Oct 2012, Barcelone, Spain. pp.49-60
Communication dans un congrès
halshs-00756559v1
|
|||
|
|
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal TimeFSTTCS, 2006, Kolkota, India. pp.45-56, ⟨10.1007/11944836_7⟩
Communication dans un congrès
hal-00460570v1
|
||
|
|
Characterization of Bijective Discretized Rotations[Research Report] LIP RR-2004-40, Laboratoire de l'informatique du parallélisme. 2004, 2+9p
Rapport
hal-02101990v1
|
||
|
|
A Geometric Examination of Majorities Based on Difference in SupportSocial Choice and Welfare, 2015, 45 (1), pp 123-153. ⟨10.1007/s00355-015-0870-y⟩
Article dans une revue
halshs-01107698v1
|
||
|
|
Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value2014
Pré-publication, Document de travail
hal-01377929v1
|
||
|
|
influence: a partizan scoring game on graphsTheoretical Computer Science, 2021, 878-879, pp.26-46. ⟨10.1016/j.tcs.2021.05.028⟩
Article dans une revue
hal-03064908v1
|
||
Harsanyi power solutions for cooperative games on voting structures38th Linz seminar on Fuzzy Set Theory, Set Functions in Games and Decision, Feb 2019, Linz, Austria
Communication dans un congrès
halshs-02409438v1
|
|||
|
|
Lost in self-stabilization: A local process that aligns connected cellsTheoretical Computer Science, 2018, 736 (6), pp.41--61. ⟨10.1016/j.tcs.2018.02.015⟩
Article dans une revue
hal-01718145v1
|
||
|
|
Small An optimal algorithm to generate tilings.[Research Report] LIP RR-2003-04, Laboratoire de l'informatique du parallélisme. 2003, 2+12p
Rapport
hal-02101935v1
|
||
|
|
On the structure of some spaces of tilings.[Research Report] LIP RR-2000-15, Laboratoire de l'informatique du parallélisme. 2000, 2+23p
Rapport
hal-02101946v1
|
||
|
|
Piles de sable décroissantes 1D : classification expérimentale d'émergencesRevue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 2015
Article dans une revue
hal-01738027v1
|
||
Brief Announcement: A Hierarchy of Congested Clique Models: From Broadcast to UnicastACM Symposium on Principles of Distributed Computing (PODC), Jun 2015, Donostia-San Sebastián, Spain
Communication dans un congrès
halshs-01196558v1
|
|||
An optimal bound to access the core in TU-gamesFourth International workshop " Models of Influence and Network Theory (MINT) ", Apr 2013, Amsterdam, Netherlands
Communication dans un congrès
halshs-00945315v1
|
|||
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form2nd Workshop on Cooperative Game Theory in Business Practice, Jun 2015, Leipzig, Germany
Communication dans un congrès
halshs-01196553v1
|
|||
Characterization of the Average Tree solution and its kernel27th European conference on Operational Research, Jul 2015, Glasgow, United Kingdom
Communication dans un congrès
halshs-01212115v1
|
|||
Accessibility and stability of the coalition structure coreMathematical Methods of Operations Research, 2013, 78 (2), pp.187-202
Article dans une revue
halshs-00817008v1
|
|||
|
|
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games2015
Pré-publication, Document de travail
hal-01376910v1
|
||
|
|
An optimal bound to access the core in TU-gamesGames and Economic Behavior, 2013, 80, pp.1-9. ⟨10.1016/j.geb.2013.02.008⟩
Article dans une revue
halshs-00795480v1
|
||
|
|
Discounted Tree Solutions2015
Pré-publication, Document de travail
hal-01377923v1
|
||
Emergence on decreasing sandpile modelsProceedings of MFCS'2015, 2015, Unknown, Unknown Region. pp.419--431
Communication dans un congrès
hal-01459879v1
|
|||
|
|
Axiomatic characterizations under players nullification2016
Pré-publication, Document de travail
hal-01376911v1
|
||
Rooted-tree Solutions for Tree GamesEuropean Journal of Operational Research, 2010, 203, pp.404-408
Article dans une revue
halshs-00530595v1
|
|||
Compensations in the Shapley Value and the Compensation Solutions for Graph GamesEuropean Conference on Complex Systems (ECCS), Sep 2010, Lisbonne, Portugal
Communication dans un congrès
halshs-00530607v1
|
|||
|
|
Incremental and Transitive Discrete Rotations2006
Pré-publication, Document de travail
hal-00016037v2
|
||
|
|
Preserving or removing special players: What keeps your payoff unchanged in TU-games?Mathematical Social Sciences, 2015, 73, pp. 23-31. ⟨10.1016/j.mathsocsci.2014.11.003⟩
Article dans une revue
halshs-01090493v1
|
||
|
|
Characterization of the Average Tree solution and its kernelJournal of Mathematical Economics, 2015, 60, pp. 159-165. ⟨10.1016/j.jmateco.2015.07.001⟩
Article dans une revue
halshs-01196615v1
|