10 Result(s)
-
Chapter and Conference Paper
Efficient Privacy-Preserving Protocols for Multi-unit Auctions
The purpose of multi-unit auctions is to allocate identical units of a single type of good to multiple agents. Besides well-known applications like the selling of treasury bills, electrical power, or spectrum ...
-
Chapter and Conference Paper
On Correctness and Privacy in Distributed Mechanisms
Mechanisms that aggregate the possibly conflicting preferences of individual agents are studied extensively in economics, operations research, and lately computer science. Perhaps surprisingly, the classic lit...
-
Chapter and Conference Paper
PageRank as a Weak Tournament Solution
We observe that ranking systems—a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz—and tournament solutions—a well-studied area of social choice theor...
-
Chapter and Conference Paper
On the Hardness and Existence of Quasi-Strict Equilibria
This paper investigates the computational properties of quasi-strict equilibrium, an attractive equilibrium refinement proposed by Harsanyi, which was recently shown to always exist in bimatrix games. We prove...
-
Chapter and Conference Paper
Equilibria of Graphical Games with Symmetries
We study graphical games where the payoff function of each player satisfies one of four types of symmetry in the actions of his neighbors. We establish that deciding the existence of a pure Nash equilibrium is...
-
Chapter and Conference Paper
The Computational Complexity of Weak Saddles
We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a polynomial-time algorithm for computing w...
-
Chapter and Conference Paper
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and sometimes strictly better. We investigate the...
-
Chapter and Conference Paper
On the Rate of Convergence of Fictitious Play
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the empirical frequencies of act...
-
Chapter and Conference Paper
Pareto Optimality in Coalition Formation
A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a far-reaching structural connection between Pareto optimal and perfect partitions that ha...
-
Chapter and Conference Paper
On Popular Random Assignments
One of the most fundamental and ubiquitous problems in microeconomics and operations research is how to assign objects to agents based on their individual preferences. An assignment is called popular if there ...
