Theory of Computing Systems

We study the computational complexity of decision problems about Nash equilibria in m-player games. Several such problems have recently been shown to be computationally equivalent to the decision problem for the existential theory of the reals, or ...$\mathbb{}$$\mathbb{}$$\mathbb{}$$\mathbb{}$$\mathbb{}$

The declining price anomaly states that the price weakly decreases when multiple copies of an item are sold sequentially over time. The anomaly has been observed in a plethora of practical applications. On the theoretical side, Gale and Stegeman (...

We study risk-free bidding strategies in combinatorial auctions with incomplete information. Specifically, what is the maximum profit that a complement-free (subadditive) bidder can guarantee in a multi-item combinatorial auction? Suppose there ...${\sqrt{{}_{\mathrm{}}}\sqrt{{}_{\mathrm{}}}}^{\mathrm{}}$$\frac{{{}_{\mathrm{}}{}_{\mathrm{}}}^{\mathrm{}}}{\mathrm{}{}_{\mathrm{}}}$

Consider the revenue maximization problem of a risk-neutral seller with m heterogeneous items for sale to a single additive buyer, whose values for the items are drawn from known distributions. If the buyer is also risk-neutral, it is known that a ...

We study the problem of finding maximum weakly stable matchings when preference lists are incomplete and contain one-sided ties of bounded length. We show that if the tie length is at most L, then it is possible to achieve an approximation ratio ...$\mathrm{}{\mathrm{}\frac{\mathrm{}}{}}^{}$$\frac{\mathrm{}}{\mathrm{}}$

We study the three-dimensional stable matching problem with cyclic preferences. This model involves three types of agents, with an equal number of agents of each type. The types form a cyclic order such that each agent has a complete preference ...

Obvious strategyproofness (OSP) has recently emerged as the solution concept of interest to study incentive compatibility in presence of agents with a specific form of bounded rationality, i.e., those who have no contingent reasoning skill ...

Impartial selection has recently received much attention within the multi-agent systems community. The task is, given a directed graph representing nominations to the members of a community by other members, to select a member with the highest ...$\mathit{}\sqrt{}$$\mathit{}{}^{\mathrm{}\mathrm{}}{}^{\mathrm{}\mathrm{}}$$\mathit{}\sqrt{}$