41 search results - page 6 / 9 » Compact Preference Representation in Stable Marriage Problem... |
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
Abstract— The sparsification of the reluctance matrix L−1 (where L denotes the usual inductance matrix L) has been widely used in several recent investigations to make the pro...
JAIR
2008
14 years 9 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
98
Voted
CLIMA
2010
14 years 9 months ago
2010
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...