![](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 26 matches
- 2009
- David L. Applegate, Marc LeBrun, Neil J. A. Sloane:
Descending Dungeons and Iterated Base-Changing. The Mathematics of Preference, Choice and Order 2009: 393-402 - David E. Bell, Ralph L. Keeney:
Altruistic Utility Functions for Joint Decisions. The Mathematics of Preference, Choice and Order 2009: 27-38 - James N. Bodurtha, Qi Shen:
Normally Distributed Admissible Choices are Optimal. The Mathematics of Preference, Choice and Order 2009: 73-83 - Denis Bouyssou, Thierry Marchant, Marc Pirlot:
A Conjoint Measurement Approach to the Discrete Sugeno Integral. The Mathematics of Preference, Choice and Order 2009: 85-109 - Steven J. Brams, M. Remzi Sanver:
Voting Systems that Combine Approval and Preference. The Mathematics of Preference, Choice and Order 2009: 215-237 - David E. Brown, Larry J. Langley:
Probe Interval Orders. The Mathematics of Preference, Choice and Order 2009: 313-322 - Donald E. Campbell, Jerry S. Kelly:
Pareto, Anonymity or Neutrality, but Not IIA: Countably Many Alternatives. The Mathematics of Preference, Choice and Order 2009: 261-270 - Wenqing Dou, Frank K. Hwang:
Optimal Reservation Scheme Routing for Two-Rate Wide-Sense Nonblocking Three-Stage Clos Networks. The Mathematics of Preference, Choice and Order 2009: 355-360 - Jean-Claude Falmagne, Sergei Ovchinnikov:
Mediatic Graphs. The Mathematics of Preference, Choice and Order 2009: 325-343 - Marc R. Feix, Dominique Lepelley, Vincent Merlin, Jean-Louis Rouet:
On the Probability to Act in the European Union. The Mathematics of Preference, Choice and Order 2009: 197-211 - William V. Gehrlein:
Condorcet's Paradox with Three Candidates. The Mathematics of Preference, Choice and Order 2009: 183-196 - Brian Hopkins, Michael A. Jones:
Bruhat Orders and the Sequential Selection of Indivisible Items. The Mathematics of Preference, Choice and Order 2009: 273-285 - Garth Isaak:
Interval Order Representation via Shortest Paths. The Mathematics of Preference, Choice and Order 2009: 303-311 - Jianmin Jia, James S. Dyer:
Decision Making Based on Risk-Value Tradeoffs. The Mathematics of Preference, Choice and Order 2009: 59-72 - Jeffrey C. Lagarias, Eric M. Rains, Robert J. Vanderbei:
The Kruskal Count. The Mathematics of Preference, Choice and Order 2009: 371-391 - R. Duncan Luce, Anthony A. J. Marley
, Che Tat Ng:
Entropy-Related Measures of the Utility of Gambling. The Mathematics of Preference, Choice and Order 2009: 5-25 - Bernard Monjardet:
Acyclic Domains of Linear Orders: A Survey. The Mathematics of Preference, Choice and Order 2009: 139-160 - Yutaka Nakamura:
SSB Preferences: Nonseparable Utilities or Nonseparable Beliefs. The Mathematics of Preference, Choice and Order 2009: 39-55 - Svata Poljak, Fred S. Roberts
:
An Application of Stahl's Conjecture About the k-Tuple Chromatic Numbers of Kneser Graphs. The Mathematics of Preference, Choice and Order 2009: 345-352 - Donald G. Saari:
Condorcet Domains: A Geometric Perspective. The Mathematics of Preference, Choice and Order 2009: 161-182 - Siddhartha Sahi:
Correlation Inequalities for Partially Ordered Algebras. The Mathematics of Preference, Choice and Order 2009: 361-369 - Larry Shepp:
Updating Hardy, Littlewood and Pólya with Linear Programming. The Mathematics of Preference, Choice and Order 2009: 403-420 - Alan Shuchat, Randy Shull, Ann N. Trenk:
Fractional Weak Discrepancy of Posets and Certain Forbidden Configurations. The Mathematics of Preference, Choice and Order 2009: 291-301 - Arkadii Slinko
:
Additive Representability of Finite Measurement Structures. The Mathematics of Preference, Choice and Order 2009: 113-133 - William S. Zwicker:
Anonymous Voting Rules with Abstention: Weighted Voting. The Mathematics of Preference, Choice and Order 2009: 239-258 - Steven J. Brams, William V. Gehrlein, Fred S. Roberts:
The Mathematics of Preference, Choice and Order. Studies in Choice and Welfare, Springer 2009, ISBN 978-3-540-79127-0 [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-05 11:01 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