The following pages link to Hervé Moulin (Q228592):
Displaying 50 items.
- Ki Hang Kim's contribution to the mathematical social sciences (Q368698) (← links)
- Sharing the cost of redundant items (Q485785) (← links)
- Bargaining among groups: an axiomatic viewpoint (Q532710) (← links)
- Equal-need sharing of a network under connectivity constraints (Q536106) (← links)
- Decentralized pricing in minimum cost spanning trees (Q612004) (← links)
- A simple random assignment problem with a unique solution (Q699028) (← links)
- Dominance solvability and Cournot stability (Q794934) (← links)
- The solidarity axiom in parametric surplus-sharing problems (Q811422) (← links)
- Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
- The price of anarchy of serial, average and incremental cost sharing (Q934898) (← links)
- Sharing a minimal cost spanning tree: beyond the folk solution (Q980947) (← links)
- An efficient and almost budget balanced cost sharing method (Q993789) (← links)
- Almost budget-balanced VCG mechanisms to assign multiple objects (Q1001816) (← links)
- From social welfare ordering to acyclic aggregation of preferences (Q1065691) (← links)
- The separability axiom and equal-sharing methods (Q1083005) (← links)
- Concorcet's principle implies the no show paradox (Q1106064) (← links)
- Can everyone benefit from growth ? Two difficulties (Q1116868) (← links)
- Implementing efficient, anonymous and neutral social choice functions (Q1147612) (← links)
- Prudence versus sophistication in voting strategy (Q1159118) (← links)
- Welfare bounds in the fair division problem (Q1176682) (← links)
- Welfare bounds in the cooperative production problem (Q1194261) (← links)
- Monotonic surplus sharing: Characterization results (Q1198168) (← links)
- (Q1234639) (redirect page) (← links)
- Extensions of two person zero sum games (Q1234640) (← links)
- Rationing a commodity along fixed paths (Q1283854) (← links)
- Distributive and additive costsharing of an homogeneous good (Q1294039) (← links)
- Average cost pricing versus serial cost sharing: An axiomatic comparison (Q1339746) (← links)
- Filling a multicolor urn: An axiomatic analysis. (Q1413221) (← links)
- Sharing the cost of risky projects (Q1640585) (← links)
- Consistent bilateral assignment (Q1680096) (← links)
- Non-cooperative implementation: A survey of recent results (Q1837610) (← links)
- Cost sharing under increasing returns: A comparison of simple mechanisms (Q1919679) (← links)
- Characterization of additive cost sharing methods (Q1927362) (← links)
- Egalitarianism under earmark constraints (Q1945835) (← links)
- Pricing traffic in a spanning network (Q2016252) (← links)
- Auctioning or assigning an object: some remarkable VCG mechanisms (Q2268363) (← links)
- Size versus fairness in the assignment problem (Q2343388) (← links)
- Incremental cost sharing: Characterization by coalition strategy-proofness (Q2386316) (← links)
- Dividing bads under additive utilities (Q2417409) (← links)
- The price of imperfect competition for a spanning network (Q2436294) (← links)
- Improving Nash by coarse correlation (Q2439924) (← links)
- Impartial division of a dollar (Q2475176) (← links)
- Collective choice under dichotomous preferences (Q2485952) (← links)
- Responsibility and cross-subsidization in cost sharing (Q2507857) (← links)
- An advocate of cooperative theory (Q2519462) (← links)
- The proportional random allocation of indivisible units (Q2567920) (← links)
- On demand responsiveness in additive cost sharing (Q2577515) (← links)
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (Q2661522) (← links)
- COST SHARING IN NETWORKS: SOME OPEN QUESTIONS (Q2854000) (← links)
- Impartial Nominations for a Prize (Q2857041) (← links)
