中文
相关论文

相关论文: Exponential Weight Functions for Quasi-Proportiona…

200 篇论文

We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/$1$ queue. We formulate a non-cooperative game in which customers purchase priority coefficients with the goal of reducing waiting costs in…

计算机科学与博弈论 · 计算机科学 2017-04-12 Moshe Haviv , Liron Ravner

Sequential auctions for identical items with unit-demand, private-value buyers are common and often occur periodically without end, as new bidders replace departing ones. We model bidder uncertainty by introducing a probability that a…

计算机科学与博弈论 · 计算机科学 2025-10-13 Amir Ban

Several fairness concepts have been proposed recently in attempts to approximate envy-freeness in settings with indivisible goods. Among them, the concept of envy-freeness up to any item (EFX) is arguably the closest to envy-freeness.…

计算机科学与博弈论 · 计算机科学 2019-02-13 Ioannis Caragiannis , Nick Gravin , Xin Huang

This paper examines how risk and budget limits on investment mandates affect the bidding strategy in a uniform-price auction for issuing corporate bonds. I prove the existence of symmetric Bayesian Nash equilibrium and explore how the risk…

综合经济学 · 经济学 2023-06-13 Labrini Zarpala

Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling…

计算机科学与博弈论 · 计算机科学 2017-10-10 Simina Brânzei , Aris Filos-Ratsikas , Peter Bro Miltersen , Yulong Zeng

Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each bidder offers a price for some subset of the available…

计算工程、金融与科学 · 计算机科学 2007-05-23 Karhan Akcoglu , James Aspnes , Bhaskar DasGupta , Ming-Yang Kao

High-stakes auctions are often preceded by nonbinding communication between bidders and the seller. Motivated by these practices, this paper examines a two-period model in which two bidders send private cheap talk messages to the seller…

理论经济学 · 经济学 2026-03-19 Eric Yan

We consider price competition among multiple sellers over a selling horizon of $T$ periods. In each period, sellers simultaneously offer their prices (which are made public) and subsequently observe their respective demand (not made…

机器学习 · 统计学 2026-05-08 Daniele Bracale , Moulinath Banerjee , Cong Shi , Yuekai Sun

We use techniques from the statistical mechanics of disordered systems to analyse the properties of Nash equilibria of bimatrix games with large random payoff matrices. By means of an annealed bound, we calculate their number and analyse…

无序系统与神经网络 · 物理学 2009-10-31 Johannes Berg , Martin Weigt

We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. The extent of fairness of an allocation is measured by its Nash social welfare, which is the geometric mean of the valuations of the…

计算机科学与博弈论 · 计算机科学 2018-07-23 Siddharth Barman , Sanath Kumar Krishnamurthy , Rohit Vaish

This paper studies the use of a multi-attribute auction in a communication system to bring about efficient relaying in a non-cooperative setting. We consider a system where a source seeks to offload data to an access point (AP) while…

计算机科学与博弈论 · 计算机科学 2024-10-08 Winston Hurst , Yasamin Mostofi

The Adjusted Winner procedure is an important fair division mechanism proposed by Brams and Taylor for allocating goods between two parties. It has been used in practice for divorce settlements and analyzing political disputes. Assuming…

计算机科学与博弈论 · 计算机科学 2017-03-01 Haris Aziz , Simina Brânzei , Aris Filos-Ratsikas , Søren Kristoffer Stiil Frederiksen

We study the price competition in a duopoly with an arbitrary number of buyers. Each seller can offer multiple units of a commodity depending on the availability of the commodity which is random and may be different for different sellers.…

计算机科学与博弈论 · 计算机科学 2016-11-15 Mohammad Hassan Lotfi , Saswati Sarkar

Understanding the convergence landscape of multi-agent learning is a fundamental problem of great practical relevance in many applications of artificial intelligence and machine learning. While it is known that learning dynamics converge to…

计算机科学与博弈论 · 计算机科学 2025-03-21 Martin Bichler , Davide Legacci , Panayotis Mertikopoulos , Matthias Oberlechner , Bary Pradelski

We consider an example of stochastic games with partial, asymmetric and non-classical information. We obtain relevant equilibrium policies using a new approach which allows managing the belief updates in a structured manner. Agents have…

计算机科学与博弈论 · 计算机科学 2019-09-17 Veeraruna Kavitha , Mayank Maheshwari , Eitan Altman

We consider multi-agent decision making, where each agent optimizes its cost function subject to constraints. Agents' actions belong to a compact convex Euclidean space and the agents' cost functions are coupled. We propose a distributed…

最优化与控制 · 数学 2016-12-01 Tatiana Tatarenko , Maryam Kamgarpour

We introduce a class of Bayesian bidding games for which we prove that the set of pure Nash equilibria is a (non-empty) sublattice and we give a sufficient condition for uniqueness that is often verified in the context of markets with…

计算机科学与博弈论 · 计算机科学 2023-10-06 Benjamin Heymann , Alejandro Jofré

Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. However, expressing one's preferences can require bidding on all…

计算机科学与博弈论 · 计算机科学 2007-05-23 Benoit Hudson , Tuomas Sandholm

The existence of a (partial) market equilibrium price is proved in a complete, continuous time finite-agent market setting. The economic agents act as price takers in a fully competitive setting and maximize exponential utility from…

数理金融 · 定量金融 2022-12-01 Alessandro Prosperi

We consider the problem of the optimization of bidding strategies in prior-dependent revenue-maximizing auctions, when the seller fixes the reserve prices based on the bid distributions. Our study is done in the setting where one bidder is…

计算机科学与博弈论 · 计算机科学 2019-05-15 Thomas Nedelec , Noureddine El Karoui , Vianney Perchet