Logical Preference Representation and Combinatorial Vote

@article{Lang2004LogicalPR,
  title={Logical Preference Representation and Combinatorial Vote},
  author={J. Lang},
  journal={Annals of Mathematics and Artificial Intelligence},
  year={2004},
  volume={42},
  pages={37-71}
}
  • J. Lang
  • Published 2004
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 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-independent variables to assign. We study two key issues pertaining to combinatorial vote, namely preference representation and the automated choice of an optimal decision. For each of these issues, we briefly review the state of the art, we try to define the main problems to be solved and identify their computational… CONTINUE READING
    160 Citations

    Tables and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Vote and Aggregation in Combinatorial Domains with Structured Preferences
    • J. Lang
    • Mathematics, Computer Science
    • IJCAI
    • 2007
    • 60
    • PDF
    Voting procedures with incomplete preferences
    • 233
    • PDF
    Answer Set Programming and Combinatorial Voting
    • Rafal Grabos
    • Mathematics, Computer Science
    • Nonmonotonic Reasoning, Answer Set Programming and Constraints
    • 2005
    • 1
    • PDF
    Logical representation of preference: a brief survey
    • J. Lang
    • Computer Science
    • Decision Theory and Multi-Agent Planning
    • 2006
    • 2
    Compact preference representation and combinatorial vote
    Voting in Combinatorial Domains
    • 70
    • PDF
    Sequential composition of voting rules in multi-issue domains
    • 120
    • PDF
    Preference Handling in Combinatorial Domains: From AI to Social Choice
    • 71
    • PDF
    Choosing Combinatorial Social Choice by Heuristic Search
    • PDF

    References

    SHOWING 1-10 OF 66 REFERENCES
    Complexity of manipulating elections with few candidates
    • 121
    • PDF
    How many candidates are needed to make elections hard to manipulate?
    • 72
    • PDF
    Bidding Languages for Combinatorial Auctions
    • 235
    • PDF
    Vote elicitation: complexity and strategy-proofness
    • 141
    • PDF
    Specification and Evaluation of Preferences for Planning under Uncertainty
    • 20
    • PDF
    Propositional Distances and Preference Representation
    • 30
    Bidding and allocation in combinatorial auctions
    • 595
    • PDF
    Reasoning With Conditional Ceteris Paribus Preference Statements
    • 326
    • PDF
    Axioms of Cooperative Decision Making
    • 1,191
    • Highly Influential