English
Related papers

Related papers: Restricting Entries to All-Pay Contests

200 papers

Consider a two-player game repeated N times. Player 1 can choose between two styles (for interpretability, offensive and defensive), whereas Player 2 uses a single fixed style. Let X N\,:= \#wins -\#losses for Player 1 after N games, and…

Computer Science and Game Theory · Computer Science 2026-04-20 Jonatha ANSELMI , Bruno Gaujal

Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…

Computer Science and Game Theory · Computer Science 2010-04-30 Pierre Lescanne , Perrinel Matthieu

Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…

Computer Science and Game Theory · Computer Science 2011-12-16 Pierre Lescanne , Perrinel Matthieu

In this paper, we present the first approximation algorithms for the problem of designing revenue optimal Bayesian incentive compatible auctions when there are multiple (heterogeneous) items and when bidders can have arbitrary demand and…

Computer Science and Game Theory · Computer Science 2010-03-30 Sayan Bhattacharya , Gagan Goel , Sreenivas Gollapudi , Kamesh Munagala

Evolution of agents' dynamics of multiagent systems under consensus protocol in the face of jamming attacks is discussed, where centralized parties are able to influence the control signals of the agents. In this paper we focus on a…

Systems and Control · Electrical Eng. & Systems 2023-03-14 Yurid Nugraha , Tomohisa Hayakawa , Hideaki Ishii , Ahmet Cetinkaya , Quanyan Zhu

We address the problem of how cooperative (altruistic-like) behavior arises in natural and social systems by analyzing an ultimatum game in complex networks. Specifically, three types of players are considered: (a) empathetic, whose…

Physics and Society · Physics 2009-12-18 Roberta Sinatra , Jaime Iranzo , Jesús Gómez-Gardeñes , Luis M. Floría , Vito Latora , Yamir Moreno

We study repeated games played by players with bounded computational power, where, in contrast to Abreu and Rubisntein (1988), the memory is costly. We prove a folk theorem: the limit set of equilibrium payoffs in mixed strategies, as the…

Probability · Mathematics 2010-08-17 Penelope Hernandez , Eilon Solan

We construct several definitions of imbalance and playability, both of which are related to the existence of dominated strategies. Specifically, a maximally balanced game and a playable game cannot have dominated strategies for any player.…

General Economics · Economics 2025-11-07 Itai Maimon

Institutions and investors face the constant challenge of making accurate decisions and predictions regarding how best they should distribute their endowments. The problem of achieving an optimal outcome at minimal cost has been extensively…

Multiagent Systems · Computer Science 2021-02-09 Theodor Cimpeanu , Cedric Perret , The Anh Han

I study sequential contests where the efforts of earlier players may be disclosed to later players by nature or by design. The model has a range of applications, including rent seeking, R&D, oligopoly, public goods provision, and tragedy of…

Computer Science and Game Theory · Computer Science 2021-02-22 Toomas Hinnosaar

Rating systems play an important role in competitive sports and games. They provide a measure of player skill, which incentivizes competitive performances and enables balanced match-ups. In this paper, we present a novel Bayesian rating…

Information Retrieval · Computer Science 2021-01-05 Aram Ebtekar , Paul Liu

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…

Computer Science and Game Theory · Computer Science 2017-03-01 Haris Aziz , Simina Brânzei , Aris Filos-Ratsikas , Søren Kristoffer Stiil Frederiksen

While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the properties that optimal solutions need to have, and devised a…

Data Structures and Algorithms · Computer Science 2026-03-11 Daniele Dell'Erba , Arthur Dumas , Sven Schewe

Motivated by school admissions, this paper studies screening in a population with both advantaged and disadvantaged agents. A school is interested in admitting the most skilled students, but relies on imperfect test scores that reflect both…

Computer Science and Game Theory · Computer Science 2023-05-30 Hedyeh Beyhaghi , Modibo K. Camara , Jason Hartline , Aleck Johnsen , Sheng Long

This paper studies allocation mechanisms in max-flow games with players' capacities as private information. We first show that no core-selection mechanism is truthful: there may exist a player whose payoff increases if she under-reports her…

Computer Science and Game Theory · Computer Science 2025-02-13 Shengyuan Huang , Wenjun Mei , Xiaoguang Yang , Zhigang Cao

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…

Computer Science and Game Theory · Computer Science 2017-04-04 Valerio Capraro , Marco Scarsini

A double auction game with an infinite number of buyers and sellers is introduced. All sellers posses one unit of a good, all buyers desire to buy one unit. Each seller and each buyer has a private valuation of the good. The distribution of…

Computer Science and Game Theory · Computer Science 2012-10-23 Matthijs Ruijgrok

This paper studies the equilibrium properties of the ``obvious strategy profile'' in large finite-player games. Each player in such a strategy profile simply adopts a randomized strategy as she would have used in a symmetric equilibrium of…

Theoretical Economics · Economics 2025-08-20 Enxian Chen Bin Wu Hanping Xu

We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound…

Logic in Computer Science · Computer Science 2017-01-16 Patricia Bouyer , Piotr Hofman , Nicolas Markey , Mickael Randour , Martin Zimmermann

In common-interest stochastic games all players receive an identical payoff. Players participating in such games must learn to coordinate with each other in order to receive the highest-possible value. A number of reinforcement learning…

Artificial Intelligence · Computer Science 2011-06-28 R. I. Brafman , M. Tennenholtz
‹ Prev 1 8 9 10 Next ›