Sciweavers

117 search results - page 12 / 24
» Characterization of polyhedron monotonicity
Sort
View
MSS
2008
IEEE
82views Hardware» more  MSS 2008»
14 years 9 months ago
Revealed preference and indifferent selection
It is shown that preferences can be constructed from observed choice behavior in a way that is robust to indifferent selection (i.e., the agent is indifferent between two alternat...
Eric Danan
IANDC
1998
64views more  IANDC 1998»
14 years 9 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
WINE
2009
Springer
178views Economy» more  WINE 2009»
15 years 4 months ago
The Geometry of Truthfulness
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
Angelina Vidali
SUM
2010
Springer
14 years 7 months ago
A Formal Analysis of Logic-Based Argumentation Systems
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...
Leila Amgoud, Philippe Besnard
FSTTCS
2009
Springer
15 years 4 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi