English
Related papers

Related papers: Increasing Ticketing Allocative Efficiency Using M…

200 papers

Transit agencies have the opportunity to outsource certain services to established Mobility-on-Demand (MOD) providers. Such alliances can improve service quality, coverage, and ridership; reduce public sector costs and vehicular emissions;…

Optimization and Control · Mathematics 2024-03-19 Kayla Cummings , Vikrant Vaze , Özlem Ergun , Cynthia Barnhart

We study multi-unit auctions in which bidders have limited knowledge of opponent strategies and values. We characterize optimal prior-free bids; these bids minimize the maximal loss in expected utility resulting from uncertainty surrounding…

Theoretical Economics · Economics 2023-05-02 Bernhard Kasberger , Kyle Woodward

A single unit of a good is sold to one of two bidders. Each bidder has either a high prior valuation or a low prior valuation for the good. Their prior valuations are independently and identically distributed. Each bidder may observe an…

Theoretical Economics · Economics 2022-05-10 Wanchang Zhang

Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute actions in stochastic environments, modeled as Markov decision…

Multiagent Systems · Computer Science 2011-10-13 D. A. Dolgov , E. H. Durfee

The ad-trading desks of media-buying agencies are increasingly relying on complex algorithms for purchasing advertising inventory. In particular, Real-Time Bidding (RTB) algorithms respond to many auctions -- usually Vickrey auctions --…

Optimization and Control · Mathematics 2016-06-20 Joaquin Fernandez-Tapia , Olivier Guéant , Jean-Michel Lasry

We address the challenging problem of dynamically pricing complementary items that are sequentially displayed to customers. An illustrative example is the online sale of flight tickets, where customers navigate through multiple web pages.…

High-frequency trading, in both traditional and decentralized markets, induces latency races and redundant order flow as traders spend resources to win time-sensitive opportunities. We show that auctioning artificial time priority can…

Computer Science and Game Theory · Computer Science 2026-02-17 Agostino Capponi , Brian Zhu

When resources are scarce, an allocation policy is needed to decide who receives a resource. This problem occurs, for instance, when allocating scarce medical resources and is often solved using modern ML methods. This paper introduces…

Machine Learning · Computer Science 2024-02-20 Niclas Boehmer , Yash Nair , Sanket Shah , Lucas Janson , Aparna Taneja , Milind Tambe

This paper presents karma mechanisms, a novel approach to the repeated allocation of a scarce resource among competing agents over an infinite time. Examples include deciding which ride hailing trip requests to serve during peak demand,…

Theoretical Economics · Economics 2023-05-09 Ezzat Elokda , Saverio Bolognani , Andrea Censi , Florian Dörfler , Emilio Frazzoli

In this paper, we consider the problem of optimizing the revenue a web publisher gets through real-time bidding (i.e. from ads sold in real-time auctions) and direct (i.e. from ads sold through contracts agreed in advance). We consider a…

Computer Science and Game Theory · Computer Science 2020-06-15 Grégoire Jauvion , Nicolas Grislain

Ranking alternatives is a natural way for humans to explain their preferences. It is being used in many settings, such as school choice, course allocations and residency matches. In some cases, several `items' are given to each participant.…

Computer Science and Game Theory · Computer Science 2022-12-06 Erel Segal-Halevi , Haris Aziz , Avinatan Hassidim

This paper introduces and develops the concept of ``ticketing'', through which atomic broadcasts are orchestrated by nodes in a distributed system. The paper studies different ticketing regimes that allow parallelism, yet prevent slow nodes…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-07-02 Peiyao Sheng , Chenyuan Wu , Dahlia Malkhi , Michael K. Reiter , Chrysoula Stathakopoulou , Michael Wei , Maofan Yin

Consider a population of customers each of which needs to decide independently when to arrive to a facility that provides a service during a fixed period of time, say a day. This is a common scenario in many service systems such as a bank,…

Computer Science and Game Theory · Computer Science 2021-07-27 Moshe Haviv , Liron Ravner

We study the efficiency of mechanisms for allocating a divisible resource. Given scalar signals submitted by all users, such a mechanism decides the fraction of the resource that each user will receive and a payment that will be collected…

Computer Science and Game Theory · Computer Science 2020-02-21 Ioannis Caragiannis , Alexandros A. Voudouris

The performance of multimodal mobility systems relies on the seamless integration of conventional mass transit services and the advent of Mobility-on-Demand (MoD) services. Prior work is limited to individually improving various transport…

Computational Engineering, Finance, and Science · Computer Science 2021-05-24 Qi Luo , Samitha Samaranayake , Siddhartha Banerjee

Auction theories are believed to provide a better selling opportunity for the resources to be allocated. Various organizations have taken measures to increase trust among participants towards their auction system, but trust alone cannot…

Theoretical Economics · Economics 2021-02-09 Ravin Kumar

Event ticket price prediction is important to marketing strategy for any sports team or musical ensemble. An accurate prediction model can help the marketing team to make promotion plan more effectively and efficiently. However, given all…

Machine Learning · Computer Science 2019-12-06 Fei Huang , Hao Huang

Group-buying ads seeking a minimum number of customers before the deal expiry are increasingly used by the daily-deal providers. Unlike the traditional web ads, the advertiser's profits for group-buying ads depends on the time to expiry and…

Computer Science and Game Theory · Computer Science 2012-06-05 Raju Balakrishnan , Rushi P Bhatt

It is often beneficial for agents to pool their resources in order to better accommodate fluctuations in individual demand. Many multi-round resource allocation mechanisms operate in an online manner: in each round, the agents specify their…

Computer Science and Game Theory · Computer Science 2022-08-02 Fu Li , C. Gregory Plaxton , Vaibhav B. Sinha

We study the efficiency of sequential first-price item auctions at (subgame perfect) equilibrium. This auction format has recently attracted much attention, with previous work establishing positive results for unit-demand valuations and…

Computer Science and Game Theory · Computer Science 2013-09-11 Michal Feldman , Brendan Lucier , Vasilis Syrgkanis
‹ Prev 1 8 9 10 Next ›