Sciweavers

357 search results - page 17 / 72
» Algorithms for the coalitional manipulation problem
Sort
View
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
15 years 2 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
DAGSTUHL
2007
14 years 11 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...
ICRA
2003
IEEE
122views Robotics» more  ICRA 2003»
15 years 3 months ago
Complementarity formulation for multi-fingered hand manipulation with rolling and sliding contacts
— We propose a novel complementarity model for a general three-dimensional manipulation system with rolling and sliding contacts to solve the forward dynamics problem. The key id...
Masahito Yashima, Hideya Yamaguchi
AAMAS
2011
Springer
14 years 5 months ago
Manipulation complexity and gender neutrality in stable marriage procedures
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
ATAL
2009
Springer
15 years 4 months ago
Manipulation and gender neutrality in stable marriage procedures
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...