190 results on '"Eric Rémila"'
Search Results
2. Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution.
3. Lexicographic solutions for coalitional rankings.
4. Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations.
5. influence: A partizan scoring game on graphs.
6. Cooperative games on intersection closed systems and the Shapley value.
7. Harsanyi power solutions for cooperative games on voting structures.
8. Axiomatization of an allocation rule for ordered tree TU-games.
9. Computational Complexity of the Avalanche Problem for One Dimensional Decreasing Sandpiles.
10. The proportional Shapley value and applications.
11. Lost in self-stabilization: A local process that aligns connected cells.
12. INFLUENCE: a partizan scoring game on graphs.
13. Compact Distributed Certification of Planar Graphs.
14. Local Certification of Graphs with Bounded Genus.
15. The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model.
16. Discounted tree solutions.
17. A strategic implementation of the sequential equal surplus division rule for digraph cooperative games.
18. Emergence on Decreasing Sandpile Models.
19. Lost in Self-Stabilization.
20. Axiomatic characterizations under players nullification.
21. Characterizations of Three Linear Values for TU Games by Associated Consistency: Simple Proofs Using the Jordan Normal Form.
22. Emergence of Wave Patterns on Kadanoff Sandpiles.
23. Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles.
24. An Optimal Bound to Access the Core in TU-Games.
25. Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast.
26. Avalanche Structure in the Kadanoff Sand Pile Model.
27. Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence.
28. The Optimal Strategy for the Average Long-Lived Consensus.
29. Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles.
30. Average Long-Lived Memoryless Consensus: The Three-Value Case.
31. A decomposition of the space of TU-games using addition and transfer invariance.
32. Preserving or removing special players: What keeps your payoff unchanged in TU-games?
33. A geometric examination of majorities based on difference in support.
34. Piles de sable décroissantes 1D. Classification expérimentale d'émergences.
35. Axioms of invariance for TU-games.
36. Distances on Lozenge Tilings.
37. Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory.
38. Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes.
39. A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane.
40. Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time.
41. Incremental and Transitive Discrete Rotations.
42. Lexicographic solutions for coalitional rankings based on individual and collective performances
43. Characterization of Bijective Discretized Rotations.
44. Tiling a Polygon with Two Kinds of Rectangles.
45. On Colorations Induced by Discrete Rotations.
46. Hyperbolic Recognition by Graph Automata.
47. Tiling groups for Wang tiles.
48. Accessibility and stability of the coalition structure core.
49. An optimal bound to access the core in TU-games.
50. Kadanoff sand pile model. Avalanche structure and wave shape.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.