default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDolors Berga
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j15]Dolors Berga
, Bernardo Moreno, Antonio Nicolò:
Undominated rules with three alternatives in an almost unrestricted domain. Soc. Choice Welf. 60(1-2): 65-74 (2023)- 2022
- [j14]Salvador Barberà, Dolors Berga, Bernardo Moreno:
Restricted environments and incentive compatibility in interdependent values models. Games Econ. Behav. 131: 1-28 (2022) - 2020
- [j13]Salvador Barberà, Dolors Berga, Bernardo Moreno:
Arrow on domain conditions: a fruitful road to travel. Soc. Choice Welf. 54(2-3): 237-258 (2020) - 2017
- [j12]Salvador Barberà, Dolors Berga, Bernardo Moreno:
Immunity to credible deviations from the truth. Math. Soc. Sci. 90: 129-140 (2017) - 2014
- [j11]Kentaro Hatsumi, Dolors Berga, Shigehiro Serizawa:
A maximal domain for strategy-proof and no-vetoer rules in the multi-object choice model. Int. J. Game Theory 43(1): 153-168 (2014) - 2012
- [j10]Salvador Barberà, Dolors Berga, Bernardo Moreno:
Two necessary conditions for strategy-proofness: On what domains are they also sufficient? Games Econ. Behav. 75(2): 490-509 (2012) - [j9]Salvador Barberà, Dolors Berga, Bernardo Moreno:
Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results. Int. J. Game Theory 41(4): 791-808 (2012) - [j8]Salvador Barberà, Dolors Berga, Bernardo Moreno:
Domains, ranges and strategy-proofness: the case of single-dipped preferences. Soc. Choice Welf. 39(2-3): 335-352 (2012) - 2010
- [j7]Salvador Barberà, Dolors Berga, Bernardo Moreno:
Individual versus group strategy-proofness: When do they coincide? J. Econ. Theory 145(5): 1648-1674 (2010) - 2009
- [j6]Dolors Berga, Bernardo Moreno:
Strategic requirements with indifference: single-peaked versus single-plateaued preferences. Soc. Choice Welf. 32(2): 275-298 (2009) - 2007
- [j5]Dolors Berga, Gustavo Bergantiños, Jordi Massó, Alejandro Neme:
An undominated Nash equilibrium for voting by committees with exit. Math. Soc. Sci. 54(2): 152-175 (2007) - 2006
- [j4]Dolors Berga, Gustavo Bergantiños, Jordi Massó, Alejandro Neme:
On Exiting After Voting. Int. J. Game Theory 34(1): 33-54 (2006) - 2004
- [j3]Dolors Berga, Gustavo Bergantiños, Jordi Massó, Alejandro Neme:
Stability and voting by committees with exit. Soc. Choice Welf. 23(2): 229-247 (2004) - 2002
- [j2]Dolors Berga:
Single-peakedness and strategy-proofness of generalized median voter schemes. Soc. Choice Welf. 19(1): 175-192 (2002) - 2000
- [j1]Dolors Berga, Shigehiro Serizawa:
Maximal Domain for Strategy-Proof Rules with One Public Good. J. Econ. Theory 90(1): 39-61 (2000)
Conference and Workshop Papers
- 2013
- [c1]Salvador Barberà, Dolors Berga, Bernardo Moreno:
Some New Domain Restrictions in Social Choice, and Their Consequences. MDAI 2013: 11-24
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-04-24 22:54 CEST 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:
