Filters








28,664 Hits in 6.4 sec

Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces [chapter]

Tobias Harks, Max Klimm
2011 Lecture Notes in Computer Science  
In this paper, we introduce a class of games which we term demand allocation games that combines the characteristics of finite games such as congestion games and continuous games such as Cournot oligopolies  ...  In a strategy profile each player may choose both an action out of a finite set and a non-negative demand out of a convex and compact interval.  ...  For systems having the above described characteristics, a new model is needed that integrates continuous and discrete action spaces.  ... 
doi:10.1007/978-3-642-25510-6_17 fatcat:m3hvjdaizzaezomtdbzggitfpi

Allocation under Uncertainty when the Demand has Continuous D.F

Salah E. Elmaghraby
1960 Management science  
For example, although we have demonstrated that there is a difference between the allocation under continuous demand (as treated by us) and the allocation assuming discrete demand df.  ...  distributed ($900,200 for fixed demand, $1,524,000 for discretely distributed demand, and $1,703,563 for continuously distributed demand—all demands with approximately equal expected values.)  ... 
doi:10.1287/mnsc.6.3.270 fatcat:af5myih2endzpayv3be4ufh5uq

Satisfying demands in a multicellular network: A universal power allocation algorithm

Veeraruna Kavitha, Sreenath Ramanath, Merouane Debbah
2013 Computer Communications  
We formulate the power allocation problem in a system specific game theoretic setting, define system specific capacity region and analyze the proposed algorithm using ordinary differential equation (ODE  ...  Further, it requires minimal information to achieve this: every base station needs to know its own users demands, its total power constraint and the transmission rates allocated to its users in every time  ...  The ideal rates are point wise continuous and are bounded and hence by bounded convergence theorem satisfy the continuous assumption A.4.  ... 
doi:10.1016/j.comcom.2012.04.009 fatcat:sfk5wzmjuvgg5jvwfy3nj6pjqa

Satisfying demands in a multicellular network: A universal power allocation algorithm

Sreenath Ramanath, Veeraruna Kavitha, Merouane Debbah
2011 2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks  
We formulate the power allocation problem in a system specific game theoretic setting, define system specific capacity region and analyze the proposed algorithm using ordinary differential equation (ODE  ...  Further, it requires minimal information to achieve this: every base station needs to know its own users demands, its total power constraint and the transmission rates allocated to its users in every time  ...  The ideal rates are point wise continuous and are bounded and hence by bounded convergence theorem satisfy the continuous assumption A.4.  ... 
doi:10.1109/wiopt.2011.5930011 dblp:conf/wiopt/RamanathKD11 fatcat:eb2xtwtxkja3bnjbni5zutvuqy

Dynamic traffic resources allocation under elastic demand of users with space-time prism constraints [article]

Keiichiro Hayakawa, Eiji Hato
2018 arXiv   pre-print
Under the setting with such elastic demand, we characterize a class of dynamic traffic resources allocation mechanisms that strictly keep space-time prism constraints of users and capacity constraints  ...  We present a conceptual framework for the dynamic traffic resources allocation problem in a situation of elastic demand among customers.  ...  Conclusions and discussions In this study, we addressed dynamic traffic resource allocation problems with strict capacity constraints and elastic demand of users with space-time prism constraints who require  ... 
arXiv:1806.10719v1 fatcat:mewd67jxpzh7zfvkzpoaq6gvqy

The Capacitated Multiple Allocation Hub Location Problem under Demand Uncertainty and Excess Capacity with Possibilistic Programing Approach

Mohammad Reza Shahraki, Shima Shirvani
2021 Tehnički glasnik  
Facility location is a factor of competitiveness and demand satisfaction. Using a hub on the network can facilitate communication across the network and reduce costs.  ...  Finally, the proposed model has been validated by the dataset obtained from Iran Aviation Dataset (IAD) for a round-trip, and the proper locations for facilities in each level and allocation of the customers  ...  Among the features of these problems, the problem space (continuous, discrete, and combinational) and the type of the problem's certainty (certain, probable, and fuzzy) can be mentioned.  ... 
doi:10.31803/tg-20201208185701 fatcat:3wvsmsjwrjhgdgrtch43i425eu

On-demand, Spot, or Both: Dynamic Resource Allocation for Executing Batch Jobs in the Cloud

Ishai Menache, Ohad Shamir, Navendu Jain
2014 IEEE International Conference on Autonomic Computing  
what type (on-demand, spot, or both)? and what bid value to use for spot instances?  ...  This paper introduces an online learning algorithm for resource allocation to address this fundamental tradeoff between computation cost and performance.  ...  We thank our shepherd Alexandru Iosup and the ICAC reviewers for the useful feedback.  ... 
dblp:conf/icac/MenacheSJ14 fatcat:q5cxopr7grdgthndkzbn2otkge

Equilibrium Computation in Resource Allocation Games [article]

Veerle Tan-Timmermans, Tobias Harks
2022 arXiv   pre-print
We study the equilibrium computation problem for two classical resource allocation games: atomic splittable congestion games and multimarket Cournot oligopolies.  ...  The idea is to compute an equilibrium for an associated integrally-splittable singleton congestion game in which the players can only split their demands in integral multiples of a common packet size.  ...  Roughly speaking, they discretized the compact strategy space and use the Lipschitz constants of utility functions to show that only a finite number of representative strategy profiles need to be considered  ... 
arXiv:1612.00190v9 fatcat:sb5vvf24pfbozeilcvyc2xptxm

Pricing in Resource Allocation Games Based on Lagrangean Duality and Convexification [article]

Tobias Harks
2020 arXiv   pre-print
We consider a basic resource allocation game, where the players' strategy spaces are subsets of R^m and cost/utility functions are parameterized by some common vector u∈ R^m and, otherwise, only depend  ...  We show that for finite strategy spaces or certain concave games, the equilibrium existence problem reduces to solving a well-structured LP.  ...  Acknowledgements I thank Dimitris Fotakis, Lukas Graf, Martin Hoefer, Max Klimm, Anja Schedel and Julian Schwarz for helpful discussions and comments on an earlier draft of this manuscript.  ... 
arXiv:1907.01976v3 fatcat:uboddyscdbb2na7ids7cxukn44

Game Dynamics and Bounded Rationality

Hans W Gottinger
2018 Advances in Social Sciences Research Journal  
This generates a (time-dependent) map of the joint strategy space into itself known as 'fictitious play'(FP). This map can be approximated by a discontinuous vector field.  ...  Suppose a game is played repeatedly by a finite collection of players.  ...  Instead of an unwieldy discrete strategy space, we have a convenient continuous strategy space.  ... 
doi:10.14738/assrj.56.4682 fatcat:hjsgk26t4ngsth5i5cplandifq

Evolutionary Game Theory: A Renaissance

Jonathan Newton
2018 Games  
Economic agents are not always rational or farsighted and can make decisions according to simple behavioral rules that vary according to situation and can be studied using the tools of evolutionary game  ...  to economics and the broader social sciences.  ...  [80] consider a similar setup to the paper above, but consider rock, paper, scissors games in both continuous and discrete time. Here we discuss the continuous case.  ... 
doi:10.3390/g9020031 fatcat:xdfjfoxexrcnxltcw3kpoqkpuu

Representing equilibrium aggregates in aggregate games with applications to common agency

David Martimort, Lars Stole
2012 Games and Economic Behavior  
An aggregate game is a normal-form game with the property that each player's payoff is a function of only his own strategy and an aggregate of the strategy profile of all players.  ...  We illustrate the value of this approach in common-agency games where the players' strategy space is an infinite-dimensional space of nonlinear contracts.  ...  All errors are ours. largely restricted attention to games with finite-dimensional strategy spaces and, more often than not, a single-dimension aggregate space. 3 In the games that are of direct interest  ... 
doi:10.1016/j.geb.2012.08.005 fatcat:m46n5kv6ibcr7kjikbadmlo5a4

Distributed Task Management in the Heterogeneous Fog: A Socially Concave Bandit Game [article]

Xiaotong Cheng, Setareh Maghsudi
2022 arXiv   pre-print
Theoretical and numerical analysis shows the superior performance of the proposed strategies for efficient task allocation compared to the state-of-the-art methods.  ...  Moreover, we compare the proposed strategies with a centralized allocation strategy named Learning with Linear Rewards.  ...  A simple approach to solving the MAB problems with continuous arm space is discretizing the action space.  ... 
arXiv:2203.14572v1 fatcat:grl5o2krjngedlyudjwqz6cumu

GIS AND GAME THEORY FOR WATER RESOURCE MANAGEMENT

N. Ganjali, C. Guney
2017 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
Most of the literature on water allocation and conflict problems uses traditional optimization models to identify the most efficient scheme while the Game Theory, as an optimization method, combined GIS  ...  It is concluded that the game theory is used relatively in limited studies of water management fields such as cost/benefit allocation among users, water allocation among trans-boundary users in water resources  ...  -GIS requires strategies for the following: Integration of GIS, Water Resources and Game Theory GIS and game theory integration can be thought of as a process that transforms & combines geographical  ... 
doi:10.5194/isprs-annals-iv-4-w4-215-2017 fatcat:wgtkjn2amfh6jpigaa54hcftze

Dynamic Games in Empirical Industrial Organization [article]

Victor Aguirregabiria, Allan Collard-Wexler, Stephen P. Ryan
2021 arXiv   pre-print
We review different methods to deal with multiple equilibria and large state spaces.  ...  We also describe recent developments for estimating games in continuous time and incorporating serially correlated unobservables, and discuss the use of machine learning methods to solving and estimating  ...  In a discrete time game, if there are N agents with A possible actions each, one has to integrate over A N states.  ... 
arXiv:2109.01725v2 fatcat:pi7btklc3zdejmjuuloxlq4vmm
« Previous Showing results 1 — 15 out of 28,664 results