default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlle Endriss
Ulrich Endriss
Person information
- affiliation: University of Amsterdam, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j36]Simon Rey, Ulle Endriss:
Epistemic selection of costly alternatives: the case of participatory budgeting. Auton. Agents Multi Agent Syst. 39(1): 1 (2025)- 2024
- [j35]Zoi Terzopoulou
, Panagiotis Terzopoulos, Ulle Endriss:
Iterative voting with partial preferences. Artif. Intell. 332: 104133 (2024) - [c112]Michael A. Müller, Blaz Istenic Urh, Teodor-Stefan Zotescu, Ulle Endriss:
Breaking the Cycle. Preference-Based Aggregation for Cyclic Argumentation Frameworks. COMMA 2024: 157-168 - [c111]Marie Christin Schmidtlein, Ulle Endriss:
Voting by Axioms (Extended Abstract). IJCAI 2024: 8455-8459 - [e8]Ulle Endriss, Francisco S. Melo, Kerstin Bach, Alberto José Bugarín Diz, Jose Maria Alonso-Moral, Senén Barro, Fredrik Heintz:
ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain - Including 13th Conference on Prestigious Applications of Intelligent Systems (PAIS 2024). Frontiers in Artificial Intelligence and Applications 392, IOS Press 2024, ISBN 978-1-64368-548-9 [contents] - [i15]Davide Grossi, Ulrike Hahn, Michael Mäs, Andreas Nitsche, Jan Behrens, Niclas Boehmer, Markus Brill, Ulle Endriss, Umberto Grandi, Adrian Haret, Jobst Heitzig, Nicolien Janssens, Catholijn M. Jonker, Marijn A. Keijzer, Axel Kistner, Martin Lackner, Alexandra Lieben, Anna Mikhaylovskaya, Pradeep K. Murukannaiah, Carlo Proietti, Manon Revel, Élise Rouméas, Ehud Shapiro, Gogulapati Sreedurga, Björn Swierczek, Nimrod Talmon, Paolo Turrini, Zoi Terzopoulou, Frederik Van De Putte:
Enabling the Digital Democratic Revival: A Research Program for Digital Democracy. CoRR abs/2401.16863 (2024) - [i14]Federico Fioravanti, Ulle Endriss:
Voting with Partial Orders: The Plurality and Anti-Plurality Classes. CoRR abs/2404.17413 (2024) - [i13]Julian Chingoma, Ulle Endriss, Ronald de Haan, Adrian Haret, Jan Maly:
Apportionment with Weighted Seats. CoRR abs/2405.18102 (2024) - 2023
- [c110]Jan Maly, Simon Rey, Ulle Endriss, Martin Lackner:
Fairness in Participatory Budgeting via Equality of Resources. AAMAS 2023: 2031-2039 - [c109]Marie Christin Schmidtlein, Ulle Endriss:
Voting by Axioms. AAMAS 2023: 2067-2075 - [i12]Simon Rey, Ulle Endriss:
Epistemic Selection of Costly Alternatives: The Case of Participatory Budgeting. CoRR abs/2304.10940 (2023) - 2022
- [j34]Sebastian Schneckenburger, Britta Dorn, Ulle Endriss:
Minimising inequality in multiagent resource allocation. Ann. Math. Artif. Intell. 90(4): 339-371 (2022) - [c108]Arthur Boixel, Ulle Endriss, Ronald de Haan:
A Calculus for Computing Structured Justifications for Election Outcomes. AAAI 2022: 4859-4866 - [c107]Julian Chingoma, Ulle Endriss, Ronald de Haan:
Simulating Multiwinner Voting Rules in Judgment Aggregation. AAMAS 2022: 263-271 - [c106]Oliviero Nardi, Arthur Boixel, Ulle Endriss:
A Graph-Based Algorithm for the Automated Justification of Collective Decisions. AAMAS 2022: 935-943 - [c105]Nima Motamed, Arie Soeteman, Simon Rey, Ulle Endriss:
Participatory Budgeting with Multiple Resources. EUMAS 2022: 330-347 - [c104]Ulle Endriss, Arianna Novaro, Zoi Terzopoulou:
Representation Matters: Characterisation and Impossibility Results for Interval Aggregation. IJCAI 2022: 286-292 - [c103]Arthur Boixel, Ulle Endriss, Oliviero Nardi:
Displaying Justifications for Collective Decisions. IJCAI 2022: 5892-5895 - [i11]Jan Maly, Simon Rey, Ulle Endriss, Martin Lackner:
Effort-Based Fairness for Participatory Budgeting. CoRR abs/2205.07517 (2022) - 2021
- [j33]Ulle Endriss, Ann Nowé, Maria L. Gini, Victor R. Lesser, Michael Luck, Ana Paiva, Jaime Simão Sichman:
Autonomous agents and multiagent systems: perspectives on 20 years of AAMAS. AI Matters 7(3): 29-37 (2021) - [c102]Sirin Botan, Ulle Endriss:
Preserving Condorcet Winners under Strategic Manipulation. AAAI 2021: 5202-5210 - [c101]Simon Rey, Ulle Endriss, Ronald de Haan:
Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting. IJCAI 2021: 370-376 - [e7]Frank Dignum, Alessio Lomuscio, Ulle Endriss, Ann Nowé:
AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021. ACM 2021, ISBN 978-1-4503-8307-3 [contents] - 2020
- [j32]Ulle Endriss, Ronald de Haan, Jérôme Lang, Marija Slavkovik:
The Complexity Landscape of Outcome Determination in Judgment Aggregation. J. Artif. Intell. Res. 69: 687-731 (2020) - [j31]Zoi Terzopoulou, Ulle Endriss:
Neutrality and relative acceptability in judgment aggregation. Soc. Choice Welf. 55(1): 25-49 (2020) - [c100]Ulle Endriss:
Analysis of One-to-One Matching Mechanisms via SAT Solving: Impossibilities for Universal Axioms. AAAI 2020: 1918-1925 - [c99]Ulle Endriss:
Collective Information. AAAI 2020: 13520-13524 - [c98]Arthur Boixel, Ulle Endriss:
Automated Justification of Collective Decisions via Constraint Solving. AAMAS 2020: 168-176 - [c97]Sirin Botan, Ulle Endriss:
Majority-Strategyproofness in Judgment Aggregation. AAMAS 2020: 186-194 - [c96]Boas Kluiving, Adriaan de Vries, Pepijn Vrijbergen, Arthur Boixel, Ulle Endriss:
Analysing Irresolute Multiwinner Voting Rules with Approval Ballots via SAT Solving. ECAI 2020: 131-138 - [c95]Simon Rey, Ulle Endriss, Ronald de Haan:
Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation. KR 2020: 692-702 - [i10]Simon Rey, Ulle Endriss, Ronald de Haan:
Shortlisting Rules and Incentives in an End-to-End Model for Participatory Budgeting. CoRR abs/2010.10309 (2020)
2010 – 2019
- 2019
- [j30]Weiwei Chen, Ulle Endriss:
Preservation of semantic properties in collective argumentation: The case of aggregating abstract argumentation frameworks. Artif. Intell. 269: 27-48 (2019) - [j29]Zoi Terzopoulou, Ulle Endriss:
Strategyproof judgment aggregation under partial information. Soc. Choice Welf. 53(3): 415-442 (2019) - [c94]Zoi Terzopoulou, Ulle Endriss:
Rethinking the Neutrality Axiom in Judgment Aggregation. AAMAS 2019: 2212-2214 - [c93]Zoi Terzopoulou, Ulle Endriss:
Aggregating Incomplete Pairwise Preferences by Weight. IJCAI 2019: 595-601 - [c92]Zoi Terzopoulou, Ulle Endriss:
Optimal Truth-Tracking Rules for the Aggregation of Incomplete Judgments. SAGT 2019: 298-311 - 2018
- [c91]Janosch Döcker, Britta Dorn, Ulle Endriss, Ronald de Haan, Sebastian Schneckenburger:
Tool Auctions. AAAI 2018: 1015-1022 - [c90]Zoi Terzopoulou, Ulle Endriss:
Modelling Iterative Judgment Aggregation. AAAI 2018: 1234-1241 - [c89]Ulle Endriss:
Judgment Aggregation with Rationality and Feasibility Constraints. AAMAS 2018: 946-954 - [c88]Weiwei Chen, Ulle Endriss:
Aggregating Alternative Extensions of Abstract Argumentation Frameworks: Preservation Results for Quota Rules. COMMA 2018: 425-436 - [c87]Ulle Endriss, Umberto Grandi:
Graph Aggregation. WWW (Companion Volume) 2018: 447-450 - [i9]Ulle Endriss:
Lecture Notes on Fair Division. CoRR abs/1806.04234 (2018) - 2017
- [j28]Yann Chevaleyre, Ulle Endriss, Nicolas Maudet:
Distributed fair allocation of indivisible goods. Artif. Intell. 242: 1-22 (2017) - [j27]Ulle Endriss, Umberto Grandi:
Graph aggregation. Artif. Intell. 245: 86-114 (2017) - [j26]Stéphane Airiau, Elise Bonzon, Ulle Endriss, Nicolas Maudet, Julien Rossit:
Rationalisation of Profiles of Abstract Argumentation Frameworks: Characterisation and Complexity. J. Artif. Intell. Res. 60: 149-177 (2017) - [c86]Sebastian Schneckenburger, Britta Dorn, Ulle Endriss:
The Atkinson Inequality Index in Multiagent Resource Allocation. AAMAS 2017: 272-280 - [c85]Stéphane Airiau, Elise Bonzon, Ulle Endriss, Nicolas Maudet, Julien Rossit:
Rationalisation of Profiles of Abstract Argumentation Frameworks: Extended Abstract. IJCAI 2017: 4776-4780 - [c84]Weiwei Chen, Ulle Endriss:
Preservation of Semantic Properties during the Aggregation of Abstract Argumentation Frameworks. TARK 2017: 118-133 - 2016
- [j25]Giovanni Ciná, Ulle Endriss:
Proving classical theorems of social choice theory in modal logic. Auton. Agents Multi Agent Syst. 30(5): 963-989 (2016) - [c83]Marco Costantini, Carla Groenland, Ulle Endriss:
Judgment Aggregation under Issue Dependencies. AAAI 2016: 468-474 - [c82]Olivier Cailloux, Ulle Endriss:
Arguing about Voting Rules. AAMAS 2016: 287-295 - [c81]Stéphane Airiau, Elise Bonzon, Ulle Endriss, Nicolas Maudet, Julien Rossit:
Rationalisation of Profiles of Abstract Argumentation Frameworks. AAMAS 2016: 350-357 - [c80]Sirin Botan, Arianna Novaro, Ulle Endriss:
Group Manipulation in Judgment Aggregation. AAMAS 2016: 411-419 - [c79]Janosch Döcker, Britta Dorn, Ulle Endriss, Dominikus Krüger:
Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps. ECAI 2016: 802-809 - [c78]Markus Brill, Edith Elkind, Ulle Endriss, Umberto Grandi:
Pairwise Diffusion of Preference Rankings in Social Networks. IJCAI 2016: 130-136 - [c77]Ulle Endriss, Svetlana Obraztsova, Maria Polukarov, Jeffrey S. Rosenschein:
Strategic Voting with Incomplete Information. IJCAI 2016: 236-242 - [c76]Ulle Endriss, Umberto Grandi, Ronald de Haan, Jérôme Lang:
Succinctness of Languages for Judgment Aggregation. KR 2016: 176-186 - [e6]Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia:
Handbook of Computational Social Choice. Cambridge University Press 2016, ISBN 9781107446984 [contents] - [r2]Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia:
Introduction to Computational Social Choice. Handbook of Computational Social Choice 2016: 1-20 - [r1]Ulle Endriss:
Judgment Aggregation. Handbook of Computational Social Choice 2016: 399-426 - [i8]Ulle Endriss, Umberto Grandi:
Graph Aggregation. CoRR abs/1609.03765 (2016) - 2015
- [c75]Ulle Endriss, Ronald de Haan:
Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young. AAMAS 2015: 117-125 - [c74]Ulle Endriss, Ronald de Haan, Stefan Szeider:
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. AAMAS 2015: 127-136 - [c73]Giovanni Ciná, Ulle Endriss:
A Syntactic Proof of Arrow's Theorem in a Modal Logic of Social Choice Functions. AAMAS 2015: 1009-1017 - 2014
- [j24]Stéphane Airiau, Ulle Endriss:
Multiagent resource allocation with sharable items. Auton. Agents Multi Agent Syst. 28(6): 956-985 (2014) - [j23]Daniele Porello, Ulle Endriss:
Ontology merging as social choice: judgment aggregation under the open world assumption. J. Log. Comput. 24(6): 1229-1249 (2014) - [c72]Ulle Endriss, Umberto Grandi:
Binary Aggregation by Selection of the Most Representative Voters. AAAI 2014: 668-674 - [c71]Justin Kruger, Ulle Endriss, Raquel Fernández, Ciyang Qing:
Axiomatic analysis of aggregation methods for collective annotation. AAMAS 2014: 1185-1192 - [c70]Ciyang Qing, Ulle Endriss, Raquel Fernández, Justin Kruger:
Empirical Analysis of Aggregation Methods for Collective Annotation. COLING 2014: 1533-1542 - [c69]Olivier Cailloux, Ulle Endriss:
Eliciting a Suitable Voting Rule via Examples. ECAI 2014: 183-188 - [c68]Ulle Endriss, Umberto Grandi:
Collective Rationality in Graph Aggregation. ECAI 2014: 291-296 - [c67]Vahid Hashemi, Ulle Endriss:
Measuring Diversity of Preferences in a Group. ECAI 2014: 423-428 - [c66]Ulle Endriss:
Social Choice Theory as a Foundation for Multiagent Systems. MATES 2014: 1-6 - [e5]Ulle Endriss, João Leite:
STAIRS 2014 - Proceedings of the 7th European Starting AI Researcher Symposium, Prague, Czech Republic, August 18-22, 2014. Frontiers in Artificial Intelligence and Applications 264, IOS Press 2014, ISBN 978-1-61499-420-6 [contents] - [i7]Christian Geist, Ulle Endriss:
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects. CoRR abs/1401.3866 (2014) - [i6]Ulle Endriss, Umberto Grandi, Daniele Porello:
Complexity of Judgment Aggregation. CoRR abs/1401.5863 (2014) - [i5]Franz Dietrich, Ulle Endriss, Davide Grossi, Gabriella Pigozzi, Marija Slavkovik:
JA4AI - Judgment Aggregation for Artificial Intelligence (Dagstuhl Seminar 14202). Dagstuhl Reports 4(5): 27-39 (2014) - 2013
- [j22]Michael J. Wooldridge, Ulle Endriss, Sarit Kraus, Jérôme Lang:
Incentive engineering for Boolean games. Artif. Intell. 195: 418-439 (2013) - [j21]Umberto Grandi, Ulle Endriss:
Lifting integrity constraints in binary aggregation. Artif. Intell. 199-200: 45-66 (2013) - [j20]Umberto Grandi, Ulle Endriss:
First-Order Logic Formalisation of Impossibility Theorems in Preference Aggregation. J. Philos. Log. 42(4): 595-618 (2013) - [c65]Ulle Endriss, Raquel Fernández:
Collective Annotation of Linguistic Resources: Basic Principles and a Formal Model. ACL (1) 2013: 539-549 - [c64]Ulle Endriss:
Voting on Actions with Uncertain Outcomes. ADT 2013: 167-180 - [c63]Ulle Endriss:
Reduction of economic inequality in combinatorial domains. AAMAS 2013: 175-182 - [c62]Ulle Endriss:
Recent Developments in Collective Decision Making in Combinatorial Domains. CiE 2013: 123 - 2012
- [j19]Ulle Endriss, Umberto Grandi, Daniele Porello:
Complexity of Judgment Aggregation. J. Artif. Intell. Res. 45: 481-514 (2012) - [c61]Annemieke Reijngoud, Ulle Endriss:
Voter response to iterated poll information. AAMAS 2012: 635-644 - 2011
- [j18]Christian Geist, Ulrich Endriss:
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects. J. Artif. Intell. Res. 40: 143-174 (2011) - [j17]Szymon Klarman, Ulle Endriss, Stefan Schlobach:
ABox Abduction in the Description Logic ALC. J. Autom. Reason. 46(1): 43-80 (2011) - [c60]Ulle Endriss, Sarit Kraus, Jérôme Lang, Michael J. Wooldridge:
Designing incentives for Boolean games. AAMAS 2011: 79-86 - [c59]Ulle Endriss:
Applications of Logic in Social Choice Theory - (Invited Talk). CLIMA 2011: 88-91 - [c58]Daniele Porello, Ulle Endriss:
Ontology Merging as Social Choice. CLIMA 2011: 157-170 - [c57]Stéphane Airiau, Ulle Endriss, Umberto Grandi, Daniele Porello, Joel Uckelman:
Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections. IJCAI 2011: 18-23 - [c56]Umberto Grandi, Ulle Endriss:
Binary Aggregation with Integrity Constraints. IJCAI 2011: 204-209 - [c55]Ulle Endriss, Sarit Kraus, Jérôme Lang, Michael J. Wooldridge:
Incentive Engineering for Boolean Games. IJCAI 2011: 2602-2607 - [c54]Ulle Endriss:
Computational Social Choice (with a Special Emphasis on the Use of Logic). TbiLLC 2011: 1-3 - [c53]Ulle Endriss:
Computational Social Choice: Prospects and Challenges. FET 2011: 68-72 - [i4]Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Francesca Toni:
Negotiating Socially Optimal Allocations of Resources. CoRR abs/1109.6340 (2011) - 2010
- [j16]Yann Chevaleyre, Ulle Endriss, Nicolas Maudet:
Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality. Auton. Agents Multi Agent Syst. 20(2): 234-259 (2010) - [j15]Andrea Giovannucci, Jesús Cerquides, Ulle Endriss, Juan A. Rodríguez-Aguilar:
A graphical formalism for mixed multi-unit combinatorial auctions. Auton. Agents Multi Agent Syst. 20(3): 342-368 (2010) - [j14]Joel Uckelman, Ulle Endriss:
Compactly representing utility functions using weighted goals and the max aggregator. Artif. Intell. 174(15): 1222-1246 (2010) - [c52]Umberto Grandi, Ulle Endriss:
Lifting Rationality Assumptions in Binary Aggregation. AAAI 2010: 780-785 - [c51]Andreas Witzel, Ulle Endriss:
Time Constraints in Mixed Multi-unit Combinatorial Auctions. AMEC/TADA 2010: 127-143 - [c50]Stéphane Airiau, Ulle Endriss:
Multiagent resource allocation with sharable items: simple protocols and Nash equilibria. AAMAS 2010: 167-174 - [c49]Ulle Endriss, Umberto Grandi, Daniele Porello:
Complexity of judgment aggregation: safety of the agenda. AAMAS 2010: 359-366 - [c48]Andreas Witzel, Ulle Endriss:
Time constraints in mixed multi-unit combinatorial auctions. AAMAS 2010: 1487-1488 - [c47]Daniele Porello, Ulle Endriss:
Modelling Multilateral Negotiation in Linear Logic. ECAI 2010: 381-386 - [c46]Sylvain Bouveret, Ulle Endriss, Jérôme Lang:
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods. ECAI 2010: 387-392 - [c45]Daniele Porello, Ulle Endriss:
Modelling Combinatorial Auctions in Linear Logic. KR 2010
2000 – 2009
- 2009
- [j13]Joel Uckelman, Yann Chevaleyre, Ulle Endriss, Jérôme Lang:
Representing Utility Functions via Weighted Goals. Math. Log. Q. 55(4): 341-361 (2009) - [j12]Stéphane Airiau, Ulle Endriss, Joseph Y. Halpern:
Solution to Exchanges 8.1 puzzle: identifying the champion. SIGecom Exch. 8(2): 11 (2009) - [j11]Paolo Mancarella, Giacomo Terreni, Fariba Sadri, Francesca Toni, Ulle Endriss:
The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments. Theory Pract. Log. Program. 9(6): 691-750 (2009) - [c44]Stéphane Airiau, Ulle Endriss:
Iterated Majority Voting. ADT 2009: 38-49 - [c43]Sara Ramezani, Ulle Endriss:
Nash Social Welfare in Multiagent Resource Allocation. AMEC/TADA 2009: 117-131 - [c42]Andrea Giovannucci, Jesús Cerquides, Ulle Endriss, Meritxell Vinyals, Juan A. Rodríguez-Aguilar, Bruno Rosell:
A mixed multi-unit combinatorial auctions test suite. AAMAS (2) 2009: 1389-1390 - [c41]Sylvain Bouveret, Ulle Endriss, Jérôme Lang:
Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods. IJCAI 2009: 67-72 - [c40]Ulle Endriss, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness. IJCAI 2009: 122-127 - [c39]Umberto Grandi, Ulle Endriss:
First-Order Logic Formalisation of Arrow's Theorem. LORI 2009: 133-146 - [i3]Paolo Mancarella, Giacomo Terreni, Fariba Sadri, Francesca Toni, Ulrich Endriss:
The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments. CoRR abs/0906.1182 (2009) - 2008
- [j10]Yann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet:
Preference Handling in Combinatorial Domains: From AI to Social Choice. AI Mag. 29(4): 37-46 (2008) - [j9]Yann Chevaleyre, Ulle Endriss, Sylvia Estivie, Nicolas Maudet:
Multiagent resource allocation in k -additive domains: preference representation and complexity. Ann. Oper. Res. 163(1): 49-62 (2008) - [j8]Ulle Endriss:
The 1st international workshop on computational social choice. Knowl. Eng. Rev. 23(2): 213-215 (2008) - [c38]Yann Chevaleyre, Ulle Endriss, Nicolas Maudet:
Trajectories of goods in distributed allocation. AAMAS (2) 2008: 1111-1118 - [c37]Brammert Ottens, Ulle Endriss:
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions. AAMAS (3) 2008: 1601-1604 - [c36]Joel Uckelman, Ulle Endriss:
Winner determination in combinatorial auctions with logic-based bidding languages. AAMAS (3) 2008: 1617-1620 - [c35]Joel Uckelman, Ulle Endriss:
Preference Modeling by Weighted Goals with Max Aggregation. KR 2008: 579-588 - 2007
- [j7]Raquel Fernández, Ulle Endriss:
Abstract models for dialogue protocols. J. Log. Lang. Inf. 16(2): 121-140 (2007) - [j6]Andrea Giovannucci, Juan A. Rodríguez-Aguilar, Meritxell Vinyals, Jesús Cerquides, Ulle Endriss:
Mixed multi-unit combinatorial auctions for supply chain management. SIGecom Exch. 7(1): 58-60 (2007) - [c34]Yann Chevaleyre, Ulrich Endriss, Nicolas Maudet:
Allocating Goods on a Graph to Eliminate Envy. AAAI 2007: 700-705 - [c33]Andrea Giovannucci, Juan A. Rodríguez-Aguilar, Jesús Cerquides, Ulle Endriss:
Winner determination for mixed multi-unit combinatorial auctions via petri nets. AAMAS 2007: 104 - [c32]Hylke Buisman, Gijs Kruitbosch, Nadya Peek, Ulle Endriss:
Simulation of Negotiation Policies in Distributed Multiagent Resource Allocation. ESAW 2007: 224-239 - [c31]Jesús Cerquides, Ulle Endriss, Andrea Giovannucci, Juan A. Rodríguez-Aguilar:
Bidding Languages and Winner Determination for Mixed Multi-unit Combinatorial Auctions. IJCAI 2007: 1221-1226 - [c30]Yann Chevaleyre, Ulle Endriss, Sylvia Estivie, Nicolas Maudet:
Reaching Envy-Free States in Distributed Negotiation Settings. IJCAI 2007: 1239-1244 - [c29]Yann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet:
A Short Introduction to Computational Social Choice. SOFSEM (1) 2007: 51-69 - [c28]Ulle Endriss:
Vote manipulation in the presence of multiple sincere ballots. TARK 2007: 125-134 - [e4]Ulle Endriss, Jérôme Lang, Francesca Rossi, Tuomas Sandholm:
Computational Issues in Social Choice, 21.10. - 26.10.2007. Dagstuhl Seminar Proceedings 07431, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i2]Ulle Endriss, Jérôme Lang, Francesca Rossi, Tuomas Sandholm:
07431 Executive Summary - Computational Issues in Social Choice. Computational Issues in Social Choice 2007 - [i1]Ulle Endriss, Jérôme Lang, Francesca Rossi, Tuomas Sandholm:
07431 Abstracts Collection - Computational Issues in Social Choice. Computational Issues in Social Choice 2007 - 2006
- [j5]Andrea Bracciali, Ulle Endriss, Neophytos Demetriou, Antonis C. Kakas, Wenjin Lu, Kostas Stathis:
Crafting the mind of PROSOCS agents. Appl. Artif. Intell. 20(2-4): 105-131 (2006) - [j4]Yann Chevaleyre, Paul E. Dunne, Ulle Endriss, Jérôme Lang, Michel Lemaître, Nicolas Maudet, Julian A. Padget, Steve Phelps, Juan A. Rodríguez-Aguilar, Paulo Sousa:
Issues in Multiagent Resource Allocation. Informatica (Slovenia) 30(1): 3-31 (2006) - [j3]Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Francesca Toni:
Negotiating Socially Optimal Allocations of Resources. J. Artif. Intell. Res. 25: 315-348 (2006) - [c27]Ulle Endriss:
Temporal Logics for Representing Agent Communication Protocols. AC 2006: 15-29 - [c26]Yann Chevaleyre, Ulle Endriss, Nicolas Maudet:
Tractable negotiation in tree-structured domains. AAMAS 2006: 362-369 - [c25]Ulle Endriss:
Monotonic concession protocols for multilateral negotiation. AAMAS 2006: 392-399 - [c24]Sylvia Estivie, Yann Chevaleyre, Ulle Endriss, Nicolas Maudet:
How equitable is rational negotiation? AAMAS 2006: 866-873 - [c23]Jesús Cerquides, Ulle Endriss, Andrea Giovannucci, Juan A. Rodríguez-Aguilar:
Bidding Languages and Winner Determination for Mixed Multi-unit Combinatorial Auctions. EUMAS 2006 - [c22]Ulle Endriss, Eric Pacuit:
Modal Logics of Negotiation and Preference. JELIA 2006: 138-150 - [c21]Yann Chevaleyre, Ulle Endriss, Jérôme Lang:
Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modeling. KR 2006: 145-152 - [p1]Yann Chevaleyre, Ulle Endriss, Nicolas Maudet:
Some Recent Results and Open Questions in Distributed Resource Allocation. Decision Theory and Multi-Agent Planning 2006: 49-63 - [e3]Matteo Baldoni, Ulle Endriss, Andrea Omicini, Paolo Torroni:
Declarative Agent Languages and Technologies III, Third International Workshop, DALT 2005, Utrecht, The Netherlands, July 25, 2005, Selected and Revised Papers. Lecture Notes in Computer Science 3904, Springer 2006, ISBN 3-540-33106-9 [contents] - [e2]Matteo Baldoni, Ulle Endriss:
Declarative Agent Languages and Technologies IV, 4th International Workshop, DALT 2006, Hakodate, Japan, May 8, 2006, Selected, Revised and Invited Papers. Lecture Notes in Computer Science 4327, Springer 2006, ISBN 3-540-68959-1 [contents] - 2005
- [j2]Ulle Endriss, Nicolas Maudet:
On the Communication Complexity of Multilateral Trading: Extended Report. Auton. Agents Multi Agent Syst. 11(1): 91-107 (2005) - [j1]Yann Chevaleyre, Paul E. Dunne, Ulle Endriss, Jérôme Lang, Nicolas Maudet, Juan A. Rodríguez-Aguilar:
Multiagent resource allocation. Knowl. Eng. Rev. 20(2): 143-149 (2005) - [c20]Yann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet:
Negotiating over small bundles of resources. AAMAS 2005: 296-302 - [c19]Ulle Endriss:
Temporal logics for normative agent communication protocols. AAMAS 2005: 1127-1128 - [c18]Yann Chevaleyre, Ulle Endriss, Nicolas Maudet:
Maximal Classes of Utility Functions for Efficient one-to-one Negotiation: Extended Abstract. BNAIC 2005: 331-332 - [c17]Yann Chevaleyre, Ulle Endriss, Nicolas Maudet:
On Maximal Classes of Utility Functions for Efficient one-to-one Negotiation. IJCAI 2005: 941-946 - [c16]Sylvia Estivie, Yann Chevaleyre, Ulle Endriss, Nicolas Maudet:
Sur le caractère égalitaire de l'allocation de ressources distribuée. JFSMA 2005: 143-156 - 2004
- [c15]Ulrich Endriss, Nicolas Maudet:
On the Communication Complexity of Multilateral Trading. AAMAS 2004: 622-629 - [c14]Yann Chevaleyre, Ulrich Endriss, Sylvia Estivie, Nicolas Maudet:
Welfare Engineering in Practice: On the Variety of Multiagent Resource Allocation Problems. ESAW 2004: 335-347 - [c13]Andrea Bracciali, Neophytos Demetriou, Ulrich Endriss, Antonis C. Kakas, Wenjin Lu, Paolo Mancarella, Fariba Sadri, Kostas Stathis, Giacomo Terreni, Francesca Toni:
The KGP Model of Agency for Global Computing: Computational Model and Prototype Implementation. Global Computing 2004: 340-367 - [c12]Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Giacomo Terreni, Francesca Toni:
The CIFF Proof Procedure for Abductive Logic Programming with Constraints. JELIA 2004: 31-43 - [c11]Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Giacomo Terreni, Francesca Toni:
Abductive Logic Programming with CIFF: System Description. JELIA 2004: 680-684 - 2003
- [b1]Ulrich Endriss:
Modal logics of ordered trees. King's College London, UK, 2003 - [c10]Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Francesca Toni:
Logic-Based Agent Communication Protocols. Workshop on Agent Communication Languages 2003: 91-107 - [c9]Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Francesca Toni:
On optimal outcomes of negotiations over resources. AAMAS 2003: 177-184 - [c8]Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Francesca Toni:
Aspects of protocol conformance in inter-agent dialogue. AAMAS 2003: 982-983 - [c7]Ulrich Endriss, Nicolas Maudet:
Welfare Engineering in Multiagent Systems. ESAW 2003: 93-106 - [c6]Ulrich Endriss, Wenjin Lu, Nicolas Maudet, Kostas Stathis:
Competent Agents and Customising Protocols. ESAW 2003: 168-181 - [c5]Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Francesca Toni:
Protocol Conformance for Logic-based Agents. IJCAI 2003: 679-684 - 2000
- [c4]Ulrich Endriss:
Reasoning in Description Logics with Wellington 1.0 - System Description. ARW 2000 - [e1]Hans Jürgen Ohlbach, Ulrich Endriss, Odinaldo Rodrigues, Stefan Schlobach:
Proceedings of the Seventh Workshop on Automated Reasoning, Bridging the Gap between Theory and Practice, King's College London, UK, 20-21 July 2000. CEUR Workshop Proceedings 32, CEUR-WS.org 2000 [contents]
1990 – 1999
- 1999
- [c3]Ulrich Endriss:
An Interactive Theorem Proving Assistant. TABLEAUX 1999: 308-312 - [c2]Ulrich Endriss:
A Time Efficient KE Based Theorem Prover. TABLEAUX 1999: 313-318 - 1998
- [c1]Marcello D'Agostino, Marco Mondadori, Ulrich Endriss, Dov M. Gabbay, Jeremy Pitt:
WinKE: A Pedagogical Tool for Teaching Logic and Reasoning. Intelligent Tutoring Systems 1998: 605
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
