activity
20132024
most citedOn Gradient-Based Learning in Continuous Games

78 citations · 333 across the 57 of their papers we have counts for

collaborators
Showing math.OCShow all

11 papers · 1 filter

math.OC2022★ 2 cited

Decision-Dependent Risk Minimization in Geometrically Decaying Dynamic Environments

Mitas Ray, Dmitriy Drusvyatskiy, Maryam Fazel +1

This paper studies the problem of expected loss minimization given a data distribution that is dependent on the decision-maker's action and evolves dynamically in time according to…

math.OC2021

Zeroth-Order Methods for Convex-Concave Minmax Problems: Applications to Decision-Dependent Risk Minimization

Chinmay Maheshwari, Chih-Yuan Chiu, Eric Mazumdar +2

Min-max optimization is emerging as a key framework for analyzing problems of robustness to strategically and adversarially generated data. We propose a random reshuffling-based gr…

math.OC2020

Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs

Mitas Ray, Omid Sadeghi, Lillian J. Ratliff +1

We study the problem of online resource allocation, where multiple customers arrive sequentially and the seller must irrevocably allocate resources to each incoming customer while…

math.OC2019★ 5 cited

Convergence Analysis of Gradient-Based Learning with Non-Uniform Learning Rates in Non-Cooperative Multi-Agent Settings

Benjamin Chasnov, Lillian J. Ratliff, Eric Mazumdar +1

Considering a class of gradient-based multi-agent learning algorithms in non-cooperative settings, we provide local convergence guarantees to a neighborhood of a stable local Nash…

math.OC2019

Incentive Design for Temporal Logic Objectives

Yagiz Savas, Vijay Gupta, Melkior Ornik +2

We study the problem of designing an optimal sequence of incentives that a principal should offer to an agent so that the agent's optimal behavior under the incentives realizes the…

math.OC2019

Variable Demand and Multi-commodity Flow in Markovian Network Equilibrium

Yue Yu, Dan Calderone, Sarah H. Q. Li +2

Markovian network equilibrium generalizes the classical Wardrop equilibrium in network games. At a Markovian network equilibrium, each player of the game solves a Markov decision p…

math.OC2017★ 4 cited

Optimizing Curbside Parking Resources Subject to Congestion Constraints

Chase Dowling, Tanner Fiez, Lillian Ratliff +1

To gain theoretical insight into the relationship between parking scarcity and congestion, we describe block-faces of curbside parking as a network of queues. Due to the nature of…

math.OC2014

On the Characterization of Local Nash Equilibria in Continuous Games

Lillian J. Ratliff, Samuel A. Burden, S. Shankar Sastry

We present a unified framework for characterizing local Nash equilibria in continuous games on either infinite-dimensional or finite-dimensional non-convex strategy spaces. We prov…

math.OC2014★ 6 cited

Effects of Risk on Privacy Contracts for Demand-Side Management

Lillian J. Ratliff, Carlos Barreto, Roy Dong +3

As smart meters continue to be deployed around the world collecting unprecedented levels of fine-grained data about consumers, we need to find mechanisms that are fair to both, (1)…

math.OC2014★ 10 cited

Social Game for Building Energy Efficiency: Utility Learning, Simulation, and Analysis

Ioannis C. Konstantakopoulos, Lillian J. Ratliff, Ming Jin +2

We describe a social game that we designed for encouraging energy efficient behavior amongst building occupants with the aim of reducing overall energy consumption in the building.…

math.OC2014★ 2 cited

Privacy and Customer Segmentation in the Smart Grid

Lillian J. Ratliff, Roy Dong, Henrik Ohlsson +2

In the electricity grid, networked sensors which record and transmit increasingly high-granularity data are being deployed. In such a setting, privacy concerns are a natural consid…