Sciweavers

1662 search results - page 187 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
AMAI
2004
Springer
13 years 8 months ago
Logical Preference Representation and Combinatorial Vote
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
Jérôme Lang
HICSS
2007
IEEE
141views Biometrics» more  HICSS 2007»
14 years 3 months ago
Second-Best Combinatorial Auctions - The Case of the Pricing-Per-Column Mechanism
One of the main contributions of classical mechanism design is the derivation of the Groves mechanisms. The class of Groves mechanisms are the only mechanisms that are strategy-pr...
Dirk Neumann, Björn Schnizler, Ilka Weber, Ch...
MFCS
2009
Springer
14 years 1 months ago
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
Nadja Betzler, Britta Dorn
BIOCOMP
2008
13 years 10 months ago
Bioinformatics Tools: Searching for Markers in DNA/RNA Sequences
Research in bioinformatics and computational biology relies heavily on algorithms that facilitate the understanding of biological processes through the application of statistical ...
Kuha Mahalingam, Omar Bagasra
AAAI
2006
13 years 10 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen