default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Bogomolnaia
- > Home > Persons > Anna Bogomolnaia
Publications
- 2024
[i7]Anna Bogomolnaia, Hervé Moulin:
Guaranteed shares of benefits and costs. CoRR abs/2406.14198 (2024)- 2023
- [j15]Anna Bogomolnaia
, Hervé Moulin:
Guarantees in Fair Division: General or Monotone Preferences. Math. Oper. Res. 48(1): 160-176 (2023) - 2022
- [j14]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy:
On the Fair Division of a Random Object. Manag. Sci. 68(2): 1174-1194 (2022) - 2021
- [j13]Anna Bogomolnaia, Misha Gavrilovich, Egor Ianovski, Galina Lyapunova, Hervé Moulin, Alexander S. Nesterov, Marina Sandomirskaia, Fedor Sandomirskiy, Elena Yanovskaya:
In memory of Victoria Kreps (3 September 1945-3 March 2021). Int. J. Game Theory 50(3): 597-601 (2021) - 2020
- [j12]Haris Aziz, Anna Bogomolnaia, Hervé Moulin:
Fair Mixing: The Case of Dichotomous Preferences. ACM Trans. Economics and Comput. 8(4): 18:1-18:27 (2020) - 2019
- [j11]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaia:
Dividing bads under additive utilities. Soc. Choice Welf. 52(3): 395-417 (2019) - [c1]Haris Aziz, Anna Bogomolnaia, Hervé Moulin:
Fair Mixing: the Case of Dichotomous Preferences. EC 2019: 753-781 - [i6]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy:
A simple Online Fair Division problem. CoRR abs/1903.10361 (2019) - 2017
- [i5]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Competitive division of a mixed manna. CoRR abs/1702.00616 (2017) - [i4]Haris Aziz, Anna Bogomolnaia, Hervé Moulin:
Fair mixing: the case of dichotomous preferences. CoRR abs/1712.02542 (2017) - 2016
- [i3]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Dividing goods or bads under additive utilities. CoRR abs/1608.01540 (2016) - [i2]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Dividing goods and bads under additive utilities. CoRR abs/1610.03745 (2016) - 2015
- [j10]Anna Bogomolnaia, Hervé Moulin:
Size versus fairness in the assignment problem. Games Econ. Behav. 90: 119-127 (2015) - 2010
- [j7]Anna Bogomolnaia, Hervé Moulin:
Sharing a minimal cost spanning tree: Beyond the Folk solution. Games Econ. Behav. 69(2): 238-248 (2010) - [j6]Anna Bogomolnaia, Ron Holzman, Hervé Moulin:
Sharing the Cost of a Capacity Network. Math. Oper. Res. 35(1): 173-192 (2010) - 2005
- [j4]Anna Bogomolnaia, Hervé Moulin, Richard Stong:
Collective choice under dichotomous preferences. J. Econ. Theory 122(2): 165-184 (2005) - 2001
- [j1]Anna Bogomolnaia, Hervé Moulin:
A New Solution to the Random Assignment Problem. J. Econ. Theory 100(2): 295-328 (2001)
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-07-25 20:19 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:
