1260 search results - page 73 / 252 » Bipolar Preference Problems |
SAGT
2010
Springer
13 years 8 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
ECAI
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper we introduce a new option pricing mechanism for reducing the exposure problem encountered by bidding agents with complementary valuations when participating...
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
This paper introduces a novel machine learning model called multiple instance ranking (MIRank) that enables ranking to be performed in a multiple instance learning setting. The mo...
IWPEC
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
IJON
2010
13 years 7 months ago
2010
The pairwise approach to multilabel classification reduces the problem to learning and aggregating preference predictions among the possible labels. A key problem is the need to qu...