We study the design of revenue-maximizing mechanisms for selling nonexcludable public goods. In particular, we study revenue-maximizing mechanisms in Bayesian settings for facility location problems on graphs where no agent can be excluded from using a facility that has been constructed. We show that the pointwise optimization problem involved in... (more)
We consider the problem of designing incentive-compatible, ex-post individually rational (IR) mechanisms for covering problems in the Bayesian... (more)
In this work, we investigate the reasons that make symmetric partial verification essentially useless in virtually all domains. Departing from... (more)
Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical... (more)
We study lower bounds on the query complexity of determining correlated equilibrium. In particular, we consider a query model in which an n-player game is specified via a black box that returns players' utilities at pure action profiles. In this model, we establish that in order to compute a correlated equilibrium, any deterministic algorithm must... (more)
The cake-cutting setting, in which a single heterogeneous good must be divided between multiple parties with different tastes, is a classic model for... (more)
In this article, we study the design and characterization of sequential prediction mechanisms in the presence of agents with unknown risk aversion. We... (more)
We study the design of service exchange platforms in which long-lived anonymous users exchange services with each other. The users are randomly and... (more)
We consider the domain of selfish and continuous preferences over a “rich” allocation space and show that onto, strategyproof and... (more)
The ACM Transactions on Economics and Computation (TEAC) is a journal focusing on the intersection of computer science and economics. Of interest to the journal is any topic relevant to both economists and computer scientists, including but not limited to the following: algorithmic game theory, mechanism design, design and analysis of electronic markets, computation of equilibria, cost of strategic behavior and cost of decentralization, learning in games and markets, systems resilient against malicious agents, economics of computational advertising, paid search auctions, agents in networks, electronic commerce, computational social choice, recommendation/reputation/trust systems, and privacy.
ACM introduces a new publishing license agreement, an updated copyright transfer agreement, and a new author-pays option which allows for perpetual open access through the ACM Digital Library. For more information, visit the ACM Author Rights webpage.