![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 2021
- Ben Abramowitz, Edith Elkind, Davide Grossi
, Ehud Shapiro, Nimrod Talmon:
Democratic Forking: Choosing Sides with Social Choice. ADT 2021: 341-356 - Ben Abramowitz, Ehud Shapiro, Nimrod Talmon:
In the Beginning There Were n Agents: Founding and Amending a Constitution. ADT 2021: 119-131 - Loïc Adam
, Sébastien Destercke:
Incremental Elicitation of Preferences: Optimist or Pessimist? ADT 2021: 71-85 - Abu Mohammad Hammad Ali, Howard J. Hamilton, Elizabeth Rayner, Boting Yang, Sandra Zilles:
Aggregating Preferences Represented by Conditional Preference Networks. ADT 2021: 3-18 - Haris Aziz, Aditya Ganguly:
Participatory Funding Coordination: Model, Axioms and Rules. ADT 2021: 409-423 - Haris Aziz, Alexander Lam:
Obvious Manipulability of Voting Rules. ADT 2021: 179-193 - Dorothea Baumeister, Linus Boes, Johanna Hillebrand:
Complexity of Manipulative Interference in Participatory Budgeting. ADT 2021: 424-439 - Ruben Becker
, Gianlorenzo D'Angelo
, Esmaeil Delfaraz, Hugo Gilbert:
Unveiling the Truth in Liquid Democracy with Misinformed Voters. ADT 2021: 132-146 - Nawal Benabbou, Cassandre Leroy, Thibaut Lust, Patrice Perny:
Interactive Optimization of Submodular Functions Under Matroid Constraints. ADT 2021: 307-322 - Nina Chiarelli, Clément Dallard
, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy:
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT 2021: 243-257 - Andreas Darmann:
Hedonic Diversity Games Revisited. ADT 2021: 357-372 - Bruno Escoffier
, Olivier Spanjaard
, Magdaléna Tydrichová
:
Measuring Nearly Single-Peakedness of an Electorate: Some New Insights. ADT 2021: 19-34 - Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski
:
On Fairness via Picking Sequences in Allocation of Indivisible Goods. ADT 2021: 258-272 - Thekla Hamm, Martin Lackner
, Anna Rapberger:
Computing Kemeny Rankings from d-Euclidean Preferences. ADT 2021: 147-161 - Joanna Kaczmarek, Jörg Rothe
:
Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games. ADT 2021: 194-208 - Paul Alain Kaldjob Kaldjob, Brice Mayag, Denis Bouyssou:
Necessary and Possible Interaction in a 2-Maxitive Sugeno Integral Model. ADT 2021: 323-337 - Xudong Liu, Miroslaw Truszczynski:
Probabilistic Lexicographic Preference Trees. ADT 2021: 86-100 - Hugo Martin, Patrice Perny:
Incremental Preference Elicitation with Bipolar Choquet Integrals. ADT 2021: 101-116 - Luis Müller, Matthias Bentert:
On Reachable Assignments in Cycles. ADT 2021: 273-288 - Beatrice Napolitano
, Olivier Cailloux, Paolo Viappiani:
Simultaneous Elicitation of Scoring Rule and Agent Preferences for Robust Winner Determination. ADT 2021: 51-67 - Leora Schmerler, Noam Hazon:
Strategic Voting in Negotiating Teams. ADT 2021: 209-223 - Arnaud Grivet Sébert
, Nicolas Maudet, Patrice Perny, Paolo Viappiani
:
Preference Aggregation in the Generalised Unavailable Candidate Model. ADT 2021: 35-50 - Parham Shams, Aurélie Beynier, Sylvain Bouveret, Nicolas Maudet:
Minimizing and Balancing Envy Among Agents Using Ordered Weighted Average. ADT 2021: 289-303 - Kshitija Taywade, Judy Goldsmith, Brent Harrison:
Multi-agent Reinforcement Learning for Decentralized Stable Matching. ADT 2021: 375-389 - Taiki Todo
, Ryoji Wada, Kentaro Yahiro, Makoto Yokoo
:
Lazy Gale-Shapley for Many-to-One Matching with Partial Information. ADT 2021: 390-405 - Yongjie Yang
:
The Nonmanipulative Vote-Deficits of Voting Rules. ADT 2021: 224-240 - Gil Ben Zvi, Eyal Leizerovich, Nimrod Talmon:
Iterative Deliberation via Metric Aggregation. ADT 2021: 162-176 - Dimitris Fotakis
, David Ríos Insua
:
Algorithmic Decision Theory - 7th International Conference, ADT 2021, Toulouse, France, November 3-5, 2021, Proceedings. Lecture Notes in Computer Science 13023, Springer 2021, ISBN 978-3-030-87755-2 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-21 04:43 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint