中文
相关论文

相关论文: The Pricing War Continues: On Competitive Multi-It…

200 篇论文

In a multi-unit market, a seller brings multiple units of a good and tries to sell them to a set of buyers that have monetary endowments. While a Walrasian equilibrium does not always exist in this model, natural relaxations of the concept…

计算机科学与博弈论 · 计算机科学 2018-09-28 Simina Brânzei , Aris Filos-Ratsikas

Standard bin packing is the problem of partitioning a set of items with positive sizes no larger than 1 into a minimum number of subsets (called bins) each having a total size of at most 1. In bin packing games, an item has a positive…

计算机科学与博弈论 · 计算机科学 2015-03-20 Gyorgy Dosa , Leah Epstein

Decentralized decision making in multi--product firms can lead to efficiency losses when autonomous decision makers fail to internalize cross--product demand interactions. This paper quantifies the magnitude of such losses by analyzing the…

计算机科学与博弈论 · 计算机科学 2026-01-27 Boxiao Chen , Jiashuo Jiang , Stefanus Jasin

We study a toy two-player game for periodic double auction markets to generate liquidity. The game has imperfect information, which allows us to link market spreads with signal strength. We characterize Nash equilibria in cases with or…

交易与市场微观结构 · 定量金融 2023-08-01 Joffrey Derchu , Dimitrios Kavvathas , Thibaut Mastrolia , Mathieu Rosenbaum

Chinese auctions are a combination between a raffle and an auction and are held in practice at charity events or festivals. In a Chinese auction, multiple players compete for several items by buying tickets, which can be used to win the…

计算机科学与博弈论 · 计算机科学 2012-09-04 Simina Brânzei , Clara Forero , Kate Larson , Peter Bro Miltersen

Game theory has emerged as a fruitful paradigm for the design of networked multiagent systems. A fundamental component of this approach is the design of agents' utility functions so that their self-interested maximization results in a…

计算机科学与博弈论 · 计算机科学 2020-03-12 Dario Paccagnan , Rahul Chandan , Jason R. Marden

We consider a stochastic tournament game in which each player is rewarded based on her rank in terms of the completion time of her own task and is subject to cost of effort. When players are homogeneous and the rewards are purely rank…

最优化与控制 · 数学 2018-11-02 Erhan Bayraktar , Jakša Cvitanić , Yuchong Zhang

This paper examines public goods and evaluates the mechanism through the game theory. Public goods are characterized by nonexclusivity and nonrivalry and this creates fundamental challenges for allocation. We analyze why competitive markets…

理论经济学 · 经济学 2025-11-20 Yash Prajapati

We study interactions with uncertainty about demand sensitivity. In our solution concept (1) firms choose seemingly-optimal strategies given the level of sophistication of their data analytics, and (2) the levels of sophistication form best…

理论经济学 · 经济学 2021-04-06 Ron Berman , Yuval Heller

We introduce the theoretical study of a Platform Equilibrium in a market with unit-demand buyers and unit-supply sellers. Each seller can join a platform and transact with any buyer or remain off-platform and transact with a subset of…

计算机科学与博弈论 · 计算机科学 2024-06-24 Alon Eden , Gary Qiurui Ma , David C. Parkes

We investigate Nash equilibrium learning in a competitive Markov Game (MG) environment, where multiple agents compete, and multiple Nash equilibria can exist. In particular, for an oligopolistic dynamic pricing environment, exact Nash…

计算机科学与博弈论 · 计算机科学 2024-03-05 Larkin Liu

Successful algorithms have been developed for computing Nash equilibrium in a variety of finite game classes. However, solving continuous games -- in which the pure strategy space is (potentially uncountably) infinite -- is far more…

计算机科学与博弈论 · 计算机科学 2021-06-02 Sam Ganzfried

In the problem of Submodular Max-Min Allocation, we are given a set of items, a set of players, and monotone submodular valuation functions that represent the satisfaction of a player with a certain subset of items. The goal is to find an…

数据结构与算法 · 计算机科学 2026-04-15 Kimon Boehmer

This work is concerned with the application of game theoretic principles to model competition between demand response aggregators for selling excess energy stored in electrochemical storage devices directly to other aggregators in a power…

系统与控制 · 计算机科学 2016-12-05 Mahdi Motalleb , Reza Ghorbani

We analyse the computational complexity of finding Nash equilibria in turn-based stochastic multiplayer games with omega-regular objectives. We show that restricting the search space to equilibria whose payoffs fall into a certain interval…

计算机科学与博弈论 · 计算机科学 2015-07-01 Michael Ummels , Dominik Wojtczak

We discuss and solve a model for a game with many players, where a subset of truely deciding players is embedded into a hierarchy of dependent agents. These interdependencies modify the game matrix and the Nash equilibria for the deciding…

计算机科学与博弈论 · 计算机科学 2015-04-16 Elisabeth Kraus , Simon D. Lentner

We consider polymatrix coordination games with individual preferences where every player corresponds to a node in a graph who plays with each neighbor a separate bimatrix game with non-negative symmetric payoffs. In this paper, we study…

计算机科学与博弈论 · 计算机科学 2015-04-29 Mona Rahn , Guido Schäfer

In this paper, I introduce a novel benchmark in games, super-Nash performance, and a solution concept, optimin, whereby players maximize their minimal payoff under unilateral profitable deviations by other players. Optimin achieves…

理论经济学 · 经济学 2025-10-23 Mehmet S. Ismail

In this paper we deal with linear production situations in which there is a limited common-pool resource, managed by an external agent. The profit that a producer, or a group of producers, can attain depends on the amount of common-pool…

最优化与控制 · 数学 2019-12-09 Elisabeth Gutierrez , Natividad Llorca , Joaquin Sanchez-Soriano , Manuel Mosquera

We consider a symmetric two-player contest, in which the choice set of effort is constrained. We apply a fundamental property of the payoff function to show that, under standard assumptions, there exists a unique Nash equilibrium in pure…

理论经济学 · 经济学 2020-09-15 Doron Klunover , John Morgan