English
Related papers

Related papers: Extractive contest design

200 papers

We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with $\omega$-regular objectives. While the existence of an equilibrium whose payoff falls into a certain interval may be undecidable, we…

Computer Science and Game Theory · Computer Science 2010-06-24 Michael Ummels , Dominik Wojtczak

We study a participatory budgeting problem of aggregating the preferences of agents and dividing a budget over the projects. A budget division solution is a probability distribution over the projects. The main purpose of our study concerns…

Computer Science and Game Theory · Computer Science 2020-11-02 Zhongzheng Tang , Chenhao Wang , Mengqi Zhang

When utilities are additive, we uncovered in our previous paper (Bogomolnaia et al. "Dividing Goods or Bads under Additive Utilities") many similarities but also surprising differences in the behavior of the familiar Competitive rule (with…

Computer Science and Game Theory · Computer Science 2016-10-13 Anna Bogomolnaia , Herve Moulin , Fedor Sandomirskiy , Elena Yanovskaya

Priority-based allocation of individuals to positions are pervasive, and elimination of justified envy is often, an absolute requirement. This leaves serial dictatorship (SD) as the only rule that avoids justified envy under standard direct…

Theoretical Economics · Economics 2026-05-22 Inácio Bó , Gian Caspari , Manshu Khanna

Allocating resources to individuals in a fair manner has been a topic of interest since the ancient times, with most of the early rigorous mathematical work on the problem focusing on infinitely divisible resources. Recently, there has been…

Computer Science and Game Theory · Computer Science 2022-03-07 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

In this note, we prove the existence of an equilibrium concept, dubbed conditional strategy equilibrium, for non-cooperative games in which a strategy of a player is a function from the other players' actions to her own actions. We study…

Theoretical Economics · Economics 2022-05-09 Lorenzo Bastianello , Mehmet S. Ismail

Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial…

Computer Science and Game Theory · Computer Science 2014-01-17 Lirong Xia , Vincent Conitzer

To select a subset of samples or "winners" from a population of candidates, order sampling [Rosen 1997] and the k-unit Myerson auction [Myerson 1981] share a common scheme: assign a (random) score to each candidate, then select the k…

Computer Science and Game Theory · Computer Science 2018-11-29 Shaddin Dughmi , David Kempe , Ruixin Qiang

This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…

Optimization and Control · Mathematics 2016-05-17 Monica Patriche

This paper investigates applicability of thermodynamic concepts and principles to competitive systems. We show that Tsallis entropies are suitable for characterisation of systems with transitive competition when mutations deviate from Gibbs…

Adaptation and Self-Organizing Systems · Physics 2014-03-10 A. Y. Klimenko

The full abstraction result for PCF using game semantics requires one to identify all innocent strategies that are innocently indistinguishable. This involves a quantification over all innocent tests, cf. quantification over all innocent…

Logic in Computer Science · Computer Science 2010-03-02 Martin Churchill , James Laird , Guy McCusker

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron

We characterize methods of dividing a cake between two bidders in a way that is incentive-compatible and Pareto-efficient. In our cake cutting model, each bidder desires a subset of the cake (with a uniform value over this subset), and is…

Computer Science and Game Theory · Computer Science 2012-10-02 Avishay Maya , Noam Nisan

This paper gives a constructive treatment of McKenzie's theorem on the existence of general equilibria. While the full theorem does not admit a constructive proof, and hence does not admit a computational realisation, we show that if we…

Logic · Mathematics 2016-11-09 Matthew Hendtlass , Nazar Miheisi

An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…

Computer Science and Game Theory · Computer Science 2013-08-01 Leslie Ann Goldberg , Paul W. Goldberg , Piotr Krysta , Carmine Ventre

Existence of an increasing quasi-concave value function consistent with given preference information is an important issue in various fields including Economics, Multiple Criteria Decision Making, and Applied Mathematics. In this paper, we…

Optimization and Control · Mathematics 2019-09-19 Majid Soleimani-damaneh , Latif Pourkarimi , Pekka J. Korhonen , Jyrki Wallenius

We study the fundamental problem of fairly dividing a set of indivisible goods among agents with additive valuations. Here, envy-freeness up to any good (EFX) is a central fairness notion and resolving its existence is regarded as one of…

Computer Science and Game Theory · Computer Science 2026-02-13 Hannaneh Akrami , Ryoga Mahara , Kurt Mehlhorn , Nidhi Rathi

We study the computational complexity of fairly allocating a set of indivisible items under externalities. In this recently-proposed setting, in addition to the utility the agent gets from their bundle, they also receive utility from items…

Computer Science and Game Theory · Computer Science 2024-04-16 Argyrios Deligkas , Eduard Eiben , Viktoriia Korchemna , Šimon Schierreich

Recent results, establishing evidence of intractability for such restrictive utility functions as additively separable, piecewise-linear and concave, under both Fisher and Arrow-Debreu market models, have prompted the question of whether we…

Computer Science and Game Theory · Computer Science 2010-10-21 Vijay V. Vazirani

The valuation process that economic agents undergo for investments with uncertain payoff typically depends on their statistical views on possible future outcomes, their attitudes toward risk, and, of course, the payoff structure itself.…

Pricing of Securities · Quantitative Finance 2010-01-11 Constantinos Kardaras