


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.
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 33 matches
- 2012
- Fuad Aleskerov
, Daniel Karabekyan
, M. Remzi Sanver, Vyacheslav Yakuba:
On the manipulability of voting rules: The case of 4 and 5 alternatives. Math. Soc. Sci. 64(1): 67-73 (2012) - Alnur Ali, Marina Meila:
Experiments with Kemeny ranking: What works when? Math. Soc. Sci. 64(1): 28-40 (2012) - Michael P. Atkinson, Moshe Kress, Roberto Szechtman:
Carrots, sticks and fog during insurgencies. Math. Soc. Sci. 64(3): 203-213 (2012) - Sylvain Béal, Eric Rémila, Philippe Solal:
Weighted component fairness for forest games. Math. Soc. Sci. 64(2): 144-151 (2012) - Pascal Billand, Christophe Bravard, Sudipta Sarangi
:
Existence of Nash networks and partner heterogeneity. Math. Soc. Sci. 64(2): 152-158 (2012) - Francis Bloch, Sudipta Sarangi
:
Bargaining, Evolution and Networks: A Special Issue in Honor of Hans Haller. Math. Soc. Sci. 64(2): v-vi (2012) - Walter Bossert, Kotaro Suzumura:
Product filters, acyclicity and Suzumura consistency. Math. Soc. Sci. 64(3): 258-262 (2012) - Felix Brandt, William S. Zwicker:
Special Issue on Computational Foundations of Social Choice. Math. Soc. Sci. 64(1): 1 (2012) - Donald E. Campbell, Jack E. Graver, Jerry S. Kelly:
There are more strategy-proof procedures than you think. Math. Soc. Sci. 64(3): 263-265 (2012) - Davide P. Cervone, Ronghua Dai, Daniel Gnoutcheff, Grant Lanterman, Andrew Mackenzie, Ari Morse, Nikhil Srivastava, William S. Zwicker:
Voting with rubber bands, weights, and strings. Math. Soc. Sci. 64(1): 11-27 (2012) - Yann Chevaleyre, Jérôme Lang, Nicolas Maudet
, Jérôme Monnot, Lirong Xia
:
New candidates welcome! Possible winners with respect to the addition of new candidates. Math. Soc. Sci. 64(1): 74-88 (2012) - Youngsub Chun, Joosung Lee
:
Sequential contributions rules for minimum cost spanning tree problems. Math. Soc. Sci. 64(2): 136-143 (2012) - Vincent Conitzer:
Should social network structure be taken into account in elections? Math. Soc. Sci. 64(1): 100-102 (2012) - Mostapha Diss, Ahmed Louichi, Vincent Merlin, Hatem Smaoui:
An example of probability computations under the IAC assumption: The stability of scoring rules. Math. Soc. Sci. 64(1): 57-66 (2012) - Adam Dominiak, Jürgen Eichberger, Jean-Philippe Lefort:
Agreeable trade with optimism and pessimism. Math. Soc. Sci. 64(2): 119-126 (2012) - Bram Driesen, Andrés Perea, Hans Peters:
Alternating offers bargaining with loss aversion. Math. Soc. Sci. 64(2): 103-118 (2012) - Josep Freixas
:
Probabilistic power indices for voting rules with abstention. Math. Soc. Sci. 64(1): 89-99 (2012) - Tsogbadral Galaabaatar, Edi Karni:
Expected multi-utility representations. Math. Soc. Sci. 64(3): 242-246 (2012) - Hans Gersbach, Maik T. Schneider
:
Tax contracts, party bargaining, and government formation. Math. Soc. Sci. 64(2): 173-192 (2012) - Robert P. Gilles
, Subhadip Chakrabarti, Sudipta Sarangi
:
Nash equilibria of network formation games under consent. Math. Soc. Sci. 64(2): 159-165 (2012) - Hans Haller:
Network extension. Math. Soc. Sci. 64(2): 166-172 (2012) - Joseph E. Harrington Jr., Wei Zhao:
Signaling and tacit collusion in an infinitely repeated Prisoners' Dilemma. Math. Soc. Sci. 64(3): 277-289 (2012) - Frederik Herzberg
, Daniel Eckert:
The model-theoretic approach to aggregation: Impossibility results for finite and infinite electorates. Math. Soc. Sci. 64(1): 41-47 (2012) - Olivier Hudry:
On the computation of median linear orders, of median complete preorders and of median weak orders. Math. Soc. Sci. 64(1): 2-10 (2012) - Yannis M. Ioannides
:
Complexity and organizational architecture. Math. Soc. Sci. 64(2): 193-202 (2012) - Taketo Kawagishi:
Endogenous time preference, investment externalities, and equilibrium indeterminacy. Math. Soc. Sci. 64(3): 234-241 (2012) - Christian Klamler
, Ulrich Pferschy
, Stefan Ruzika:
Committee selection under weight constraints. Math. Soc. Sci. 64(1): 48-56 (2012) - Edwin Lohmann, Peter Borm
, P. Jean-Jacques Herings
:
Minimal exact balancedness. Math. Soc. Sci. 64(2): 127-135 (2012) - Kazuo Mino, Yasuhiro Nakamoto
:
Consumption externalities and equilibrium dynamics with heterogeneous agents. Math. Soc. Sci. 64(3): 225-233 (2012) - Stefan Napel, Andreas Nohn, José María Alonso-Meijide
:
Monotonicity of power in weighted voting games with restricted communication. Math. Soc. Sci. 64(3): 247-257 (2012)
loading more results
failed to load more results, please try again later

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.
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.
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.
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 2025-06-26 19:38 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
