The following pages link to Ulle Endriss (Q343900):
Displaying 46 items.
- Distributed fair allocation of indivisible goods (Q343902) (← links)
- Incentive engineering for Boolean games (Q360136) (← links)
- First-order logic formalisation of impossibility theorems in preference aggregation (Q373021) (← links)
- Graph aggregation (Q514143) (← links)
- Compactly representing utility functions using weighted goals and the Max aggregator (Q622111) (← links)
- Abstract models for dialogue protocols (Q1006459) (← links)
- Sincerity and manipulation under approval voting (Q1945667) (← links)
- The Borda class. An axiomatic study of the Borda rule on top-truncated preferences (Q1996173) (← links)
- Strategic manipulation in judgment aggregation under higher-level reasoning (Q2114570) (← links)
- Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach (Q2122769) (← links)
- Neutrality and relative acceptability in judgment aggregation (Q2217346) (← links)
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity (Q2271865) (← links)
- Optimal truth-tracking rules for the aggregation of incomplete judgments (Q2292631) (← links)
- Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks (Q2321270) (← links)
- Strategyproof judgment aggregation under partial information (Q2325667) (← links)
- ABox abduction in the description logic \(\mathcal{ALC}\) (Q2429984) (← links)
- Lifting integrity constraints in binary aggregation (Q2446586) (← links)
- (Q2851841) (← links)
- Voting on Actions with Uncertain Outcomes (Q2868552) (← links)
- Ontology merging as social choice: judgment aggregation under the open world assumption (Q2939299) (← links)
- Modelling Multilateral Negotiation in Linear Logic (Q2999164) (← links)
- Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods (Q2999165) (← links)
- Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects (Q3081450) (← links)
- Applications of Logic in Social Choice Theory (Q3092295) (← links)
- Ontology Merging as Social Choice (Q3092301) (← links)
- Complexity of Judgment Aggregation (Q3143579) (← links)
- (Q3379036) (← links)
- (Q3384062) (← links)
- Representing Utility Functions via Weighted Goals (Q3392304) (← links)
- Modal Logics of Negotiation and Preference (Q3533127) (← links)
- Iterated Majority Voting (Q3645302) (← links)
- The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments (Q3648356) (← links)
- First-Order Logic Formalisation of Arrow’s Theorem (Q3655224) (← links)
- Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps (Q4576213) (← links)
- Analysing Irresolute Multiwinner Voting Rules with Approval Ballots via SAT Solving (Q4999218) (← links)
- Introduction to Computational Social Choice (Q5133004) (← links)
- Judgment Aggregation (Q5133020) (← links)
- The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
- Aggregating Alternative Extensions of Abstract Argumentation Frameworks: Preservation Results for Quota Rules (Q5215692) (← links)
- (Q5282972) (← links)
- (Q5282983) (← links)
- (Q5283003) (← links)
- Rationalisation of Profiles of Abstract Argumentation Frameworks: Characterisation and Complexity (Q5371011) (← links)
- Logics in Artificial Intelligence (Q5394111) (← links)
- A Short Introduction to Computational Social Choice (Q5448765) (← links)
- Global Computing (Q5464837) (← links)
