Sciweavers

11160 search results - page 206 / 2232
» Incompleteness in a General Setting
Sort
View
192
Voted
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 8 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
SIGECOM
2011
ACM
256views ECommerce» more  SIGECOM 2011»
14 years 7 months ago
Competitive equilibrium in two sided matching markets with general utility functions
In this paper, we study the class of competitive equilibria in two sided matching markets with general (non-quasilinear) utility functions. Mechanism design in general non-quasili...
Saeed Alaei, Kamal Jain, Azarakhsh Malekian
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
15 years 4 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
INFOCOM
2011
IEEE
14 years 7 months ago
General capacity scaling of wireless networks
—We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions ...
Cheng Wang, Changjun Jiang, Xiang-Yang Li, ShaoJie...
MMMACNS
2005
Springer
15 years 10 months ago
Networks, Markov Lie Monoids, and Generalized Entropy
The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the ...
Joseph E. Johnson