In this paper we provide a novel and simple algorithm, Clairvoyant Multiplicative Weights Updates (CMWU), for convergence to \textit{Coarse Correlated Equilibria} (CCE) in general games. CMWU effectively corresponds to the standard MWU algorithm but where ...
Oligopolistic competition occurs often in transportation as well as in other markets due to reasons such as barriers to entry, limited capacity of the infrastructure and external regulations. In transport oligopolies, suppliers are profit maximizers and ta ...
We propose a method to design a decentralized energy market which guarantees individual rationality (IR) in expectation, in the presence of system-level grid constraints. We formulate the market as a welfare maximization problem subject to IR constraints, ...
We revisit the problem of solving two-player zero- sum games in the decentralized setting. We pro- pose a simple algorithmic framework that simulta- neously achieves the best rates for honest regret as well as adversarial regret, and in addition resolves t ...
We consider a participatory sensing scenario where a group of private sensors observes the same phenomenon, such as air pollution. We design a novel payment mechanism that incentivizes participation and honest behavior using the peer prediction approach, i ...
We consider a participatory sensing scenario where a group of private sensors observes the same phenomenon, such as air pollution. Since sensors need to be installed and maintained, owners of sensors are inclined to provide inaccurate or random data. We de ...
We analyze symmetric protocols to rationally coordinate on an asymmetric, efficient allocation in an infinitely repeated N-agent, C-resource allocation problems, where the resources are all homogeneous. Bhaskar proposed one way to achieve this in 2-agent, ...
We study a problem where wireless service providers compete for heterogenous wireless users. The users differ in their utility functions as well as in the perceived quality of service of individual providers. We model the interaction of an arbitrary number ...
Real-time optimization (RTO) methods use measurements to offset the effect of uncertainty and drive the plant to optimality. Explicit RTO schemes, which are characterized by solving a static optimization problem repeatedly, typically require multiple itera ...
We analyze symmetric protocols to rationally coordinate on an asymmetric, efficient allocation in an infinitely repeated N-agent, C-resource allocation problems. (Bhaskar 2000) proposed one way to achieve this in 2-agent, 1-resource allocation games: Agent ...
