Sponsored search, market equilibria, and the Hungarian Method

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Traditional competitive markets do not account for negative externalities; indirect costs that some participants impose on others, such as the cost of over-appropriating a common-pool resource (which diminishes future stock, and thus harvest, for everyone) ...

We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the markets and lin ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

Many transportation markets are characterized by oligopolistic competition. In these markets customers, suppliers and regulators make decisions that are influenced by the preferences and the decisions of all other agents. In particular, capturing and under ...

We study a canonical model of decentralized exchange for a durable good or asset, where agents are assumed to have time-varying, heterogeneous utility types. Whereas the existing literature has focused on the special case of two types, we allow agents' uti ...

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

A plethora of real world problems consist of a number of agents that interact, learn, cooperate, coordinate, and compete with others in ever more complex environments. Examples include autonomous vehicles, robotic agents, intelligent infrastructure, IoT de ...

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

This thesis consists of three chapters on informational frictions in financial markets. The chapters analyze problems related to markets' ability to guide real investment, and what drives liquidity. Both problems are important to ensure efficient resource ...

Oligopolistic competition occurs in various transportation markets. In this paper, we introduce a framework to find approximate equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models ...

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial algorithm, ...

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

We propose a framework to find optimal price-based policies to regulate markets characterized by oligopolistic competition and in which consumers make a discrete choice among a finite set of alternatives. The framework accommodates general discrete choice ...

This paper considers vessel scheduling with pilotage and tugging constraints in berthing operations with channel restrictions at seaports. To our knowledge, pilotage and tugging requirements have not been simultaneously considered in the literature. This w ...

This thesis examines how banks choose their optimal capital structure and cash reserves in the presence of regulatory measures. The first chapter, titled Bank Capital Structure and Tail Risk, presents a bank capital structure model in which bank assets ...

In the restricted Santa Claus problem we are given resources R and players P. Every resource j is an element of R. has a value v(j) and every player i is an element of P desires a set of resources R(i). We are interested in distributing the resources to pl ...

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

We use the database leak of Mt. Gox exchange to analyze the dynamics of the price of bitcoin from June 2011 to November 2013. This gives us a rare opportunity to study an emerging retail-focused, highly speculative and unregulated market with trader identi ...

Sponsored search, market equilibria, and the Hungarian Method

Chat with Graph Search

AI-driven Prices for Externalities and Sustainability in Production Markets

Equilibria in Network Constrained Energy Markets

Approximation Algorithms for Allocation and Network Design

Optimization and equilibrium problems with discrete choice models

Heterogeneity in decentralized asset markets

Discrete Optimal Transport with Independent Marginals is #P-Hard

Streaming and Matching Problems with Submodular Functions

Scalable Multi-agent Coordination and Resource Sharing

Motif Cut Sparsifiers

Informational frictions in financial markets

A Simulation-Based Heuristic to Find Approximate Equilibria with Disaggregate Demand Models

Automating cutting planes is NP-hard

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Bayesian Decision Making in Groups is Hard

Price-based regulation of oligopolistic markets under discrete choice models of demand

Vessel scheduling with pilotage and tugging considerations

Essays in Banking and Financial Regulation

A note on the integrality gap of the configuration LP for restricted Santa Claus

New Results in Integer and Lattice Programming

High-Frequency Jump Analysis of the Bitcoin Market