We study games with incomplete information and characterize when a feasible outcome is Pareto efficient. Outcomes with excessive randomization are inefficient: generically, the total number of action profiles across states must be strictly less than the sum of the number of players and the...

The Deferred Acceptance (DA) algorithm is stable and strategy-proof, but can produce matchings that are Pareto-inefficient for students, and thus several alternatives have been proposed to correct this inefficiency that only involve consented priority violations. However, we show that these...

We consider a package assignment problem with money, in which a set M of objects is allocated to agents. Each agent has preferences that are not necessarily quasi-linear. The admissible set of object allocations is chosen by the planner to pursue specific objectives in conjunction with the rule....

Heterogeneous beliefs among market participants can lead to questionable speculative trading that goes beyond any risk-sharing motives. We demonstrate that such unwarranted betting behavior in market equilibrium can be mitigated by introducing nonlinear pricing for ambiguous contracts, without...

Calls to boycott a foreign country aim to push a share of domestic consumers to cut their consumption of goods imported from the targeted country. How do boycotts differ from sanctions? Should boycotters target all of the country’s products, or should they focus on a restricted set of sectors?...

This paper proposes a novel method of Pareto front generation from a set of piecewise linear trade-off curves typically encountered in bi-objective just-in-time (JIT) scheduling problems. We have considered the simultaneous minimization of total weighted earliness and tardiness (TWET) and total...