The following pages link to Jérôme Lang (Q201918):
Displaying 50 items.
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- Incentive engineering for Boolean games (Q360136) (← links)
- Effectivity functions and efficient coalitions in Boolean games (Q383078) (← links)
- New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
- Editorial introduction to the special issue LORI Guangzhou (Q484916) (← links)
- Belief extrapolation (or how to reason about observations and unpredicted change) (Q543623) (← links)
- Logical preference representation and combinatorial vote (Q702101) (← links)
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning (Q813424) (← links)
- \(\text{DA}^2\) merging operators (Q814605) (← links)
- Dependencies between players in Boolean games (Q962907) (← links)
- Reasoning under inconsistency: a forgetting-based approach (Q991019) (← links)
- Introspective forgetting (Q1036061) (← links)
- Sequential composition of voting rules in multi-issue domains (Q1042318) (← links)
- From ordering-based nonmonotonic reasoning to conditional logics (Q1327168) (← links)
- The communication burden of single transferable vote, in practice (Q1617674) (← links)
- Group activity selection problem with approval preferences (Q1621725) (← links)
- Multi-attribute proportional representation (Q1731837) (← links)
- Conditional independence in propositional logic. (Q1852858) (← links)
- Propositional distances and compact preference representation (Q1885764) (← links)
- Towards qualitative approaches to multi-stage decision making (Q1961307) (← links)
- On simplified group activity selection (Q1990308) (← links)
- Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
- Efficient reallocation under additive and responsive preferences (Q2272381) (← links)
- Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
- Condorcet winning sets (Q2341123) (← links)
- On propositional definability (Q2389643) (← links)
- A partial taxonomy of judgment aggregation rules and their properties (Q2397659) (← links)
- Fuzzy sets in approximate reasoning. II: Logical approaches (Q2641292) (← links)
- Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
- (Q2752126) (← links)
- Conference paper assignment (Q2762280) (← links)
- New Results on Equilibria in Strategic Candidacy (Q2856128) (← links)
- Possible Winners in Approval Voting (Q2868547) (← links)
- Judgment Aggregation Rules and Voting Rules (Q2868557) (← links)
- Propositional Update Operators Based on Formula/Literal Dependence (Q2946712) (← links)
- Learning conditionally lexicographic preference relations (Q2999146) (← links)
- Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods (Q2999165) (← links)
- Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets (Q3061124) (← links)
- (Q3138705) (← links)
- (Q3379036) (← links)
- Representing Utility Functions via Weighted Goals (Q3392304) (← links)
- Algorithmic Decision Theory Meets Logic (Q3449186) (← links)
- (Q3455569) (← links)
- Possible and Necessary Winners of Partial Tournaments (Q3460381) (← links)
- Dependencies Between Players in Boolean Games (Q3524987) (← links)
- Voting in Combinatorial Domains: What Logic and AI Have to Say (Q3532453) (← links)
- When are elections with few candidates hard to manipulate? (Q3546334) (← links)
- Preference Change Triggered by Belief Change: A Principled Approach (Q3584871) (← links)
- (Q3624140) (← links)
- (Q3989935) (← links)
