相关论文: Equilibria of Chinese Auctions

We introduce a game model called "customer attraction game" to demonstrate the competition among online content providers. In this model, customers exhibit interest in various topics. Each content provider selects one topic and benefits…

Game contingent claims (GCCs) generalize American contingent claims by allowing the writer to recall the option as long as it is not exercised, at the price of paying some penalty. In incomplete markets, an appealing approach is to analyze…

Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…

We study equilibria in two-buyer sequential second-price (or first-price) auctions for identical goods. Buyers have weakly decreasing incremental values, and we make a behavioural no-overbidding assumption: the buyers do not bid above their…

In this paper, we investigate the multiplayer General Lotto game across multiple battlefields, a significant variant of the Colonel Blotto game. In this version, each player employs a probability distribution for resource allocation,…

In this paper, Nash equilibrium seeking among a network of players is considered. Different from many existing works on Nash equilibrium seeking in non-cooperative games, the players considered in this paper cannot directly observe the…

This paper investigates online stochastic aggregative games subject to local set constraints and time-varying coupled inequality constraints, where each player possesses a time-varying expectation-valued cost function relying on not only…

Budget constraints are ubiquitous in online advertisement auctions. To manage these constraints and smooth out the expenditure across auctions, the bidders (or the platform on behalf of them) often employ pacing: each bidder is assigned a…

We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\mathcal{Y}$, the $n$ players each choose a position in a space $\mathcal{X}$. A player's utility…

Motivated by sponsored search auctions, we study multi-unit auctions with budget constraints. In the mechanism we propose, Sort-Cut, understating budgets or values is weakly dominated. Since Sort-Cut's revenue is increasing in budgets and…

We consider a contest game modelling a contest where reviews for $m$ proposals are crowdsourced from $n$ strategic agents} players. Player $i$ has a skill $s_{i\ell}$ for reviewing proposal $\ell$; for her review, she strategically chooses…

In this work, we present a novel characterization of approximate Nash equilibria in a class of convex games over the simplex. To achieve this, we regularize the utility functions using the Shannon entropy term, connect the solutions to the…

Probabilistic model checking for stochastic games enables formal verification of systems that comprise competing or collaborating entities operating in a stochastic environment. Despite good progress in the area, existing approaches focus…

This study explores the performance of auctions in China's seasoned equity offering (SEO) market, both theoretically and empirically. In these auctions, issuers must commit to a pre-announced revenue target and a maximum number of shares…

Proportional dynamics, originated from peer-to-peer file sharing systems, models a decentralized price-learning process in Fisher markets. Previously, items in the dynamics operate independently of one another, and each is assumed to belong…

Voters making a binary decision purchase votes from a centralized clearing house, paying the square of the number of votes purchased. The net payoff to an agent with utility $u$ who purchases $v$ votes is $\Psi (S_{n+1})u-v^{2}$, where…

The Nash equilibrium problem is a widely used tool to model non-cooperative games. Many solution methods have been proposed in the literature to compute solutions of Nash equilibrium problems with continuous strategy sets, but, besides some…

We study $k$-price auctions in a complete information environment and characterize all pure-strategy Nash equilibrium outcomes. In a setting with $n$ agents having ordered valuations, we show that any agent, except those with the lowest…

Observable games are game situations that reach one of possibly many Nash equilibria. Before an instance of the game starts, an external observer does not know, a priori, what is the exact profile of actions that will occur; thus, he…

In resource contribution games, a class of non-cooperative games, the players want to obtain a bundle of resources and are endowed with bags of bundles of resources that they can make available into a common for all to enjoy. Available…