Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHervé Moulin 0001
Person information
- affiliation: University of Glasgow, UK
- affiliation (former): Rice University, Houston, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2003
[b1]Hervé Moulin:
Fair division and collective welfare. MIT Press 2003, ISBN 978-0-262-63311-6, pp. 1-289
Journal Articles
- 2024
- [j47]Haris Aziz, Bo Li
, Hervé Moulin, Xiaowei Wu, Xinran Zhu:
Almost proportional allocations of indivisible chores: Computation, approximation and efficiency. Artif. Intell. 331: 104118 (2024) - [j46]Michel Grabisch, Hervé Moulin, José Manuel Zarzuelo:
Professor Peter Sudhölter (1957-2024). Int. J. Game Theory 53(2): 289-294 (2024) - 2023
- [j45]Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris, Xiaowei Wu:
Fair division of indivisible goods: Recent progress and open questions. Artif. Intell. 322: 103965 (2023) - [j44]Anna Bogomolnaia, Hervé Moulin:
Guarantees in Fair Division: General or Monotone Preferences. Math. Oper. Res. 48(1): 160-176 (2023) - 2022
- [j43]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy:
On the Fair Division of a Random Object. Manag. Sci. 68(2): 1174-1194 (2022) - [j42]Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu:
Algorithmic fair allocation of indivisible items: a survey and new questions. SIGecom Exch. 20(1): 24-40 (2022) - 2021
- [j41]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
- [j40]Haris Aziz, Hervé Moulin, Fedor Sandomirskiy:
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Oper. Res. Lett. 48(5): 573-578 (2020) - [j39]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
- [j38]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaia:
Dividing bads under additive utilities. Soc. Choice Welf. 52(3): 395-417 (2019) - [j37]Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, Junxing Wang:
The Unreasonable Fairness of Maximum Nash Welfare. ACM Trans. Economics and Comput. 7(3): 12:1-12:32 (2019) - 2017
- [j36]Hervé Moulin:
Consistent bilateral assignment. Math. Soc. Sci. 90: 43-55 (2017) - 2016
- [j35]Hervé Moulin:
Entropy, desegregation, and proportional rationing. J. Econ. Theory 162: 1-20 (2016) - 2015
- [j34]Anna Bogomolnaia, Hervé Moulin:
Size versus fairness in the assignment problem. Games Econ. Behav. 90: 119-127 (2015) - 2014
- [j33]Hervé Moulin:
Pricing traffic in a spanning network. Games Econ. Behav. 86: 475-490 (2014) - [j32]Jens Leth Hougaard, Hervé Moulin:
Sharing the cost of redundant items. Games Econ. Behav. 87: 339-352 (2014) - [j31]Hervé Moulin, Indrajit Ray, Sonali Sen Gupta:
Improving Nash by coarse correlation. J. Econ. Theory 150: 852-865 (2014) - 2013
- [j30]Hervé Moulin, Rodrigo A. Velez:
The price of imperfect competition for a spanning network. Games Econ. Behav. 81: 11-26 (2013) - [j29]Hervé Moulin:
Cost Sharing in Networks: some Open Questions. IGTR 15(2) (2013) - [j28]Hervé Moulin, Jay Sethuraman:
The Bipartite Rationing Problem. Oper. Res. 61(5): 1087-1100 (2013) - [j27]Olivier Bochet, Rahmi Ilkiliç, Hervé Moulin:
Egalitarianism under earmark constraints. J. Econ. Theory 148(2): 535-562 (2013) - 2012
- [j26]Hervé Moulin, Jay Sethuraman:
Rationing problems in bipartite networks. SIGecom Exch. 11(1): 9-17 (2012) - 2011
- [j25]Hervé Moulin, Francois Laigret:
Equal-need sharing of a network under connectivity constraints. Games Econ. Behav. 72(1): 314-320 (2011) - 2010
- [j24]Anna Bogomolnaia, Hervé Moulin:
Sharing a minimal cost spanning tree: Beyond the Folk solution. Games Econ. Behav. 69(2): 238-248 (2010) - [j23]Hervé Moulin:
An efficient and almost budget balanced cost sharing method. Games Econ. Behav. 70(1): 107-131 (2010) - [j22]Suchan Chae, Hervé Moulin:
Bargaining among groups: an axiomatic viewpoint. Int. J. Game Theory 39(1-2): 71-88 (2010) - [j21]Anna Bogomolnaia, Ron Holzman, Hervé Moulin:
Sharing the Cost of a Capacity Network. Math. Oper. Res. 35(1): 173-192 (2010) - [j20]Hervé Moulin:
Auctioning or assigning an object: some remarkable VCG mechanisms. Soc. Choice Welf. 34(2): 193-216 (2010) - 2009
- [j19]Hervé Moulin:
Almost budget-balanced VCG mechanisms to assign multiple objects. J. Econ. Theory 144(1): 96-119 (2009) - 2008
- [j18]Hervé Moulin:
Proportional scheduling, split-proofness, and merge-proofness. Games Econ. Behav. 63(2): 567-587 (2008) - [j17]Hervé Moulin:
An advocate of cooperative theory. Games Econ. Behav. 64(2): 368 (2008) - [j16]Geoffroy de Clippel, Hervé Moulin, T. Nicolaus Tideman:
Impartial division of a dollar. J. Econ. Theory 139(1): 176-191 (2008) - [j15]Hervé Moulin:
A Combinatorial Inequality: 11269. Am. Math. Mon. 115(6): 571-573 (2008) - 2007
- [j14]Hervé Moulin:
Minimizing the Worst Slowdown: Offline, Online. Oper. Res. 55(5): 876-889 (2007) - [j13]Hervé Moulin:
On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs. Math. Oper. Res. 32(2): 266-283 (2007) - [j12]Hervé Moulin:
Auctioning or assigning an object: some remarkable VCG mechanisms. SIGecom Exch. 7(1): 37-42 (2007) - [j11]Hervé Moulin:
Problem 11269. Am. Math. Mon. 114(1): 78 (2007) - 2006
- [j10]Hervé Moulin, Yves Sprumont:
Responsibility and cross-subsidization in cost sharing. Games Econ. Behav. 55(1): 152-188 (2006) - 2005
- [j9]Anna Bogomolnaia, Hervé Moulin, Richard Stong:
Collective choice under dichotomous preferences. J. Econ. Theory 122(2): 165-184 (2005) - [j8]Hervé Moulin, Yves Sprumont:
On demand responsiveness in additive cost sharing. J. Econ. Theory 125(1): 1-35 (2005) - 2003
- [j7]Hervé Moulin, Richard Stong:
Filling a multicolor urn: an axiomatic analysis. Games Econ. Behav. 45(1): 242-269 (2003) - 2002
- [j6]Hervé Moulin, Richard Stong:
Fair Queuing and Other Probabilistic Allocation Methods. Math. Oper. Res. 27(1): 1-30 (2002) - [j5]Hervé Moulin:
The proportional random allocation of indivisible units. Soc. Choice Welf. 19(2): 381-413 (2002) - 2001
- [j4]Hervé Crès, Hervé Moulin:
Scheduling with Opting Out: Improving upon Random Priority. Oper. Res. 49(4): 565-577 (2001) - [j3]Anna Bogomolnaia, Hervé Moulin:
A New Solution to the Random Assignment Problem. J. Econ. Theory 100(2): 295-328 (2001) - 1982
- [j2]Hervé Moulin:
Non-cooperative implementation: A survey of recent results. Math. Soc. Sci. 3(3): 243-257 (1982) - 1976
- [j1]Hervé Moulin:
Cooperation in Mixed Equilibrium. Math. Oper. Res. 1(3): 273-286 (1976)
Conference and Workshop Papers
- 2019
- [c5]Haris Aziz, Anna Bogomolnaia, Hervé Moulin:
Fair Mixing: the Case of Dichotomous Preferences. EC 2019: 753-781 - 2016
- [c4]Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, Junxing Wang:
The Unreasonable Fairness of Maximum Nash Welfare. EC 2016: 305-322 - 2013
- [c3]Hervé Moulin, Jay Sethuraman:
Loss calibrated methods for bipartite rationing: bipartite rationing. EC 2013: 697-714 - 2010
- [c2]Olivier Bochet, Hervé Moulin, Rahmi Ilkiliç:
Clearing supply and demand under bilateral constraints. BQGT 2010: 30:1 - 2009
- [c1]Hervé Moulin:
Pricing traffic in a spanning network. EC 2009: 21-30
Editorship
- 2017
- [e1]Constantinos Daskalakis, Moshe Babaioff, Hervé Moulin:
Proceedings of the 2017 ACM Conference on Economics and Computation, EC '17, Cambridge, MA, USA, June 26-30, 2017. ACM 2017, ISBN 978-1-4503-4527-9 [contents]
Reference Works
- 2016
- [r1]Hervé Moulin:
Foreword. Handbook of Computational Social Choice 2016
Informal and Other Publications
- 2024
- [i12]Anna Bogomolnaia, Hervé Moulin:
Guaranteed shares of benefits and costs. CoRR abs/2406.14198 (2024) - 2023
- [i11]Bo Li, Hervé Moulin, Ankang Sun, Yu Zhou:
On Hill's Worst-Case Guarantee for Indivisible Bads. CoRR abs/2302.00323 (2023) - 2022
- [i10]Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu:
Algorithmic Fair Allocation of Indivisible Items: A Survey and New Questions. CoRR abs/2202.08713 (2022) - [i9]Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris, Xiaowei Wu:
Fair Division of Indivisible Goods: A Survey. CoRR abs/2208.08782 (2022) - 2019
- [i8]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy:
A simple Online Fair Division problem. CoRR abs/1903.10361 (2019) - [i7]Haris Aziz, Hervé Moulin, Fedor Sandomirskiy:
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. CoRR abs/1909.00740 (2019) - 2017
- [i6]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Competitive division of a mixed manna. CoRR abs/1702.00616 (2017) - [i5]Haris Aziz, Anna Bogomolnaia, Hervé Moulin:
Fair mixing: the case of dichotomous preferences. CoRR abs/1712.02542 (2017) - 2016
- [i4]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Dividing goods or bads under additive utilities. CoRR abs/1608.01540 (2016) - [i3]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Dividing goods and bads under additive utilities. CoRR abs/1610.03745 (2016) - 2007
- [i2]Hervé Moulin:
Strategy-proof assignment with a vanishing budget surplus. Computational Social Systems and the Internet 2007 - [i1]Hervé Moulin:
Efficient cost sharing with a cheap residual claimant. Fair Division 2007
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-07-25 20:20 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:
