We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
Subhash Khot, Richard J. Lipton, Evangelos Markaki...
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
Abstract. A policy is a statement that an action is permitted or forbidden if certain conditions hold. We introduce a language for reasoning about policies called Rosetta. What mak...