The complexity of promise problems with applications to public-key cryptography
Information and Control
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Solving concisely expressed combinatorial auction problems
Eighteenth national conference on Artificial intelligence
Logical Preference Representation and Combinatorial Vote
Annals of Mathematics and Artificial Intelligence
Compact value-function representations for qualitative preferences
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
Combinatorial Auctions
Allocation of indivisible goods: a general model and some complexity results
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
mCP nets: representing and reasoning with preferences of multiple agents
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
The computational complexity of dominance and consistency in CP-Nets
Journal of Artificial Intelligence Research
Exploiting a common property resource under a fairness constraint: a case study
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Propositional non-monotonic reasoning and inconsistency in symmetric neural networks
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Bidding languages for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Computing utility from weighted description logic preference formulas
DALT'09 Proceedings of the 7th international conference on Declarative Agent Languages and Technologies
Group intention is social choice with commitment
COIN@AAMAS'10 Proceedings of the 6th international conference on Coordination, organizations, institutions, and norms in agent systems
Applications of logic in social choice theory
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Hi-index | 0.00 |
Weighted propositional formulas can be used to model preferences over combinatorial domains: each formula represents a goal we would like to see satisfied, the weight of a formula represents the importance of the goal in question, and to assess the desirability of a given alternative we aggregate the weights of the goals satisfied by that alternative. One of several options is to aggregate by using the maximum of the weights of the satisfied goals. This approach gives rise to a family of preference representation languages, one for each of a range of possible restrictions we can impose on either formulas or weights. We analyze the properties of these languages and establish results regarding their expressivity, and absolute and relative succinctness. We also study the computational complexity of the problem of finding the best and the worst alternative for a given set of weighted goals, and of finding an alternative that is optimal for a group of agents, for a range of different notions of collective optimality proposed in social choice theory and welfare economics.